Three-dimensional graph drawing

DOI10.1007/BF02522826zbMath0865.68120OpenAlexW2028268419MaRDI QIDQ675316

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

Publication date: 30 June 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02522826

zbMATH Keywords

three-dimensional graph drawing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (15)

A Bernstein inequality for exponentially growing graphs ⋮ 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 ⋮ Layered separators in minor-closed graph classes with applications ⋮ Crossings in grid drawings ⋮ No l Grid-Points in Spaces of Small Dimension ⋮ A fast successive over-relaxation algorithm for force-directed network graph drawing ⋮ On the queue-number of graphs with bounded tree-width ⋮ An experimental comparison of four graph drawing algorithms. ⋮ Optimal three-dimensional layout of interconnection networks ⋮ Upward three-dimensional grid drawings of graphs ⋮ Volume requirements of 3D upward drawings ⋮ Embedding problems for paths with direction constrained edges.

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

This page was built for publication: Three-dimensional graph drawing