HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
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
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
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 Connect in order to contact the contributor
Submitted on : Friday, June 26, 2015 - 10:42:51 AM
Last modification on : Saturday, October 16, 2021 - 11:26:08 AM
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 | INRIA2 | LORIA-ALGO | LORIA | UNIV-PARIS-SACLAY | 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 Datacite

Share

Metrics

Record views

351

Files downloads

549

 

Contact                    Legal Notice                    Personal Data