Growing fat graphs

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2002, Pages 277-278

  Efrat, A ^a   Kobourov, S ^a   Stepp, M ^a   Wenk, C ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DIGITAL LIBRARIES; INTEGRATED CIRCUIT LAYOUT; JAVA PROGRAMMING LANGUAGE; MATHEMATICAL MODELS; SET THEORY; THREE DIMENSIONAL COMPUTER GRAPHICS; VLSI CIRCUITS;

FAT GRAPHS;

GRAPH THEORY;

EID: 0036355325     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/513400.513434     Document Type: Conference Paper

References (6)

1. River routing every which way, but loose
2. Drawing with fat edges
3. On continuous homotopic one layer routing
4. Computing minimum length paths of a given homotopy class
5. Algorithms for routing and testing routability of planar VLSI layouts
6. Optimal placement for river routing