The complexity of drawing graphs on few lines and few planes
From MaRDI portal
Publication:2405289
DOI10.1007/978-3-319-62127-2_23zbMath1457.68207arXiv1607.06444OpenAlexW2964278127MaRDI QIDQ2405289
Alexander Wolff, Fabian Lipp, Steven Chaplick, Krzysztof Fleszar, O. V. Ravskyj, Oleg Verbitsky
Publication date: 22 September 2017
Full work available at URL: https://arxiv.org/abs/1607.06444
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Drawing plane triangulations with few segments ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ The segment number: algorithms and universal lower bounds for some classes of planar graphs ⋮ The Complexity of Drawing Graphs on Few Lines and Few Planes ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ 4-connected triangulations on few lines ⋮ Line and plane cover numbers revisited ⋮ Drawing planar graphs with few segments on a polynomial grid ⋮ Variants of the segment number of a graph ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ Aligned Drawings of Planar Graphs ⋮ Drawing Graphs on Few Circles and Few Spheres
