Hai Zhou
ABSTRACT
Minimum spanning tree problem is a very important problem in VLSI CAD. Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs of points and takes at least ω(n2) time. More efficient approaches find a minimum spanning tree only among edges in the Delaunay triangulation of the points. However, Delaunay triangulation is not well defined in rectilinear distance. In this paper, we first establish a framework for minimum spanning tree construction which is based on a general concept of spanning graphs. A spanning graph is a natural definition and not necessarily a Delaunay triangulation. Based on this framework, we then design an O(n log n) sweep-line algorithm to construct a rectilinear minimum spanning tree without using Delaunay triangulation.
- 1.T. H. Cormen, C. E. Leiserson, and R. H. Rivest. Introduction to Algorithms. MIT Press, 1989. Google Scholar
Digital Library
- 2.Steven Fortune. A sweepline algorithm for voronoi diagrams. Algorithmica, 2:153-174, 1987.Google ScholarDigital Library
- 3.Linda L. Deneen Gary M. Shute and Clark D. Thomborson. An O(n log n) Plane-Sweep Algorithm for L1 and L1 Delaunay Triangulation. In Algorithmica, volume 6, pages 207-221, 1991.Google Scholar
- 4.Leo J. Guibas and Jorge Stolfi. On computing all north-east nearest neighbors in the L1 metric. Information Processing Letters, 17(4):219-223, 8 November 1983.Google ScholarCross Ref
- 5.F. K. Hwang. An o(n log n) algorithm for rectilinear minimal spanning trees. Journal of the ACM, 26(2):177-182, April 1979. Google ScholarDigital Library
- 6.E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.Google Scholar
- 7.Edward M. McCreight. Priority search trees. SIAM Journal of Computing, 14(2):257-276, May 1985.Google ScholarDigital Library
- 8.Franco P. Preparata and Michael Ian Shamos. Computational Geometry: An Introduction. Springer- Verlag, 1985. Google ScholarDigital Library
- 9.W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6), 1990. Google ScholarDigital Library
- 10.Gabriel Robins and Jeffrey S. Salowe. Low-degree minimum spanning tree. Discrete and Computational Geometry, 14:151-165, September 1995.Google ScholarDigital Library
- 11.Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721- 736, November 1982.Google ScholarCross Ref
- 12.S. Q. Zheng, J. S. Lim, and S. S. Iyengar. Finding obstacle-avoiding shortest paths using implicit connection graphs. IEEE Transactions on Computer Aided Design, 15(1):103-110, January 1996. Google ScholarDigital Library
Index Terms
- Efficient minimum spanning tree construction without Delaunay triangulation
Recommendations
Efficient Steiner tree construction based on spanning graphs
ISPD '03: Proceedings of the 2003 international symposium on Physical designSteiner Minimal Tree (SMT) problem is a very important problem in VLSI CAD. Given n points on a plane, a Steiner minimal tree connects these points through some extra points (called Steiner points) to achieve a minimal total length. Even though there ...
Geometric Minimum Diameter Minimum Cost Spanning Tree Problem
ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and ComputationIn this paper we consider bi-criteria geometric optimization problems, in particular, the minimum diameter minimum cost spanning tree problem and the minimum radius minimum cost spanning tree problem for a set of points in the plane. The former problem ...
Comments