Refinement of three-dimensional orthogonal graph drawings

DOI10.1007/3-540-44541-2_29MaRDI QIDQ4472320zbMATH OpenFDO

Authors Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood

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

• Techniques for the Refinement of Orthogonal Graph Drawings
• Fully dynamic \(3\)-dimensional orthogonal graph drawing
• Three-dimensional orthogonal graph drawing algorithms
• Bounds For Orthogonal 3-D Graph Drawing
• Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout

Cited in

(7)

• Optimal three-dimensional orthogonal graph drawing in the general position model.
• Upward three-dimensional grid drawings of graphs
• 3D graph drawing
• Three-Dimensional 1-Bend Graph Drawings
• Techniques for the Refinement of Orthogonal Graph Drawings
• Squigraphs for Fine and Compact Modeling of 3-D Shapes
• Complexity results for three-dimensional orthogonal graph drawing

This page was built for publication: Refinement of three-dimensional orthogonal graph drawings

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