Schnyder woods for higher genus triangulated surfaces, with applications to encoding - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete and Computational Geometry Year : 2009

Schnyder woods for higher genus triangulated surfaces, with applications to encoding

Abstract

Schnyder woods are a well-known combinatorial structure for plane triangulations, which yields a decomposition into 3 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(g log(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), hence are linear when the genus is fixed.
Fichier principal
Vignette du fichier
SchnyderWoods_DCG09_Hal.pdf (442.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00712046 , version 1 (26-06-2012)

Identifiers

Cite

Luca Castelli Aleardi, Eric Fusy, Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces, with applications to encoding. Discrete and Computational Geometry, 2009, 42 (3), pp.489-516. ⟨10.1007/s00454-009-9169-z⟩. ⟨hal-00712046⟩
184 View
145 Download

Altmetric

Share

Gmail Facebook X LinkedIn More