New techniques for exact and approximate dynamic closest-point problems

SIAM Journal on Computing

Volumn 25, Issue 4, 1996, Pages 775-796

  Kapoor, Sanjiv ^a,b   Smid, Michiel ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Approximation; Dynamic data structures; Point location; Proximity

Indexed keywords

EID: 0039226642     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539793259458     Document Type: Article

References (26)

1. S. ARYA AND D. M. MOUNT, Approximate nearest neighbor queries in fixed dimensions, in Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1993, pp. 271-280.
2. S. ARYA, D. M. MOUNT, N. S. NETANYAHU, R. SILVERMAN, AND A. WU, An optimal algorithm for approximate nearest neighbor searching, in Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1994, pp. 573-582.
3. J. L. BENTLEY, Decomposable searching problems, Inform. Process. Lett., 8 (1979), pp. 244-251.
4. J. L. BENTLEY AND M. I. SHAMOS, Divide-and-conquer in multidimensional space, in Proc. 8th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1976, pp. 220-230.
5. M. BERN, Approximate closest-point queries in high dimensions, Inform. Process. Lett., 45 (1993), pp. 95-99.
6. B. CHAZELLE AND L. J. GUIBAS, Fractional cascading I: A data structuring technique, Algorithmica, 1 (1986), pp. 133-162.
7. K. L. CLARKSON, A randomized algorithm for closest-point queries, SIAM J. Comput., 17 (1988), pp. 830-847.
8. H. EDELSBRUNNER, G. HARING, AND D. HILBERT, Rectangular point location in d dimensions with applications, Comput. J., 29 (1986), pp. 76-82.
9. M. GOLIN, R. RAMAN, C. SCHWARZ, AND M. SMID, Randomized data structures for the dynamic closest-pair problem, in Proc. 4th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1993, pp. 301-310.
10. _, Simple randomized algorithms for closest pair problems, Nordic J. Comput., 2 (1995), pp. 3-27.
11. p-metric, J. Assoc. Comput. Mach., 27 (1980), pp. 604-618.
12. G. S. LUEKER, A data structure for orthogonal range queries, in Proc. 19th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1978, pp. 28-34.
13. K. MEHLHORN, Data Structures and Algorithms, Volume 3: Multi-Dimensional Searching and Computational Geometry, Springer-Verlag, Berlin, 1984.
14. K. MEHLHORN AND S. NÄHER, Dynamic fractional cascading, Algorithmica, 5 (1990), pp. 215-241.
15. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
16. J. S. SALOWE, Enumerating interdistances in space, Internat. J. Comput. Geom. Appl., 2 (1992), pp. 49-59.
17. C. SCHWARZ, Data structures and algorithms for the dynamic closest pair problem, Ph.D. thesis, Department of Computer Science, Universität des Saarlandes, Saarbrücken, Germany, 1993.
18. C. SCHWARZ, M. SMID, AND J. SNOEYINK, An optimal algorithm for the on-line closest pair problem, Algorithmica, 12 (1994), pp. 18-29.
19. M. I. SHAMOS AND D. HOEY, Closest-point problems, in Proc. 16th Annual IEEE Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1975, pp. 151-162.
20. M. SMID, Maintaining the minimal distance of a point set in less than linear time, Algorithms Review, 2 (1991), pp. 33-44.
21. M. SMID, Dynamic rectangular point location, with an application to the closest pair problem, Inform. Comput., 116 (1995), pp. 1-9.
22. _, Maintaining the minimal distance of a point set in polylogarithmic time, Discrete Comput. Geom., 7 (1992), pp. 415-431.
23. K. J. SUPOWIT, New techniques for some dynamic closest-point and farthest-point problems, in Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, 1990, pp. 84-90.
24. P. M. VAIDYA, An O(n log n) algorithm for the all-nearest-neighbors problem, Discrete Comput. Geom., 4 (1989), pp. 101-115.
25. D. E. WILLARD AND G. S. LUEKER, Adding range restriction capability to dynamic data structures, J. Assoc. Comput. Mach., 32 (1985), pp. 597-617.
26. A. C. YAO, On constructing minimum spanning trees in k-dimensional spaces and related problems, SIAM J. Comput., 11 (1982), pp. 721-736.