Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
From MaRDI portal
Publication:2206836
DOI10.1007/978-3-030-35802-0_9OpenAlexW2991511036MaRDI QIDQ2206836
Publication date: 26 October 2020
Full work available at URL: https://arxiv.org/abs/1908.06688
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Encoding toroidal triangulations
- How to draw a planar graph on a grid
- Schnyder woods for higher genus triangulated surfaces, with applications to encoding
- Greedy drawings of triangulations
- Optimal coding and sampling of triangulations
- Convex drawings of 3-connected plane graphs
- Intervals in Catalan lattices and realizers of triangulations
- On the number of planar orientations with prescribed degrees
- Finding small simple cycle separators for 2-connected planar graphs
- Lattice structures from planar graphs
- Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Plane Spanners of Maximum Degree Six
- A Separator Theorem for Planar Graphs
- Applications of a Planar Separator Theorem
- Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees
- Planar Preprocessing for Spring Embedders
- Short and Simple Cycle Separators in Planar Graphs
- Egalitarian Graph Orientations
- Engineering planar separator algorithms
