DRAWING WITH FAT EDGES

DOI10.1142/S0129054106004315zbMath1102.68513MaRDI QIDQ5493899

Christian A. Duncan, Stephen G. Kobourov, Carola Wenk, Alon Efrat

Publication date: 16 October 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

graph drawingcontinuous homotopic routingfat edgesVLSI wire routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Limitations on realistic hyperbolic graph drawing ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ Pinning Balloons with Perfect Angles and Optimal Area ⋮ Every Graph Admits an Unambiguous Bold Drawing ⋮ Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges ⋮ Drawing trees with perfect angular resolution and polynomial area ⋮ Bold graph drawings ⋮ Grid drawings of graphs with constant edge-vertex resolution ⋮ Convex grid drawings of planar graphs with constant edge-vertex resolution ⋮ A Census of Plane Graphs with Polyline Edges

Cites Work

• River routing in VLSI
• Disjoint homotopic paths and trees in a planar graph
• Testing homotopy for paths in the plane
• Edge-Disjoint Homotopic Paths in Straight-Line Planar Graphs
• Optimal Placement for River Routing
• Routing through a generalized switchbox
• Embedding planar graphs at fixed vertex locations

This page was built for publication: DRAWING WITH FAT EDGES