Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding

Authors:
Luca Castelli Aleardi;Éric Fusy;Thomas Lewiner
Affiliations:
École Polytechnique, Paris, France;École Polytechnique, Paris, France and University of British Columbia, Vancouver, Canada;PUC-Rio, Department of Mathematics, Rio de Janeiro, Brazil
Venue:
Discrete & Computational Geometry - Special Issue: 24th Annual Symposium on Computational Geometry
Year:
2009

Citing 0
Cited 4

On succinct convex greedy drawing of 3-connected plane graphs

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Explicit array-based compact data structures for triangulations

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Canonical ordering for triangulations on the cylinder, with applications to periodic straight-line drawings

GD'12 Proceedings of the 20th international conference on Graph Drawing
A simple routing algorithm based on Schnyder coordinates

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into three spanning trees. We extend here definitions and algorithms for Schnyder woods to closed orientable surfaces of arbitrary genus. In particular, we describe a method to traverse a triangulation of genus g and compute a so-called g-Schnyder wood on the way. As an application, we give a procedure to encode a triangulation of genus g and n vertices in 4n+O(glog (n)) bits. This matches the worst-case encoding rate of Edgebreaker in positive genus. All the algorithms presented here have execution time O((n+g)g) and hence are linear when the genus is fixed.