Abstract
Given n points in the plane, we partition them into three classes such that the maximum distance between two points in the same class is minimized. The algorithm takes O(n 2 log2 n) time.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Te. Asano, B. Bhattacharya, M. Keil, and F. Yao: Clustering algorithms based on minimum and maximum spanning trees. In: Proc. 4th Ann. Symp. Comput. Geometry (1988), pp. 252–257
V. Capoyleas, G. Rote, and G. Woeginger: Geometric clusterings. J. Algorithms 12 (1991), 341–356
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
J. Hershberger: Minimizing the sum of diameters efficiently. Comput. Geom. Theory Appl. 2 (1992), 111–118
J. Hershberger and S. Suri: Finding Taylored Partitions. J. Algorithms 12 (1991), 431–463
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hagauer, J., Rote, G. (1993). Three-clustering of points in the plane. In: Lengauer, T. (eds) Algorithms—ESA '93. ESA 1993. Lecture Notes in Computer Science, vol 726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57273-2_55
Download citation
DOI: https://doi.org/10.1007/3-540-57273-2_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57273-2
Online ISBN: 978-3-540-48032-7
eBook Packages: Springer Book Archive