Three-dimensional orthogonal graph drawing with optimal volume

DOI10.1007/3-540-44541-2_27MaRDI QIDQ4472318zbMATH OpenFDO

Authors Torsten Thiele, David R. Wood, Therese Biedl

Publication date 4 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/1984/19840284.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 with optimal volume
• Bounds For Orthogonal 3-D Graph Drawing
• Three-dimensional orthogonal graph drawing algorithms
• Graph Drawing
• Three-dimensional graph drawing

Cited in

(14)

• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Linkless symmetric drawings of series parallel digraphs
• Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
• A note on 3D orthogonal graph drawing
• Three-dimensional orthogonal graph drawing with optimal volume
• 3D graph drawing
• Orthogonal drawings with few layers
• Nearly optimal three dimensional layout of hypercube networks
• Multi-dimensional orthogonal graph drawing with small boxes (extended abstract)
• Bounds For Orthogonal 3-D Graph Drawing
• Drawing with colors
• SOFSEM 2005: Theory and Practice of Computer Science
• Graph Drawing
• Three-dimensional graph drawing

This page was built for publication: Three-dimensional orthogonal graph drawing with optimal volume

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