homotopic routing
Recently Published Documents


TOTAL DOCUMENTS

3
(FIVE YEARS 0)

H-INDEX

2
(FIVE YEARS 0)

Author(s):  
Kan Huang ◽  
Chien-Chun Ni ◽  
Rjk Sarkar ◽  
Jie Gao ◽  
Joseph S. B. Mitchell

1996 ◽  
Vol 06 (01) ◽  
pp. 1-13 ◽  
Author(s):  
MICHAEL KAUFMANN ◽  
SHAODI GAO ◽  
K. THULASIRAMAN

In this paper we present an algorithm for Steiner minimal trees in grid graphs with all terminals located on the boundary of the graph. The algorithm runs in O(min{k4, k2n}) time, where k and n are the numbers of terminals and vertices of the graph, respectively. It can handle non-convex boundaries and is the fastest known for this case. We also consider the homotopic routing problem and apply our Steiner tree algorithm to construct minimum-length wires for multi-terminal nets.


Sign in / Sign up

Export Citation Format

Share Document