Compact representation of triangulations

Luca Castelli Aleardi (1, 2) , Olivier Devillers (1) , Gilles Schaeffer (2)

1 GEOMETRICA - Geometric computing
2 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

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.

Mots clés: GRAPH ENCODING; SUCCINCT REPRESENTATIONS; TRIANGULATIONS; GEOMETRIC DATA STRUCTURES

Domaines: Autre [cs.OH]

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