On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles

DOI10.1007/978-3-642-18469-7_1zbMath1314.68207OpenAlexW1582259405MaRDI QIDQ3073653

Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth

Publication date: 11 February 2011

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18469-7_1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Right Angle Crossing Graphs and 1-Planarity ⋮ Graphs that admit right angle crossing drawings ⋮ Right angle crossing graphs and 1-planarity ⋮ Vertex angle and crossing angle resolution of leveled tree drawings ⋮ 2-layer right angle crossing drawings ⋮ Drawing graphs with right angle crossings ⋮ Graphs that Admit Right Angle Crossing Drawings

This page was built for publication: On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles