Compact data structures for triangulations

Luca Castelli Aleardi (1) , Olivier Devillers (2) , Jarek Rossignac (3)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
3 Georgia Institute of Technology [Atlanta]

The main problem consists in designing space-efficient data structures allowing to represent the connectivity of triangle meshes while supporting fast navigation and local updates.

Mots clés: compact data structures; succinct representations; Triangulations; triangle meshes

Domaines: Géométrie algorithmique [cs.CG]

Luca Castelli Aleardi, Olivier Devillers, Jarek Rossignac. Compact data structures for triangulations. Encyclopedia of Algorithms, Springer, 2015, ⟨10.1007/978-3-642-27848-8_589-1⟩. ⟨hal-01168565⟩