Skip to Main content Skip to Navigation

Algorithmes parallèles pour le traitement rapide de géométries 3D

Abstract : Over the last twenty years, the main signal processing concepts have been adapted for digital geometry, in particular for 3D polygonal meshes. However, the processing time required for large models is significant. This computational load becomes an obstacle in the current context, where the massive amounts of data that are generated every second may need to be processed with several operators. The ability to run geometry processing operators with strong time constraints is a critical challenge in dynamic 3D systems. In this context, we seek to speed up some of the current algorithms by several orders of magnitude, and to reformulate or approximate them in order to reduce their complexity or make them parallel. In this thesis, we are building on a compact and effective object to analyze 3D surfaces at different scales : error quadrics. In particular, we propose new high performance algorithms that maintain error quadrics on the surface to represent the geometry. One of the main challenges lies in the effective generation of the right structures for parallel processing, in order to take advantage of the GPU.
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Friday, November 5, 2021 - 4:24:21 PM
Last modification on : Saturday, November 6, 2021 - 3:10:39 AM
Long-term archiving on: : Sunday, February 6, 2022 - 7:23:28 PM


Version validated by the jury (STAR)


  • HAL Id : tel-03417289, version 1


Hélène Legrand. Algorithmes parallèles pour le traitement rapide de géométries 3D. Géométrie algorithmique [cs.CG]. Télécom ParisTech, 2017. Français. ⟨NNT : 2017ENST0053⟩. ⟨tel-03417289⟩



Record views


Files downloads