Explicit array-based compact data structures for triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Explicit array-based compact data structures for triangulations


We consider the problem of designing space efficient solutions for representing triangle meshes. Our main result is a new explicit data structure for compactly representing planar triangulations: if one is allowed to permute input vertices, then a triangulation with n vertices requires at most 4n references (5n references if vertex permutations are not allowed). Our solution combines existing techniques from mesh encoding with a novel use of minimal Schnyder woods. Our approach extends to higher genus triangulations and could be applied to other families of meshes (such as quadrangular or polygonal meshes). As far as we know, our solution provides the most parsimonious data structures for triangulations, allowing constant time navigation in the worst case. Our data structures require linear construction time, and all space bounds hold in the worst case. We have implemented and tested our results, and experiments confirm the practical interest of compact data structures.
Fichier principal
Vignette du fichier
CompactTriangleMeshes.pdf (210.8 Ko) Télécharger le fichier
Vignette du fichier
vignette-hal-00678615.jpg (27.22 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

hal-00678615 , version 1 (13-03-2012)


  • HAL Id : hal-00678615 , version 1


Luca Castelli Aleardi, Olivier Devillers. Explicit array-based compact data structures for triangulations. 22nd International Symposium on Algorithms and Computation, 2011, Yokohama, Japan. pp.312--322. ⟨hal-00678615⟩
413 View
509 Download


Gmail Facebook X LinkedIn More