Efficient minimum spanning tree construction without Delaunay triangulation [VLSI CAD]

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn 2001-January, Issue , 2001, Pages 192-197

  Zhou, Hai ^a   Shenoy, N ^a   Nicholls, W ^a  

^a SYNOPSYS INC   (United States)

Author keywords

Algorithm design and analysis; Computational geometry; Design automation; Euclidean distance; Testing; Tree graphs; Very large scale integration; Wire

Indexed keywords

AUTOMATION; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; DESIGN; INTEGRATION TESTING; SURVEYING; TESTING; TRIANGULATION; VLSI CIRCUITS; WIRE;

ALGORITHM DESIGN AND ANALYSIS; DELAU-NAY TRIANGULATIONS; DESIGN AUTOMATIONS; EUCLIDEAN DISTANCE; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; TOTAL LENGTH; TREE GRAPH;

TREES (MATHEMATICS);

EID: 50649094600     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2001.913303     Document Type: Conference Paper

References (12)

1. T. H. Cormen, C. E. Leiserson, and R. H. Rivest. Introduction to Algorithms. MIT Press, 1989.
2. Steven Fortune. A sweepline algorithm for voronoi diagrams. Algorithmica, 2:153-174, 1987.
3. ∞ Delaunay Triangulation. In Algorithmica, volume 6, pages 207-221, 1991.
4. 1 metric. Information Processing Letters, 17(4):219-223, 8 November 1983.
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.
6. E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.
7. Edward M. McCreight. Priority search trees. SIAM Journal of Computing, 14(2):257-276, May 1985.
8. Franco P. Preparata and Michael Ian Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985.
9. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6), 1990.
10. Gabriel Robins and Jeffrey S. Salowe. Low-degree minimum spanning tree. Discrete and Computational Geometry, 14:151-165, September 1995.
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.
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.