Three-dimensional graph drawing

DOI10.1007/BF02522826zbMath0865.68120MaRDI QIDQ675316

Frank Ruskey, Peter Eades, Tao Lin, R. F. Cohen

Publication date: 30 June 1997

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

three-dimensional graph drawing

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68W10: Parallel algorithms in computer science

Related Items

Optimal three-dimensional layout of interconnection networks, Crossings in grid drawings, A fast successive over-relaxation algorithm for force-directed network graph drawing, Volume requirements of 3D upward drawings, Embedding problems for paths with direction constrained edges., Optimal three-dimensional orthogonal graph drawing in the general position model., A multi-dimensional approach to force-directed layouts of large graphs, Linkless symmetric drawings of series parallel digraphs, Computing straight-line 3D grid drawings of graphs in linear volume, An experimental comparison of four graph drawing algorithms., Upward three-dimensional grid drawings of graphs, No l Grid-Points in Spaces of Small Dimension

Cites Work

• Unnamed Item
• Area requirement and symmetry display of planar upward drawings
• A note on optimal area algorithms for upward drawings of binary trees
• A structured computer system model
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• TWO TREE DRAWING CONVENTIONS
• Convex Representations of Graphs
• Pretty-printing of trees
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA