Skip to Main content Skip to Navigation
Book sections

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
LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry, Inria Nancy - Grand Est
3 Georgia Institute of Technology [Atlanta]
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.
Keywords : compact data structures triangle meshes Triangulations succinct representations
Document type :
Book sections
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

vignette.png
vignette.png
https://hal.inria.fr/hal-01168565
Contributor : Olivier Devillers <>
Submitted on : Friday, June 26, 2015 - 10:42:51 AM
Last modification on : Thursday, March 5, 2020 - 6:49:53 PM
Long-term archiving on: : Friday, October 9, 2015 - 6:16:05 PM

Files

Vignette du document
encyclopedia-tds.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | X | LIX | X-LIX | INRIA | UNIV-LORRAINE | LORIA-ALGO | LORIA | X-DEP-INFO

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

688

Files downloads

682

 

Contact                    Legal Notice                    Personal Data