On enumerating and selecting distances

International Journal of Computational Geometry and Applications

Volumn 11, Issue 3, 2001, Pages 291-304

  Chan, Timothy M ^a,b  

^a UNIVERSITY OF MIAMI   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Closest pairs; Distance enumeration; Distance selection; Randomized algorithms; Range counting

Indexed keywords

EID: 0035594058     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195901000511     Document Type: Article

References (36)

1. P. K. Agarwal, B. Aronov, M. Sharir, and S. Suri, "Selecting distances in the plane," Algorithmica 9 (1993) 495-514.
2. P. K. Agarwal and J. Erickson, "Geometric range searching and its relatives," in Advances in Discrete and Computational Geometry, eds. B. Chazelle, J. E. Goodman, and R. Pollack (AMS Press, 1999) pp. 1-56.
3. P. K. Agarwal and J. Matoušek, "On range searching with semialgebraic sets," Discrete Comput. Geom. 11 (1994) 393-418.
4. S. Arya and M. Smid, "Efficient construction of a bounded-degree spanner with low weight," Algorithmic 17 (1997) 33-54.
5. J. L. Bentley and M.I. Shamos, "Divide-and-conquer in multidimensional space," Proc. 8th ACM Sympos. Theory Comput., 1976, pp. 220-230.
6. M. de Berg and O. Schwarzkopf, "Cuttings and applications," Int. J. Comput. Geom. Appl. 5 (1995) 343-355.
7. T. M. Chan, "Output-sensitive results on convex hulls, extreme points, and related problems," Discrete Comput. Geom. 16 (1996) 369-387.
8. 8. T. M. Chan. "Random sampling, halfspace range reporting, and construction of (≤ &)-levels in three dimensions," Proc. 39th IEEE Sympos. Found. Comput. Sci., 1998, pp. 586-595. SIAM J. Comput., to appear.
9. T. M. Chan. "Random sampling, halfspace range reporting, and construction of (≤ &)-levels in three dimensions," Proc. 39th IEEE Sympos. Found. Comput. Sci., 1998, pp. 586-595. SIAM J. Comput., to appear.
10. B. Chazelle, L. Guibas, and D. T. Lee, "The power of geometric duality," BIT 25 (1985) 76-90.
11. B. Chazelle, M. Sharir, and E. Welzl, "Quasi-optimal upper bounds for simplex range searching and new zone theorems," Algorithmica 8 (1992) 407-429.
12. R. Cole, "Slowing down sorting networks to obtain faster sorting algorithms," J. ACM 34 (1987) 200-208.
13. M. T. Dickerson, R. L. S. Drysdale, and J.-R. Sack, "Simple algorithms for enumerating interpoint distances and finding k nearest neighbors," Int. J. Comput. Geom. Appl. 2 (1992) 221-239.
14. M. T. Dickerson and D. Eppstein, "Algorithms for proximity problems in higher dimensions," Comput. Geom. Theory Appl. 5 (1996) 277-291.
15. M. T. Dickerson and J. Shugart, "A simple algorithm for enumerating longest distances in the plane," Inform. Process. Lett. 45 (1993) 269-274.
16. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen, "A reliable randomized algorithm for the closest-pair problem," J. Algorithms 25 (1997) 19-51.
17. M. Dillencourt, D. Mount, and N. Netanyahu, "A randomized algorithm for slope selection," Int. J. Comput. Geom. Appl. 2 (1992) 1-27.
18. S. J. Fortune and J. E. Hopcroft, "A note on Rabin's nearest-neighbor algorithm," Inform. Process. Lett. 8 (1979) 20-23.
19. M. Golin, R. Raman, C. Schwarz, and M. Smid, "Simple randomized algorithms for closest pair problems," Nordic J. Comput. 2 (1995) 3-27.
20. M. T. Goodrich, "Geometric partitioning made easier, even in parallel," Proc. 9th ACM Sympos. Comput. Geom., 1993, pp. 73-82.
21. G. N. Frederickson and D. B. Johnson, "The complexity of selection and ranking in X + Y and matrices with sorted rows and columns," J. Comput. Sys. Sci. 24 (1982) 197-208.
22. N. Katoh and K. Iwano, "Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane," Int. J. Comput. Geom. Appl. 5 (1995) 37-51.
23. M. Katz and M. Sharir, "An expander-based approach to geometric optimization," SIAM J. Comput. 26 (1997) 1384-1408.
24. S. Khuller and Y. Matias, "A simple randomized sieve algorithm for the closest-pair problem," Inform. Comput. 118 (1995) 34-37.
25. H.-P. Lenhof and M. Smid, "Sequential and parallel algorithms for the k closest pairs problem," Int. J. Comput. Geom. Appl. 5 (1995) 273-288.
26. J. Matoušek, "Randomized optimal algorithm for slope selection," Inform. Process. Lett. 39 (1991) 183-187.
27. J. Matoušek, "Efficient partition trees," Discrete Comput. Geom. 8 (1992) 315-334.
28. J. Matoušek, "Reporting points in halfspaces," Comput. Geom. Theory Appl. 2 (1992) 169-186.
29. J. Matoušek, "Geometric range searching," ACM Comput. Surveys 26 (1994) 421-461.
30. N. Megiddo, "Applying parallel computation algorithms in the design of serial algorithms," J. ACM 30 (1983) 852-865.
31. R. Motwani and P. Raghavan, Randomized Algorithms (Cambridge University Press, New York, 1995).
32. M. Pellegrini, "On counting pairs of intersecting segments and off-line triangle range searching," Algorithmica 17 (1997) 380-398.
33. M. O. Rabin, "Probabilistic algorithms," in Algorithms and Complexity, ed. J. F. Traub (Academic Press, New York, 1976) pp. 21-30.
34. J. S. Salowe, "Enumerating interdistances in space," Int. J. Comput. Geom. Appl. 2 (1992) 49-59.
35. M. Smid, "Closest-point problems in computational geometry," to appear in Handbook of Computational Geometry, eds. J. Urrutia and J. Sack (North-Holland).
36. P. M. Vaidya, "An O(n log n) algorithm for the all-nearest-neighbors problem," Discrete Comput. Geom. 4 (1989) 101-115.