Efficient minimum spanning tree construction without Delaunay triangulation

Information Processing Letters

Volumn 81, Issue 5, 2002, Pages 271-276

  Zhou, Hai ^a   Shenoy, Narendra ^b   Nicholls, William ^b  

^a Northwestern University   (United States)

^b SYNOPSYS INC   (United States)

Author keywords

Computational geometry; Graph algorithms; Minimal spanning tree; Wire routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; TRIANGULATION;

GRAPH ALGORITHMS; MINIMAL SPANNING TREES;

TREES (MATHEMATICS);

EID: 0037117171     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(01)00232-0     Document Type: Article

References (12)

1. A sweepline algorithm for Voronoi diagrams
2. ∞ Delaunay triangulation
3. 1 metric
4. An O(n logn) algorithm for rectilinear minimal spanning trees
5. Priority search trees
6. Skip lists: A probabilistic alternative to balanced trees
7. Low-degree minimum spanning tree
8. On constructing minimum spanning trees in k-dimensional spaces and related problems
9. Finding obstacle-avoiding shortest paths using implicit connection graphs