Angular Resolutions: Around Vertices and Crossings
From MaRDI portal
Publication:5001662
DOI10.1007/978-981-15-6533-5_10OpenAlexW3090716305MaRDI QIDQ5001662
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_10
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
The Complexity of Angular Resolution ⋮ Planarizing graphs and their drawings by vertex splitting ⋮ Graphs with large total angular resolution
Cites Work
- Unnamed Item
- Vertex angle and crossing angle resolution of leveled tree drawings
- Area, curve complexity, and crossing resolution of non-planar graph drawings
- Drawing graphs with right angle crossings
- Bounds on the crossing resolution of complete geometric graphs
- A heuristic approach towards drawings of graphs with high crossing resolution
- Bounded-degree graphs have arbitrarily large geometric thickness
- Maximizing the Total Resolution of Graphs
- The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs
- Drawing Graphs in the Plane with High Resolution
- The Straight-Line RAC Drawing Problem is NP-Hard
- Drawing Cubic Graphs with the Four Basic Slopes
- List Colouring Squares of Planar Graphs
- On the Angular Resolution of Planar Graphs
- Geometric Thickness of Complete Graphs
- Coloring the square of a planar graph
- Notes on large angle crossing graphs
- Drawing Planar Graphs of Bounded Degree with Few Slopes
- On the Perspectives Opened by Right Angle Crossing Drawings
- Graphs with large total angular resolution
This page was built for publication: Angular Resolutions: Around Vertices and Crossings