Computing labeled orthogonal drawings

DOI10.1007/3-540-36151-0_7MaRDI QIDQ4422263zbMATH OpenFDO

Authors Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato

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/25280066.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

• scientific article; zbMATH DE number 2084273
• Orthogonal drawings of graphs with vertex and edge labels
• Orthogonal graph drawing
• Sketch-driven orthogonal graph drawing
• Computing orthogonal drawings with the minimum number of bends
• Computing orthogonal drawings with the minimum number of bends
• Algorithms for area-efficient orthogonal drawing
• Orthogonal drawings based on the stratification of planar graphs
• Orthogonal drawings based on the stratification of planar graphs
• Algorithms and bounds for overloaded orthogonal drawings

Cited in

(6)

• Modifying orthogonal drawings for label placement
• Orthogonal drawings of graphs with vertex and edge labels
• scientific article; zbMATH DE number 2084273 (Why is no real title available?)
• Inapproximability of orthogonal compaction
• A combinatorial approach to orthognal placement problems
• On the complexity of orthogonal compaction

This page was built for publication: Computing labeled orthogonal drawings

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