Compact representation of triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Compact representation of triangulations


We consider the problem of representing compact geometric data structures maintaining an efficient implementation of navigation operations. For the case of planar triangulations with $m$ faces, we propose a compact representation of the connectivity information that improves to $2.175$ bits per triangle the asymptotic amount of space required and that supports navigation between adjacent triangles in constant time. For triangulations with $m$ faces of a surface with genus $g$, our representation requires asymptotically an extra amount of $36(g-1)\lgm$ bits. The structure also allows constant time access to vertex specific data, like coordinates, but the paper does not address the compression of this geometric information.
Fichier principal
Vignette du fichier
RR-5433.pdf (370.83 Ko) Télécharger le fichier

Dates and versions

inria-00070574 , version 1 (19-05-2006)


  • HAL Id : inria-00070574 , version 1


Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Compact representation of triangulations. [Research Report] RR-5433, INRIA. 2006, pp.20. ⟨inria-00070574⟩
188 View
17150 Download


Gmail Facebook Twitter LinkedIn More