Efficient Ray Traversal of Constrained Delaunay Tetrahedralization - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Efficient Ray Traversal of Constrained Delaunay Tetrahedralization

Maxime Maria
Sébastien Horna
Lilian Aveneau

Résumé

Acceleration structures are mandatory for ray-tracing applications, allowing to cast a large number of rays per second. In 2008, Lagae and Dutré have proposed to use Constrained Delaunay Tetrahedralization (CDT) as an acceleration structure for ray tracing. Our experiments show that their traversal algorithm is not suitable for GPU applications, mainly due to arithmetic errors. This article proposes a new CDT traversal algorithm. This new algorithm is more efficient than the previous ones: it uses less arithmetic operations; it does not add extra thread divergence since it uses a fixed number of operation; at last, it is robust with 32-bits floats, contrary to the previous traversal algorithms. Hence, it is the first method usable both on CPU and GPU.
Fichier principal
Vignette du fichier
GRAPP_2017_29.pdf (1.21 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01486575 , version 1 (10-03-2017)

Identifiants

  • HAL Id : hal-01486575 , version 1

Citer

Maxime Maria, Sébastien Horna, Lilian Aveneau. Efficient Ray Traversal of Constrained Delaunay Tetrahedralization. 12th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISIGRAPP 2017), Feb 2017, Porto, Portugal. pp.236-243. ⟨hal-01486575⟩
384 Consultations
318 Téléchargements

Partager

Gmail Facebook X LinkedIn More