Three-clustering of points in the plane

Computational Geometry: Theory and Applications

Volumn 8, Issue 2, 1997, Pages 87-95

  Hagauer, Johann ^a   Rote, Günter ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Constraint propagation; Diameter; Geometric clustering

Indexed keywords

EID: 0345984361     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00022-3     Document Type: Article

References (8)

1. Te. Asano, B. Bhattacharya, M. Keil and F. Yao, Clustering algorithms based on minimum and maximum spanning trees, in: Proc. 4th Ann. Sympos. Comput. Geom. (1988) 252-257.
2. V. Capoyleas, G. Rote and G. Woeginger, Geometric clusterings, J. Algorithms 12 (1991) 341-356.
3. H. Edelsbrunner, D.G. Kirkpatrick and R. Seidel, On the shape of a set of points in the plane, IEEE Trans. Inform. Theory IT-29 (1983) 551-559.
4. H. Edelsbrunner, A.D. Robison and X. Shen, Covering convex sets with non-overlapping polygons, Discrete Math. 81 (1990) 153-164.
5. J. Hagauer and G. Rote, Three-clustering of points in the plane, in: T. Lengauer, ed., Algorithms - ESA '93, Proc. 1st Ann. European Sympos. Algorithms, Bad Honnef, Germany, September 1993, Lecture Notes in Computer Science 726 (Springer, Berlin, 1993) 192-199.
6. J. Hershberger, Minimizing the sum of diameters efficiently, Computational Geometry 2 (1992) 111-118.
7. J. Hershberger and S. Suri, Finding Taylored partitions, J. Algorithms 12 (1991) 431-463.
8. M. Sharir, A near-linear algorithm for the planar 2-center problem, in: Proc. 12th Ann. Sympos. Comput. Geom. (1996) 106-112; also: Discrete Comput. Geom., to appear.