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(n2 log2 n) time.
Cite
CITATION STYLE
APA
Hagauer, J., & Rote, G. (1993). Three-clustering of points in the plane. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 726 LNCS, pp. 193–199). Springer Verlag. https://doi.org/10.1007/3-540-57273-2_55
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free