Drawing with fat edges

DOI10.1007/3-540-45848-4_14MaRDI QIDQ3043714zbMATH OpenFDO

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

Publication date 6 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650162.htm

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

• DRAWING WITH FAT EDGES
• 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

Cited in

(9)

• Schematization of networks
• Thick non-crossing paths in a polygonal domain
• Computing homotopic shortest paths efficiently
• Group-Level Analysis and Visualization of Social Networks
• Drawing Planar Graphs with Large Vertices and Thick Edges
• Multi-circular Layout of Micro/Macro Graphs
• DRAWING WITH FAT EDGES
• Drawing graphs with large vertices and thick edges.
• The visibility-Voronoi complex and its applications

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