Computing straight-line 3D grid drawings of graphs in linear volume
From MaRDI portal
Publication:2387202
DOI10.1016/j.comgeo.2004.11.003zbMath1101.68066OpenAlexW2054932997WikidataQ62042601 ScholiaQ62042601MaRDI QIDQ2387202
Emilio Di Giacomo, Giuseppe Liotta, Henk G. Meijer
Publication date: 2 September 2005
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.11.003
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (14)
Parameterized Algorithms for Queue Layouts ⋮ Computing straight-line 3D grid drawings of graphs in linear volume ⋮ Area requirement of graph drawings with few crossings per edge ⋮ Improved Bounds for Track Numbers of Planar Graphs ⋮ Equilateral Spherical Drawings of Planar Cayley Graphs ⋮ On the queue-number of graphs with bounded tree-width ⋮ Upward three-dimensional grid drawings of graphs ⋮ Upper bounds on the queue number of \(k\)-ary \(n\)-cubes ⋮ Queue layouts of planar 3-trees ⋮ Volume requirements of 3D upward drawings ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ On tree-partition-width ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ Parameterized Algorithms for Queue Layouts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 3D straight-line grid drawing of 4-colorable graphs
- Three-dimensional graph drawing
- Graph drawing software
- On tree-partitions of graphs
- Computing straight-line 3D grid drawings of graphs in linear volume
- Laying Out Graphs Using Queues
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Computational Geometry in C
- The vertex-face total chromatic number of Halin graphs
- Minimum cycle bases of Halin graphs
- Constrained Steiner trees in Halin graphs
- Drawing with colors
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
- Graph Drawing
- Graph Drawing
- Graph Drawing
- Layout of Graphs with Bounded Tree-Width
- Graph Drawing
- Graph-Theoretic Concepts in Computer Science
- Drawing graphs. Methods and models
This page was built for publication: Computing straight-line 3D grid drawings of graphs in linear volume