Drawing Planar Graphs of Bounded Degree with Few Slopes
From MaRDI portal
Publication:5891179
DOI10.1137/100815001zbMath1272.05133arXiv1009.1315OpenAlexW1984666555MaRDI QIDQ5891179
János Pach, Balázs Keszegh, Dömötör Pálvölgyi
Publication date: 26 September 2013
Published in: SIAM Journal on Discrete Mathematics, Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.1315
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Upward Planar Drawings with Three and More Slopes ⋮ Planar drawings with few slopes of Halin graphs and nested pseudotrees ⋮ Upward planar drawings with three and more slopes ⋮ The planar slope number of planar partial 3-trees of bounded degree ⋮ The Stub Resolution of 1-planar Graphs ⋮ Universal slope sets for 1-bend planar drawings ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ 1-Bend Upward Planar Drawings of SP-Digraphs ⋮ On the Complexity of the Planar Slope Number Problem ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ Drawing partial 2-trees with few slopes ⋮ Outerplanar graph drawings with few slopes ⋮ Drawing subcubic 1-planar graphs with few bends, few slopes, and large angles ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Universal slope sets for upward planar drawings ⋮ Universal slope sets for upward planar drawings ⋮ Level-planar drawings with few slopes ⋮ Level-planar drawings with few slopes ⋮ Angular Resolutions: Around Vertices and Crossings
