Orthogonal drawings with few layers

DOI10.1007/3-540-45848-4_24MaRDI QIDQ3043732zbMATH OpenFDO

Authors John R. Johansen, Thomas C. Shermer, David R. Wood, Therese Biedl

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

• Three-dimensional orthogonal graph drawing algorithms
• Lower bounds for planar orthogonal drawings of graphs
• Three-dimensional orthogonal graph drawing with optimal volume
• Three-dimensional orthogonal graph drawing with optimal volume
• Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout

Cited in

(5)

• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Orthogonal drawings of graphs for the automation of VLSI circuit design
• A note on 3D orthogonal graph drawing
• Bounded degree book embeddings and three-dimensional orthogonal graph drawing
• Graph Drawing

This page was built for publication: Orthogonal drawings with few layers

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