Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Static and dynamic algorithms for k-point clustering problems

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1993)

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

Included in the following conference series:

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

  1. A. Aggarwal, H. Imai, N. Katoh and S. Suri. Finding k points with minimum diameter and related problems. J. Algorithms 12 (1991), 38–56.

    Article  Google Scholar 

  2. J.L. Bentley. Decomposable searching problems. IPL 8 (1979), 244–251.

    Article  Google Scholar 

  3. R.F. Cohen and R. Tamassia. Combine and conquer. Report CS-92-19, Brown University, Providence, 1992.

    Google Scholar 

  4. D.P. Dobkin, R.L. Drysdale and L.J. Guibas. Finding smallest polygons. In: Advances in Computing Research, Computational Geometry, J.A.I. Press, London, 1983, 181–214.

    Google Scholar 

  5. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Proc. 4th SODA, 1993, 64–73.

    Google Scholar 

  6. H.P. Lenhof and M. Smid. Enumerating the k closest pairs optimally. Proc. 33rd Annual IEEE Symp. Foundations of Computer Science, 1992, 380–386.

    Google Scholar 

  7. C. Schwarz, M. Smid and J. Snoeyink. An optimal algorithm for the on-line closest pair problem. Proc. 8th Symp. on Comput. Geom., 1992, 330–336.

    Google Scholar 

  8. M. Smid. Maintaining the minimal distance of a point set in polylogarithmic time. Discrete Comput. Geom. 7 (1992), 415–431.

    Google Scholar 

  9. M. Smid. Finding k points with a smallest enclosing square. Report MPI-I-92-152, Max-Planck-Institut für Informatik, Saarbrücken, 1992.

    Google Scholar 

Download references

Author information

Author notes

  1. Amitava Datta, Hans-Peter Lenhof, Christian Schwarz & Michiel Smid

    Present address: Max-Planck-Institut für Informatik, W-6600, Saarbrücken, Germany

Authors and Affiliations

    Authors
    1. Amitava Datta
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Hans-Peter Lenhof
      View author publications

      You can also search for this author in PubMed Google Scholar

    3. Christian Schwarz
      View author publications

      You can also search for this author in PubMed Google Scholar

    4. Michiel Smid
      View author publications

      You can also search for this author in PubMed Google Scholar

    Editor information

    Frank Dehne Jörg-Rüdiger Sack Nicola Santoro Sue Whitesides

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 1993 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Datta, A., Lenhof, HP., Schwarz, C., Smid, M. (1993). Static and dynamic algorithms for k-point clustering problems. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_254

    Download citation

    • DOI: https://doi.org/10.1007/3-540-57155-8_254

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-57155-1

    • Online ISBN: 978-3-540-47918-5

    • eBook Packages: Springer Book Archive

    Publish with us

    Policies and ethics

    Search

    Navigation