English

Encoding toroidal triangulations

Discrete Mathematics 2015-07-21 v1 Computational Geometry Combinatorics

Abstract

Poulalhon and Schaeffer introduced an elegant method to linearly encode a planar triangulation optimally. The method is based on performing a special depth-first search algorithm on a particular orientation of the triangulation: the minimal Schnyder wood. Recent progress toward generalizing Schnyder woods to higher genus enables us to generalize this method to the toroidal case. In the plane, the method leads to a bijection between planar triangulations and some particular trees. For the torus we obtain a similar bijection but with particular unicellular maps (maps with only one face).

Keywords

Cite

@article{arxiv.1507.05461,
  title  = {Encoding toroidal triangulations},
  author = {Vincent Despré and Daniel Gonçalves and Benjamin Lévêque},
  journal= {arXiv preprint arXiv:1507.05461},
  year   = {2015}
}

Comments

41 pages

R2 v1 2026-06-22T10:14:57.495Z