DRAWING WITH FAT EDGES

DOI10.1142/S0129054106004315MaRDI QIDQ5493899zbMATH OpenFDO

Authors 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)

Full work available at URL https://doi.org/10.1142/S0129054106004315

zbMATH Keywords

continuous homotopic routingfat edgesgraph drawingVLSI wire routing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2084275
• Drawing Planar Graphs with Large Vertices and Thick Edges
• Drawing graphs with large vertices and thick edges.
• Bold graph drawings
• Fast edge-routing for large graphs

Cites work

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

Cited in

(16)

• Edges and switches, tunnels and bridges
• Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges
• Drawing trees with perfect angular resolution and polynomial area
• Limitations on realistic hyperbolic graph drawing
• Convex grid drawings of planar graphs with constant edge-vertex resolution
• Grid drawings of graphs with constant edge-vertex resolution
• scientific article; zbMATH DE number 2084275 (Why is no real title available?)
• Pinning balloons with perfect angles and optimal area
• Every graph admits an unambiguous bold drawing
• Edges and Switches, Tunnels and Bridges
• Drawing Planar Graphs with Large Vertices and Thick Edges
• scientific article; zbMATH DE number 1839438 (Why is no real title available?)
• A Census of Plane Graphs with Polyline Edges
• Drawing graphs with large vertices and thick edges.
• Convex grid drawings of planar graphs with constant edge-vertex resolution
• Bold graph drawings

This page was built for publication: DRAWING WITH FAT EDGES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493899)