Three-dimensional graph drawing
From MaRDI portal
Publication:675316
DOI10.1007/BF02522826zbMATH Open0865.68120OpenAlexW2028268419MaRDI QIDQ675316FDOQ675316
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Cites Work
- Graph theory with applications
- Area requirement and symmetry display of planar upward drawings
- A note on optimal area algorithms for upward drawings of binary trees
- PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
- TWO TREE DRAWING CONVENTIONS
- Pretty-printing of trees
- A structured computer system model
- Convex Representations of Graphs
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
Cited In (33)
- Layered separators in minor-closed graph classes with applications
- Graph Drawing
- Crossings in grid drawings
- Graph Drawing
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
- Drawing with colors
- A compact layout for the three-dimensional tree of meshes
- Computing proximity drawings of trees in the 3-dimensional space
- Linkless symmetric drawings of series parallel digraphs
- Graph Drawing
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- Computing straight-line 3D grid drawings of graphs in linear volume
- A fast successive over-relaxation algorithm for force-directed network graph drawing
- Optimal three-dimensional layout of interconnection networks
- Fully dynamic \(3\)-dimensional orthogonal graph drawing
- No l Grid-Points in Spaces of Small Dimension
- Embedding problems for paths with direction constrained edges.
- Volume requirements of 3D upward drawings
- Three-dimensional orthogonal graph drawing with optimal volume
- A Bernstein inequality for exponentially growing graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Upward three-dimensional grid drawings of graphs
- A multi-dimensional approach to force-directed layouts of large graphs
- Drawing outerplanar graphs using three edge lengths
- Morphing planar graph drawings through 3D
- Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions
- Title not available (Why is that?)
- The complexity of bendless three-dimensional orthogonal graph drawing
- Three-Dimensional 1-Bend Graph Drawings
- An experimental comparison of four graph drawing algorithms.
- Graph Drawing
- On the queue-number of graphs with bounded tree-width
- On three-dimensional graph drawing and embedding
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)
