Skip to Main content Skip to Navigation
Conference papers

Efficient Ray Traversal of Constrained Delaunay Tetrahedralization

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Maxime MARIA Connect in order to contact the contributor
Submitted on : Friday, March 10, 2017 - 9:50:32 AM
Last modification on : Friday, January 7, 2022 - 3:45:20 AM
Long-term archiving on: : Sunday, June 11, 2017 - 1:40:23 PM


Files produced by the author(s)


  • HAL Id : hal-01486575, version 1



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⟩



Record views


Files downloads