Static and dynamic algorithms for k-point clustering problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 709 LNCS, Issue , 1993, Pages 265-276

  Datta, Amitava ^a   Lenhof, Hans Peter ^a   Schwarz, Christian ^a   Smid, Michiel ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85029490640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57155-8_254     Document Type: Conference Paper

References (9)

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.
2. J.L. Bentley. Decomposable searching problems. IPL 8 (1979), 244-251.
3. R.F. Cohen and R. Tamassia. Combine and conquer. Report CS-92-19, Brown University, Providence, 1992.
4. D.P. Dobldn, R.L. Drysdale and L.J. Gnibas. Finding smallest polygons. In: Advances in Computing Research, Computational Geometry, J.A.I. Press, London, 1983, 181-214.
5. D. Eppstein and J. Erickson. Iterated nearest neighbors and finding minimal polytopes. Proc. 4th SODA, 1993, 64-73.
6. H.P. Lenhof and M. Staid. Enumerating the k closest pairs optimally. Proc. 33rd Annual IEEE Syrup. Foundations of Computer Science, 1992, 380-386.
7. C. Schwarz, M. Staid and J. Snoeyink. An optimal algorithm for the on-line closest pair problem. Proc. 8th Syrup. on Comput. Geoms, 1992, 330-336.
8. M. Staid. Maintaining the minimal distance of a point set in polylogarithmic time. Discrete Comput. Geom. 7 (1992), 415-431.
9. M. Staid. Finding k points with a smallest enclosing square. Report MPI-I-92-152, Max-Planck-Institut ffir Informatik, Saarbrficken, 1992.