Skip to main content

Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra

  • Conference paper
Book cover FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2914))

  • 379 Accesses

Abstract

We propose a natural scheme to measure the (so-called) joint separation of a cluster of objects in general geometric settings. In particular, here the measure is developed for finite sets of planes in ℝ3 in terms of extreme configurations of vectors on the planes of a given set. We prove geometric and graph-theoretic results about extreme configurations on arbitrary finite plane sets. We then specialize to the planes bounding a regular polyhedron in order to exploit the symmetries. However, even then results are non-trivial and surprising – extreme configurations on regular polyhedra may turn out to be highly irregular.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aggarwal, A., Imai, H., Katoh, N., Suri, S.: Finding k points with minimum diameter and related problems. In: Proc. 5th Annual ACM Symp. on Comp. Geom., pp. 283–291 (1989)

    Google Scholar 

  2. Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293–306 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Guha, S., Josiah, P., Mittal, A., Tran, S.D.: Non-Delaunay-based curve reconstruction. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 79–90. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Jain, K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)

    MATH  Google Scholar 

  5. O’Neill, B.: Elementary Differential Geometry. Academic Press, London (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guha, S. (2003). Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24597-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20680-4

  • Online ISBN: 978-3-540-24597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics