Graphs that admit right angle crossing drawings
DOI10.1016/J.COMGEO.2011.11.008zbMATH Open1259.65035OpenAlexW2761681115WikidataQ59702325 ScholiaQ59702325MaRDI QIDQ419368FDOQ419368
Authors: Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Morić, Csaba D. Tóth 
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Improving the crossing lemma by finding more crossings in sparse graphs
- Crossing-Free Subgraphs
- On the maximum number of edges in quasi-planar graphs
- Drawing Graphs with Right Angle Crossings
- On the perspectives opened by right angle crossing drawings
- On the size of graphs that admit polyline drawings with few bends and crossing angles
- Area, curve complexity, and crossing resolution of non-planar graph drawings
Cited In (33)
- Drawing Graphs with Right Angle Crossings
- Right Angle Crossing Drawings of Graphs
- A greedy heuristic for crossing-angle maximization
- Notes on large angle crossing graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On RAC drawings of graphs with two bends per edge
- Large angle crossing drawings of planar graphs in subquadratic area
- Plane multigraphs with one-bend and circular-arc edges of a fixed angle
- The stub resolution of 1-planar graphs
- A heuristic approach towards drawings of graphs with high crossing resolution
- 2-layer right angle crossing drawings
- Graphs that admit polyline drawings with few crossing angles
- Drawing graphs with right angle crossings
- 2-layer right angle crossing drawings
- On RAC drawings of graphs with two bends per edge
- RAC-Drawability is ∃ℝ-complete and Related Results
- On the size of graphs that admit polyline drawings with few bends and crossing angles
- Graphs that admit right angle crossing drawings
- A characterization of complete bipartite RAC graphs
- RAC-drawability is \(\exists \mathbb{R} \)-complete
- On topological graphs with at most four crossings per edge
- On RAC drawings of graphs with one bend per edge
- Every outer-1-plane graph has a right angle crossing drawing
- Fixed-parameter algorithms for computing bend-restricted RAC drawings of graphs
- Right angle crossing graphs and 1-planarity
- On the perspectives opened by right angle crossing drawings
- Right angle crossing graphs and 1-planarity
- On RAC drawings of graphs with one bend per edge
- RAC drawings in subcubic area
- The quality ratio of RAC drawings and planar drawings of planar graphs
- On the perspectives opened by right angle crossing drawings
- The straight-line RAC drawing problem is NP-hard
This page was built for publication: Graphs that admit right angle crossing drawings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419368)
