Right Angle Crossing Drawings of Graphs
From MaRDI portal
Publication:5001661
DOI10.1007/978-981-15-6533-5_9OpenAlexW3091202750MaRDI QIDQ5001661
Publication date: 22 July 2021
Published in: Beyond Planar Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_9
Related Items (5)
RAC-drawability is \(\exists \mathbb{R} \)-complete ⋮ On morphing 1-planar drawings ⋮ The family of fan-planar graphs ⋮ RAC-Drawability is ∃ℝ-complete and Related Results ⋮ Graphs with large total angular resolution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Graphs that admit right angle crossing drawings
- 2-layer right angle crossing drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- A characterization of complete bipartite RAC graphs
- How to draw a planar graph on a grid
- Improving the crossing lemma by finding more crossings in sparse graphs
- On simultaneous planar graph embeddings
- Algorithms for plane representations of acyclic digraphs
- Area requirement and symmetry display of planar upward drawings
- Graphs drawn with few crossings per edge
- Edge crossings in drawings of bipartite graphs
- Three-dimensional orthogonal graph drawing algorithms
- Density of straight-line 1-planar graph drawings
- Right angle crossing graphs and 1-planarity
- Efficient orthogonal drawings of high degree graphs
- On RAC drawings of 1-planar graphs
- \(\mathsf{NIC}\)-planar graphs
- On the Computational Complexity of Upward and Rectilinear Planarity Testing
- Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
- Upward Planarity Testing in Practice
- The Crossing-Angle Resolution in Graph Drawing
- On the Number of Edges of Fan-Crossing Free Graphs
- Heuristics for the Maximum 2-layer RAC Subgraph Problem
- Planar and Quasi Planar Simultaneous Geometric Embedding
- Upward Spirality and Upward Planarity Testing
- The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
- The Straight-Line RAC Drawing Problem is NP-Hard
- Drawing Graphs with Right Angle Crossings
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- On the NP-hardness of GRacSim drawing and k-SEFE Problems
- Representations of Planar Graphs
- Geometric RAC Simultaneous Drawings of Graphs
- Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area
- On the Density of Maximal 1-Planar Graphs
- EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING
- Simultaneous Embedding of Planar Graphs with Few Bends
- Notes on large angle crossing graphs
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- On the Perspectives Opened by Right Angle Crossing Drawings
- Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
- On RAC drawings of graphs with one bend per edge
- Compact drawings of 1-planar graphs with right-angle crossings and few bends
- Embedding planar graphs at fixed vertex locations
This page was built for publication: Right Angle Crossing Drawings of Graphs
