I/O-efficient well-separated pair decomposition and applications

Algorithmica (New York)

Volumn 45, Issue 4, 2006, Pages 585-614

  Govindarajan, Sathish ^a   Lukovszki, Tamas ^b   Maheshwari, Anil ^c   Zeh, Norbert ^d  

^a Duke University   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

^c CARLETON UNIVERSITY   (Canada)

^d DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Closest pair problem; Computational geometry; External memory algorithms; Proximity problems; Spanners; Well separated pair decomposition

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; LINEAR EQUATIONS; PROBLEM SOLVING; SET THEORY;

CLOSEST-PAIR PROBLEMS; EXTERNAL-MEMORY ALGORITHMS; PROXIMITY PROBLEMS; SPANNERS; WELL-SEPARATED PAIR DECOMPOSITION;

INPUT OUTPUT PROGRAMS;

EID: 33746238773     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1197-3     Document Type: Article

References (50)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(9):1116-1127, September 1988.
2. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets, pages 313-357. Kluwer, Dordrecht, 2002.
3. L. Arge. The buffer tree: a technique for designing batched external data structures. Algorithmica, 37(1):1-24, 2003.
4. L. Arge and P. B. Miltersen. On showing lower bounds for external-memory computational geometry problems. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualization. AMS, Providence, RI, 1999.
5. S. Arya, D. M. Mount, and M. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 703-712, 1994.
6. R. Bayer and E. McCreight. Organization of large ordered indexes. Acta Informatica, 1:173-189, 1972.
7. M. Ben-Or. Lower bounds for algebraic computation trees. In Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, pages 80-86, 1983.
8. J. L. Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23:214-229, 1980.
9. S. N. Bespamyatnikh. An optimal algorithm for closest-pair maintenance. Discrete & Computational Geometry, 19(2): 175-195, 1998.
10. P. B. Callahan. Optimal parallel all-nearest-neighbors using the well-separated pair decomposition. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 332-341, 1993.
11. P. B. Callahan. Dealing with Higher Dimensions: The Well-Separated Pair Decomposition and Its Applications. Ph.D. thesis, Johns Hopkins University, Baltimore, MD, 1995.
12. P. B. Callahan, M. Goodrich, and K. Ramaiyer. Topology B-trees and their applications. In Proceedings of the 4th Workshop on Algorithms and Data Structures, pages 381-392. Volume 955 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
13. P. B. Callahan and S. R. Kosaraju. Faster algorithms for some geometric graph problems in higher dimensions. In Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 291-300, 1993.
14. P. B. Callahan and S. R. Kosaraju. Algorithms for dynamic closest pair and n-body potential fields. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 263-272, 1995.
15. P. B. Callahan and S. R. Kosaraju. A decomposition of multidimensional point sets with applications to k-nearest neighbors and n-body potential fields. Journal of the ACM, 42:67-90, 1995.
16. P. Chew. There is a planar graph almost as good as the complete graph. In Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, pages 169-177, 1986.
17. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 139-149, January 1995.
18. K. L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, pages 226-232, 1983.
19. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In Proceedings of the 19th ACM Symposium on the Theory of Computing, pages 56-65, 1987.
20. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms, first edition. MIT Press, Cambridge, MA, 1990.
21. A. Crauser, P. Ferragina, K. Mehlhorn, U. Meyer, and E. Ramos. Randomized external-memory algorithms for line segment intersection and other geometric problems. International Journal of Computational Geometry & Applications, 11(3):305-338, 2001.
22. M. T. Dickerson, R. L. S. Drysdale, and J.-R. Sack. Simple algorithms for enumerating interpoint distances and finding k nearest neighbors. International Journal of Computational Geometry & Applications, 2:221-239, 1993.
23. M. T. Dickerson and D. Eppstein. Algorithms for proximity problems in higher dimensions. Computational Geometry: Theory and Applications, 5:277-291, 1996.
24. D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. North-Holland, Amsterdam, 2000.
25. G. N. Frederickson. A data structure for dynamically maintaining rooted trees. Journal of Algorithms, 24:37-65, 1997.
26. M. Golin, R. Raman, C. Schwarz, and M. Smid. Randomized data structures for the dynamic closest-pair problem. SIAM Journal on Computing, 27:1036-1072, 1998.
27. M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. External-memory computational geometry. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 714-723, November 1993.
28. S. Govindarajan, T. Lukovszki, A. Maheshwari, and N. Zeh. I/O-efficient well-separated pair decomposition and its applications. In Proceedings of the 8th Annual European Symposium on Algorithms, pages 220-231. Volume 1879 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, September 2000.
29. J. M. Keil and C. A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7:13-28, 1992.
30. S. Khuller and Y. Matias. A simple randomized sieve algorithm for the closest-pair problem. Information and Computation, 118:34-37, 1995.
31. H.-P. Lenhof and M. Smid. Sequential and parallel algorithms for the k closest pairs problem. International Journal of Computational Geometry & Applications, 5:273-288, 1995.
32. T. Lukovszki, A. Maheshwari, and N. Zeh. I/O-efficient batched range counting and its applications to proximity problems. In Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, pages 244-255. Volume 2245 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
33. U. Meyer, P. Sanders, and J. Sibeyn, editors. Algorithms for Memory Hierarchies: Advanced Lectures. Volume 2625 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2003.
34. G. Narasimhan and M. Smid. Geometric Spanner Networks. Cambridge University Press, Cambridge, to appear.
35. G. Narasimhan and M. Zachariasen. Geometric minimum spanning tree via well-separated pair decompositions. Journal of Experimental Algorithmics, 6, 2001.
36. M. H. Nodine and J. S. Vitter. Deterministic distribution sort in shared and distributed memory multiprocessors. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 120-129, June/July 1993.
37. W. Pugh. Skip lists: a probabilistic alternative to balanced search trees. Communications of the ACM, 33:668-676, 1990.
38. M. O. Rabin. Probabilistic algorithms. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, pages 21-39. Academic Press, New York, 1976.
39. J. Ruppert and R. Seidel. Approximating the d-dimensional complete Euclidean graph. In Proceedings of the 3rd Canadian Conference on Computational Geometry, pages 207-210, 1991.
40. J. S. Salowe. Enumerating interdistances in space. International Journal of Computational Geometry & Applications, 2:49-59, 1992.
41. C. Schwarz, M. Smid, and J. Snoeyink. An optimal algorithm for the on-line closest-pair problem. Algorithmica, 12:18-29, 1994.
42. R. Seidel. Backwards analysis of randomized geometric algorithms. In J. Pach, editor, New Trends in Discrete and Computational Geometry, pages 37-67. Springer-Verlag, New York, 1993.
43. M. I. Shamos. Geometric complexity. In Proceedings of the 7th Annual ACM Symposium on the Theory of Computing, pages 224-233, 1975.
44. M. I. Shamos and D. Hoey. Closest-point problems. In Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, pages 151-162, 1975.
45. M. Smid. Maintaining the minimal distance of a point set in less than linear time. Algorithms Review, 2:33-44, 1991.
46. M. Smid. Closest-point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry. North-Holland, Amsterdam, 2000.
47. P. M. Vaidya. An O(n log n) algorithm for the all-nearest-neighbors problem. Discrete & Computational Geometry, 4:101-115, 1989.
48. J. S. Vitter. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33(2)209-211, 2001.
49. A. C. Yao. On constructing minimum spanning trees in k-dimensional space and related problems. SIAM Journal on Computing, 11:721-736, 1982.
50. N. Zeh. I/O-Efficient Algorithms for Shortest Path Related Problems. Ph.D. thesis, School of Computer Science, Carleton University, 2002.