Title: Accelerating ray tracing using constrained tetrahedralizations
Authors: Lagae, Ares
Dutré, Philip
Issue Date: Apr-2008
Publisher: Department of Computer Science, K.U.Leuven
Series Title: CW Reports vol:CW513
Abstract: In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization that respects the faces of the scene geometry. The closest intersection of a ray with a scene is found by traversing this tetrahedralization along the ray, one tetrahedron at a time. We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures: constrained tetrahedralizations are not hierarchical yet adaptive; the complexity of traversing them is a function of local geometric complexity rather than global geometric complexity; constrained tetrahedralizations support deforming geometry without any effort; and they have the potential to unify several data structures currently used in global illumination.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Informatics Section

Files in This Item:
File Description Status SizeFormat
CW513.pdfDocument Published 3199KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.