Succinct representation of triangulations with a boundary - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Succinct representation of triangulations with a boundary

Abstract

We consider the problem of designing succinct geometric data structures while maintaining efficient navigation operations. A data structure is said succinct if the asymptotic amount of space it uses matches the entropy of the class of structures represented. For the case of planar triangulations with a boundary we propose a succinct representation of the combinatorial information that improves to 2.175 bits per triangle the asymptotic amount of space required and that supports the navigation between adjacent triangles in constant time (as well as other standard operations). For triangulations with $m$ faces of a surface with genus g, our representation requires asymptotically an extra amount of 36(g-1)lg m bits (which is negligible as long as g << m/lg m).
Fichier principal
Vignette du fichier
Wads05.pdf (190.62 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00090707 , version 1 (01-09-2006)

Identifiers

  • HAL Id : inria-00090707 , version 1

Cite

Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Succinct representation of triangulations with a boundary. 9th Workshop on Algorithms and Data Structures, Aug 2005, Waterloo, Canada, pp.134--135. ⟨inria-00090707⟩
181 View
208 Download

Share

Gmail Facebook Twitter LinkedIn More