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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Gonzalez, T.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 293–306 (1985)
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)
Jain, K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)
O’Neill, B.: Elementary Differential Geometry. Academic Press, London (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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