A Schnyder-Type Drawing Algorithm for 5-Connected Triangulations
- 1 January 2023
- book chapter
- Published by Springer Nature
- p. 117-132
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Unified bijections for maps with prescribed degrees and girthJournal of Combinatorial Theory, Series A, 2012
- Schnyder Decompositions for Regular Plane Graphs and Application to DrawingAlgorithmica, 2011
- Transversal structures on triangulations: A combinatorial study and straight-line drawingsDiscrete Mathematics, 2009
- Convex Drawings of 3-Connected Plane GraphsAlgorithmica, 2007
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck pathsDiscrete Mathematics, 2005
- Counting 5‐connected planar triangulationsJournal of Graph Theory, 2001
- Grid Drawings of 4-Connected Plane GraphsDiscrete & Computational Geometry, 2001
- A better heuristic for orthogonal graph drawingsComputational Geometry, 1998
- Convex Grid Drawings of 3-Connected Planar GraphsInternational Journal of Computational Geometry & Applications, 1997
- On Finding the Rectangular Duals of Planar Triangular GraphsSIAM Journal on Computing, 1993