An optimal algorithm for closest-pair maintenance

Discrete and Computational Geometry

Volumn 19, Issue 2, 1998, Pages 175-195

  Bespamyatnikh, S N ^a  

^a URAL FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032389558     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009340     Document Type: Article

References (33)

1. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An Optimal Algorithm for Approximate Nearest-Neighbor Searching. Proc. 5th Annual Symp. Discrete Algorithms, 1994, pp. 573-582.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An Optimal Algorithm for Approximate Nearest-Neighbor Searching (revised version), 1994.
3. M. Ben-Or. Lower Bounds for Algebraic Computation Trees. Proc. 15th Annual ACM Symp. Theory Comput., 1983, pp. 80-86.
4. S. W. Bent, D. D. Sleator and R. E. Tarjan. Biased Search Trees. SIAM J. Comput., 14 (1985), 545-568.
5. J. L. Bentley and M. I. Shamos. Divide-and-Conquer in Multidimensional Space. Proc. 8th Annual ACM Symp. Theory Comput., 1976, pp. 220-230.
6. S. N. Bespamyatnikh. The Region Approach for Some Dynamic Closest-Point Problems. Proc. 6th Canadian Conf. Comput. Geom., 1994, pp. 75-80.
7. S. N. Bespamyatnikh. An Optimal Algorithm for Closest Pair Maintenance. Proc. 11th Annual ACM Symp. Comput. Geom., 1995, pp. 152-161.
8. 1 and Related Problems. Proc. 8th Canadian Conf. Comput. Geom., 1996, pp. 101-106.
9. S. N. Bespamyatnikh. Dynamic Algorithms for Approximate Neighbor Searching. Proc. 8th Canadian Conf. Comput. Geom., 1996, pp. 252-257.
10. P. B. Callahan. Dealing with Higher Dimensions: the Well-Separated Pair Decomposition and Its Applications. Ph.D. Thesis, The Johns Hopkins University, 1995.
11. P. B. Callahan, M. T. Goodrich, and K. Ramaiyer. Topology B-Trees and Their Applications. Proc. 4th Workshop Algorithms Data Struct., 1995, pp. 381-392.
12. P. B. Callahan and S. R. Kosaraju. A Decomposition of Multi-Dimensional Point-Sets with Applications to k-Nearest-Neighbors and n-Body Potential Fields. Proc. 24th Annual ACM Symp. Theory Comput., 1992, pp. 546-556.
13. P. B. Callahan and S. R. Kosaraju. Algorithms for Dynamic Closest Pair and n-Body Potential Fields. Proc. 6th Annual ACM-SIAM Symp. Discrete Algorithms, 1995, pp. 263-272.
14. Y.-J. Chiang, F. T. Preparata, and R. Tamassia. A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps. Proc. 4th ACM-SIAM Symp. on Discrete Algorithms. 1993, pp. 44-53.
15. R. F. Cohen and R. Tamassia. Combine and Conquer: a General Technique for Dynamic Algorithms. Proc. First European Symp. Algorithms. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1993, pp. 97-108.
16. G. N. Frederickson. A Data Structure for Dynamically Maintaining Rooted Trees. Proc. 4th Annual ACM-SIAM Symp. Discrete Algorithms, 1993, pp. 175-194.
17. M. J. Golin, R. Raman, C. Schwarz, and M. Smid. Randomized Data Structures for the Dynamic Closest-Pair Problem. Proc. 4th Annual ACM-SIAM Symp. Discrete Algorithms, 1993, pp. 301-310.
18. M. J. Golin, R. Raman, C. Schwarz, and M. Smid. Simple Randomized Algorithms for Closest Pair Problems. Proc. 5th Canadian Conf. Comput. Geom., 1993, pp. 246-251.
19. S. Kapoor and M. Smid. New Techniques for Exact and Approximate Dynamic Closest-Point Problems. Proc. 10th Annual ACM Symp. Comput. Geom., 1994, pp. 165-174.
20. H.-P. Lenhof and M. Smid. Enumerating the k Closest Pair Optimally. Proc. 33rd Annual IEEE Symp. Found. Comput. Sci., 1992, pp. 380-386.
21. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction, 2nd edn. Springer-Verlag, New York, 1988.
22. J. S. Salowe. Shallow Interdistance Selection and Interdistance Enumeration. Internat. J. Comput. Geom. Appl., 2 (1992), 49-59.
23. C. Schwarz. Data Structures and Algorithms for the Dynamic Closest Pair Problem. Ph.D. Thesis, Universität des Saarbrücken, 1993.
24. C. Schwarz and M. Smid. An O (n log n log log n) Algorithm for the On-Line Closest Pair Problem. Proc. 3th ACM-SIAM Symp. Discrete Algorithms, 1992, pp. 280-285.
25. C. Schwarz, M. Smid, and J. Snoeyink. An Optimal Algorithm for the On-Line Closest-Pair Problem. Proc. 8th Annual ACM Symp. Comput. Geom., 1992, pp. 330-336.
26. M. I. Shamos and D. Hoey. Closest-Point Problem. Proc. 16th Annual IEEE Symp. Found. Comput. Sci., 1975, pp. 151-162.
27. D. D. Sleator and R. E. Tarjan. A Data Structure for Dynamic Trees. J. Comput. System Sci., 26 (1983), 362-391.
28. M. Smid. Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem. Technical Report MPI-I-91-101, Max-Plank-Institut für Informatik, Saarbrücken, 1991.
29. M. Smid. Maintaining the Minimal Distance of a Point Set in Less Than Linear Time. Algorithms Rev., 2 (1991), 33-44.
30. M. Smid. Maintaining the Minimal Distance of a Point Set in Polylogarithmic Time. Discrete Comput. Geom., 7 (1992), 415-431.
31. K. L. Supowit. New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. Proc. 1st Annual ACM-SIAM Symp. Discrete Algorithms, 1990, pp. 84-90.
32. P. M. Vaidya. An Optimal Algorithm for All-Nearest-Neighbors Problem. Proc. 27th Annual Symp. Found. Comput. Sci., 1986, pp. 117-122.
33. P. M. Vaidya. An O (n log n) Algorithm for All-Nearest-Neighbors Problem. Discrete Comput. Geom., 4 (1989), 101-115