Sketch-driven orthogonal graph drawing

DOI10.1007/3-540-36151-0_1MaRDI QIDQ4422257zbMATH OpenFDO

Authors Ulrik Brandes, Markus Eiglsperger, Michael Kaufmann, Dorothea Wagner

Publication date 3 September 2003

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/2528/25280001.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

• A better heuristic for orthogonal graph drawings
• scientific article; zbMATH DE number 1445279
• Some modifications of Sugiyama approach
• Orthogonal graph drawing
• Techniques for the Refinement of Orthogonal Graph Drawings

Cited in

(10)

• How to draw the minimum cuts of a planar graph
• On \(d\)-regular schematization of embedded paths
• scientific article; zbMATH DE number 1194183 (Why is no real title available?)
• Computing labeled orthogonal drawings
• Interactive orthogonal graph drawing
• scientific article; zbMATH DE number 1445279 (Why is no real title available?)
• Planar L-Drawings of Bimodal Graphs
• Orthogonal Hypergraph Drawing for Improved Visibility
• Accelerated bend minimization
• Towards cognitive evaluation of computer-drawn sketches

Describes a project that uses

Uses Software

• yFiles

This page was built for publication: Sketch-driven orthogonal graph drawing

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