A Schnyder-type drawing algorithm for 5-connected triangulations
Preprint
Abstract
We define some Schnyder-type combinatorial structures on a class of planar triangulations of the pentagon which are closely related to 5-connected triangulations. The combinatorial structures have three incarnations defined in terms of orientations, corner-labelings, and woods respectively. The wood incarnation consists in 5 spanning trees crossing each other in an orderly fashion. Similarly as for Schnyder woods on triangulations, it induces, for each vertex, a partition of the inner triangles into face-connected regions (5~regions here). We show that the induced barycentric vertex-placement, where each vertex is at the barycenter of the 5 outer vertices with weights given by the number of faces in each region, yields a planar straight-line drawing.Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Grand-Schnyder WoodsAnnals of Combinatorics, 2024
- Schnyder Decompositions for Regular Plane Graphs and Application to DrawingAlgorithmica, 2011
- Schnyder Woods and Orthogonal SurfacesDiscrete & Computational Geometry, 2007
- Convex Drawings of 3-Connected Plane GraphsAlgorithmica, 2007
- Counting 5‐connected planar triangulationsJournal of Graph Theory, 2001
- Grid Drawings of 4-Connected Plane GraphsDiscrete & Computational Geometry, 2001
- Output-Sensitive Reporting of Disjoint PathsAlgorithmica, 1999
- Grid Drawings of Four-Connected Plane GraphsLecture Notes in Computer Science, 1999
- Grid Embedding of 4-Connected Plane GraphsDiscrete & Computational Geometry, 1997
- Planar graphs and poset dimensionOrder, 1989