Skip to main content
SpringerLink
Log in

Three-clustering of points in the plane

  • Conference paper
  • First Online:
Algorithms—ESA '93 (ESA 1993)

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

Included in the following conference series:

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 to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

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

    Google Scholar 

  • V. Capoyleas, G. Rote, and G. Woeginger: Geometric clusterings. J. Algorithms 12 (1991), 341–356

    Google Scholar 

  • 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

    Google Scholar 

  • J. Hershberger: Minimizing the sum of diameters efficiently. Comput. Geom. Theory Appl. 2 (1992), 111–118

    Google Scholar 

  • J. Hershberger and S. Suri: Finding Taylored Partitions. J. Algorithms 12 (1991), 431–463

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Grundlagen der Informationsverarbeitung, Technische Universität Graz, Klosterwiesgasse 32/II, A-8010, Graz, Austria

    Johann Hagauer

  2. Technische Universität Graz, Institut für Mathematik, Steyrergasse 30, A-8010, Graz, Austria

    Günter Rote

Authors
  1. Johann Hagauer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günter Rote
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Lengauer

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation