Schnyder woods for higher genus triangulated surfaces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Schnyder woods for higher genus triangulated surfaces

Abstract

Schnyder woods are a well known combinatorial structure for planar graphs, which yields a decomposition into 3 vertex-spanning trees. Our goal is to extend definitions and algorithms for Schnyder woods designed for planar graphs (corresponding to combinatorial surfaces with the topology of the sphere, i.e., of genus 0) to the more general case of graphs embedded on surfaces of arbitrary genus. First, we define a new traversal order of the vertices of a triangulated surface of genus g together with an orientation and coloration of the edges that extends the one proposed by Schnyder for the planar case. As a by-product we show how some recent schemes for compression and compact encoding of graphs can be extended to higher genus. All the algorithms presented here have linear time complexity.
Fichier principal
Vignette du fichier
SchnyderWoodsHigherGenus_SoCG_Hal.pdf (329.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Luca Castelli Aleardi, Eric Fusy, Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces. 24th ACM annual symposium on Computational geometry, Jun 2008, University of Maryland, College Park, United States. pp.311-319, ⟨10.1145/1377676.1377730⟩. ⟨hal-00712062⟩
256 View
104 Download

Altmetric

Share

Gmail Facebook X LinkedIn More