Three-dimensional graph drawing

DOI10.1007/BF02522826MaRDI QIDQ675316zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Three-dimensional orthogonal graph drawing algorithms
• Graph Drawing
• scientific article; zbMATH DE number 2145229
• scientific article; zbMATH DE number 2080107

Cites work

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

Cited in

(32)

• Graph Drawing
• Drawing with colors
• Crossings in grid drawings
• Upward three-dimensional grid drawings of graphs
• Graph Drawing
• A multi-dimensional approach to force-directed layouts of large graphs
• A Bernstein inequality for exponentially growing graphs
• On three-dimensional graph drawing and embedding
• An experimental comparison of four graph drawing algorithms.
• Fully dynamic \(3\)-dimensional orthogonal graph drawing
• Graph Drawing
• Layered separators in minor-closed graph classes with applications
• Graph Drawing
• Three-Dimensional 1-Bend Graph Drawings
• Optimal three-dimensional orthogonal graph drawing in the general position model.
• A compact layout for the three-dimensional tree of meshes
• On the queue-number of graphs with bounded tree-width
• Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
• Volume requirements of 3D upward drawings
• Drawing outerplanar graphs using three edge lengths
• SOFSEM 2005: Theory and Practice of Computer Science
• Optimal three-dimensional layout of interconnection networks
• Linkless symmetric drawings of series parallel digraphs
• Embedding problems for paths with direction constrained edges.
• No l Grid-Points in Spaces of Small Dimension
• Computing proximity drawings of trees in the 3-dimensional space
• Computing straight-line 3D grid drawings of graphs in linear volume
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• scientific article; zbMATH DE number 2080107 (Why is no real title available?)
• A fast successive over-relaxation algorithm for force-directed network graph drawing
• Three-dimensional orthogonal graph drawing with optimal volume
• The complexity of bendless three-dimensional orthogonal graph drawing

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

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