The weighted barycenter drawing recognition problem
From MaRDI portal
Publication:1725791
DOI10.1007/978-3-030-04414-5_40OpenAlexW2890383781MaRDI QIDQ1725791
Patrick Healy, Peter Eades, Nikola S. Nikolov
Publication date: 15 February 2019
Full work available at URL: https://arxiv.org/abs/1809.00628
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Unnamed Item
- Deformations of plane graphs
- How to morph tilings injectively
- Parametrization and smooth approximation of surface triangulations
- Tutte's barycenter method applied to isotopies
- The weighted barycenter drawing recognition problem
- Morphing Schnyder drawings of planar triangulations
- Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
- Spectral Sparsification of Graphs
- Convex Representations of Graphs
- Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphs
- Graph Drawing
- How to Draw a Graph
- Simple Recognition of Halin Graphs and Their Generalizations
This page was built for publication: The weighted barycenter drawing recognition problem
