On the size of graphs that admit polyline drawings with few bends and crossing angles

DOI10.1007/978-3-642-18469-7_1zbMATH Open1314.68207OpenAlexW1582259405MaRDI QIDQ3073653FDOQ3073653

Authors: 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

Recommendations

• Graphs that admit polyline drawings with few crossing angles
• Graphs that admit right angle crossing drawings
• Graphs that admit right angle crossing drawings
• Trade-Offs in Planar Polyline Drawings
• Crossing angles of geometric graphs

Mathematics Subject Classification ID

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

Cited In (13)

• Drawing graphs with vertices at specified positions and crossings at large angles
• Graphs that admit right angle crossing drawings
• Polyline Drawings with Topological Constraints
• 2-layer right angle crossing drawings
• Graphs that admit polyline drawings with few crossing angles
• Drawing graphs with right angle crossings
• Graphs that admit right angle crossing drawings
• Vertex angle and crossing angle resolution of leveled tree drawings
• Right angle crossing graphs and 1-planarity
• On the realisability of double-cross matrices by polylines in the plane
• Right angle crossing graphs and 1-planarity
• Polyline drawings with topological constraints
• Nonplanar Graph Drawings with k Vertices per Face

This page was built for publication: On the size of graphs that admit polyline drawings with few bends and crossing angles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073653)