Fast algorithms for approximating distances

Algorithmica (New York)

Volumn 33, Issue 2, 2002, Pages 263-269

  Bespamyatnikh, S ^a   Segal, M ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Approximation algorithms; Distance selection problem; Well separated pair decomposition

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DECISION THEORY; RANDOM PROCESSES;

DISTANCE SELECTION PROBLEMS;

COMPUTER SCIENCE;

EID: 0141991840     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0114-7     Document Type: Article

References (14)

1. P. Agarwal, B. Aronov, M. Sharir, and S. Suri, Selecting distances in the plane, Algorithmen, 9, 495-514, 1993.
2. P. Agarwal, M. Sharir, and E. Welzl, The discrete 2-center problem, in Proc. 13th ACM Symp. on Computational Geometry, pp. 147-155, 1997.
3. S. Arya and D. Mount, Approximate range searching, in Proc. 11th ACM Symp. on Computational Geometry, pp. 172-181, 1995.
4. J. Bentley, Decomposable searching problems, Inform. Process. Lett., 8, 244-251, 1979.
5. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer-Verlag, New York, 1997.
6. P. Calahan, Dealing with higher dimensions: the well-separated pair decomposition and its applications, Ph.D thesis, Johns Hopkins University, Baltimore, MD, 1995.
7. P. Callahan and R. Kosaraju, Faster algorithms for some geometric graph problems in higher dimensions, in Proc. SODA '93, pp. 291-300, 1993.
8. P. Callahan and R. Kosaraju, A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields, J. Assoc. Comput. Mach., 42(1), 67-90, 1995.
9. T. Chan, On enumerating and selecting distances, in Proc. 14th ACM Symp. on Computational Geometry, pp. 279-286, 1998.
10. J. Erickson, On the relative complexities of some geometric problems, in Proc. 7th Canad. Conf. on Computational Geometry, pp. 85-90, 1995.
11. M. Goodrich, Geometric partitioning made easier, even in parallel, Proc. 9th ACM Symp. on Computational Geometry, pp. 73-82, 1993.
12. M. Katz and M. Sharir, An expander-based approach to geometric optimization, SIAM J. Comput., 26(5), 1384-1408, 1997.
13. N. Megiddo, Applying parallel computation algorithm in the design of serial algorithms, J. Assoc. Comput. Mach., 30, 852-865, 1983.
14. ∞ interdistance selection by parametric searching. Inform. Process. Lett., 30, 9-14, 1989.