Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

DOI10.7155/jgaa.00075zbMath1068.68103OpenAlexW2094502103WikidataQ62042618 ScholiaQ62042618MaRDI QIDQ4679074

Giuseppe Liotta, Stefan Felsner, Stephen K. Wismath

Publication date: 25 May 2005

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/51533

zbMATH Keywords

boxplanar graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (40)

Drawing Halin-graphs with small height ⋮ A Lower Bound on the Area Requirements of Series-Parallel Graphs ⋮ Optimal-area visibility representations of outer-1-plane 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 ⋮ Queue layouts of iterated line directed graphs ⋮ Crossings in grid drawings ⋮ Topological Graph Layouts into a Triangular Prism ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ Track Layout Is Hard ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ Improved Bounds for Track Numbers of Planar Graphs ⋮ Homotopy height, grid-major height and graph-drawing height ⋮ Straight-line drawings of outerplanar graphs in \(O(dn \log n)\) area ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ Graph layouts via layered separators ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ Small universal point sets for \(k\)-outerplanar graphs ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ On the queue-number of graphs with bounded tree-width ⋮ Acyclically 3-colorable planar graphs ⋮ Upward three-dimensional grid drawings of graphs ⋮ \(k\)-spine, 1-bend planarity ⋮ Queue layouts of planar 3-trees ⋮ Hamiltonian paths in \(L\)-shaped grid graphs ⋮ Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width) ⋮ Drawing Planar Graphs with Reduced Height ⋮ Minimum-Layer Drawings of Trees ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ Volume requirements of 3D upward drawings ⋮ Linear-time algorithms for finding Hamiltonian and longest \((s,t)\)-paths in \(C\)-shaped grid graphs ⋮ 2-colored point-set embeddings of partial 2-trees ⋮ On Layered Fan-Planar Graph Drawings ⋮ Small area drawings of outerplanar graphs ⋮ Triangulating Planar Graphs While Keeping the Pathwidth Small ⋮ Planar Graphs of Bounded Degree Have Bounded Queue Number ⋮ On Collinear Sets in Straight-Line Drawings ⋮ THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS

This page was built for publication: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions