Compact data structures for triangulations
Abstract
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.
Fichier principal
encyclopedia-tds.pdf (342.51 Ko)
Télécharger le fichier
vignette.png (41.1 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)
Loading...