Graph Drawings with One Bend and Few Slopes

DOI10.1007/978-3-662-49529-2_41zbMath1475.68246arXiv1506.04423OpenAlexW2962815382MaRDI QIDQ2802968

Kolja Knauer, Bartosz Walczak, Piotr Micek

Publication date: 3 May 2016

Published in: Lecture Notes in Computer Science, LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.04423

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 (9)

Universal slope sets for 1-bend planar drawings ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ 1-Bend Upward Planar Drawings of SP-Digraphs ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ Drawing partial 2-trees with few slopes ⋮ Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Universal slope sets for upward planar drawings ⋮ Universal slope sets for upward planar drawings

This page was built for publication: Graph Drawings with One Bend and Few Slopes