Graphs that admit right angle crossing drawings

DOI10.1016/j.comgeo.2011.11.008zbMath1259.65035OpenAlexW2761681115WikidataQ59702325 ScholiaQ59702325MaRDI QIDQ419368

Csaba D. Tóth, Balázs Keszegh, Filip Morić, Radoslav Fulek, Karin Arikushi

Publication date: 18 May 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.11.008

zbMATH Keywords

graphcrossing lemmadischargingArchimedean tilingpolyline drawingright angle crossing drawing

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (14)

RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ On RAC drawings of 1-planar graphs ⋮ The Stub Resolution of 1-planar Graphs ⋮ On topological graphs with at most four crossings per edge ⋮ Unnamed Item ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ A heuristic approach towards drawings of graphs with high crossing resolution ⋮ A greedy heuristic for crossing-angle maximization ⋮ 2-layer right angle crossing drawings ⋮ Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area ⋮ On RAC drawings of graphs with one bend per edge ⋮ On RAC drawings of graphs with one bend per edge ⋮ RAC drawings in subcubic area ⋮ Right Angle Crossing Drawings of Graphs

Cites Work

• Improving the crossing lemma by finding more crossings in sparse graphs
• On the maximum number of edges in quasi-planar graphs
• On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
• Drawing Graphs with Right Angle Crossings
• Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings
• Crossing-Free Subgraphs
• On the Perspectives Opened by Right Angle Crossing Drawings

This page was built for publication: Graphs that admit right angle crossing drawings