Geometric minimum spanning trees via well-separated pair decompositions

ACM Journal of Experimental Algorithmics

Volumn 6, Issue , 2001, Pages

  Narasimhan, Giri ^a   Zachariasen, Martin ^b  

^a The Department of Electrical and Computer Engineering   (United States)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Geometric minimum spanning trees

Indexed keywords

EID: 33746245098     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/945394.945400     Document Type: Article

References (26)

1. Agarwal, P. K., Edelsbrunner, H., Schwarzkopf, O., and Welzl, E. 1991. Euclidean minimum spanning trees and bichromatic closest pairs. Discrete Comput. Geom. 6, 5, 407-422.
2. Applegate, D., Bixby, R., Chvatal, V., and Cook, W. 1999. Concorde - a code for solving Traveling Salesman Problems, http://www.keck.caam.rice.edu/ concorde.html.
3. Barber, B. C, Dobkin, D. P., and Huhdanpaa, H. 1996. The quickhull algorithm for convex hulls. ACM Trans, on Mathematical Software 22, 4 (Dec), 469-483.
4. Bentley, J. L. 1990. K-A trees for semidynamic point sets. In Proc. 6th Annu. ACM Sympos. Comput. Geom. (1990), pp. 187-197.
5. Bentley, J. L. 1992. Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4, 4, 387-411.
6. Bentley, J. L. and Friedman, J. H. 1978. Fast algorithms for constructing minimal spanning trees in coordinate spaces. IEEE Trans. Comput. C-27, 97-105.
7. Bentley, J. L., Weide, B. W., and Yao, A. C. 1980. Optimal expected-time algorthms for closest point problems. ACM Transactions on Mathematical Software 6, 4 (Dec), 563-580.
8. Callahan, P. B. 1995. Dealing with higher dimensions: the well-separated pair decomposition and its applications. Ph. D. thesis, Dept. Comput. Sci., Johns Hopkins University, Baltimore, Maryland.
9. Callahan, P. B. and Kosaraju, S. R. 1993. Faster algorithms for some geometric graph problems in higher dimensions. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms (1993), pp. 291-300.
10. Callahan, P. B. and Kosaraju, S. R. 1995. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. J. ACM 42, 67-90.
11. Chazelle, B. 1997. A faster deterministic algorithm for minimum spanning trees. In Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci. (1997).
12. Clarkson, K. L. 1989. An algorithm for geometric minimum spanning trees requiring nearly linear expected time. Algorithmica 4, 461-469.
13. Dwyer, R. A. 1991. Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput. Geom. 6, 343-367.
14. Eppstein, D. 1999. Spanning trees and spanners. In J.-R. Sack and J. Urrutia Eds., Handbook of Computational Geometry. Elsevier Science Publishers B.V. North-Holland.
15. Finkel, R. A. and Bentley, J. L. 1974. Quad trees: a data structure for retrieval on composite keys. Acta Inform. 4, 1-9.
16. Fredman, F. W. and Willard, D. E. 1993. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 48, 3, 424-436.
17. Karger, D., Klein, P. N., and Tarjan, R. E. 1995. A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42, 321-328.
18. Krznaric, D., Levcopoulos, C, and Nilsson, B. 1997. Minimum spanning trees in d- dimensions. In Proc. 5th European Sympos. on Algorithms (1997), pp. 341-349.
19. Mehlhorn, K. and Naher, S. 1995. LEDA: a platform for combinatorial and geometric computing. Commun. ACM 38, 96-102.
20. Mulmuley, K. 1994. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ.
21. Pugh, W. 1990. Skip lists: a probabilistic alternative to balanced trees. Comm. ACM 33, 6, 668-676.
22. Reinelt, G. 1991. TSPLIB - a traveling salesman problem library. ORSA Journal on Computing 3, 4, 376-384.
23. Rohlf, F. J. 1978. A probabilistic minimum spanning tree algorithm. Inform. Process. Lett. 7, 44-48.
24. Samet, H. 1984. The quadtree and related hierarchical data structures. ACM Comput. Sum. 16, 2 (June).
25. Shewchuk, J. R. 1996. Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In M. C. Lin and D. Manocha Eds., Applied Computational Geometry: Towards Geometric Engineering, Volume 1148 of Lecture Notes in Computer Science, pp. 203-222. Springer-Verlag.
26. Yao, A. C. 1982. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11, 721-736.