Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
From MaRDI portal
Recommendations
Cited in
(48)- Volume requirements of 3D upward drawings
- Small area drawings of outerplanar graphs
- Track layouts, layered path decompositions, and leveled planarity
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- Small universal point sets for \(k\)-outerplanar graphs
- Optimal-area visibility representations of outer-1-plane graphs
- Homotopy height, grid-major height and graph-drawing height
- Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs
- Computing straight-line 3D grid drawings of graphs in linear volume
- Area requirement of graph drawings with few crossings per edge
- A linear-time algorithm for finding Hamiltonian (s,t)-paths in even-sized rectangular grid graphs with a rectangular hole
- Upward three-dimensional grid drawings of graphs
- \(k\)-spine, 1-bend planarity
- Triangulating planar graphs while keeping the pathwidth small
- The point-set embeddability problem for plane graphs
- Topological graph layouts into a triangular prism
- Drawing Graphs on Few Lines and Few Planes
- Track layout is hard
- scientific article; zbMATH DE number 2084287 (Why is no real title available?)
- Minimum-layer drawings of trees (extended abstract)
- On collinear sets in straight-line drawings
- Crossings in grid drawings
- Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area
- Graph layouts via layered separators
- Grid drawings and the chromatic number
- Drawing Halin-graphs with small height
- Cubic Planar Graphs that cannot be Drawn on few Lines
- On Layered Fan-Planar Graph Drawings
- Improved bounds for track numbers of planar graphs
- Order-preserving drawings of trees with approximately optimal height (and small width)
- On the queue-number of graphs with bounded tree-width
- Planar graphs of bounded degree have bounded queue number
- A Lower Bound on the Area Requirements of Series-Parallel Graphs
- Longest (s, t)-paths in L-shaped grid graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Drawing Planar Graphs with Reduced Height
- Graph Drawing
- Queue layouts of planar 3-trees
- 2-colored point-set embeddings of partial 2-trees
- 2-colored point-set embeddings of partial 2-trees
- Hamiltonian paths in L-shaped grid graphs
- 2-Layer Graph Drawings with Bounded Pathwidth
- Weakly leveled planarity with bounded span
- Weakly leveled planarity with bounded span
- Acyclically 3-colorable planar graphs
- Internally-convex drawings of outerplanar graphs in small area
- Queue layouts of iterated line directed graphs
- Simultaneous graph embedding with bends and circular arcs
This page was built for publication: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679074)
