Cost-Optimal Trees for Ray Shooting

14 years 19 days ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applications, e.g., radio propagation simulation. Aronov and Fortune were the first to guarantee an overall performance within a constant factor of optimal in the following model of computation: build a triangulation compatible with the scene, and shoot rays by locating origin and traversing until hit is found. Triangulations are not a very popular model in computer graphics, but space decompositions like kd-trees and octrees are used routinely. Aronov et al. [1] developed a cost measure for such decompositions, and proved it to reliably predict the average cost of ray shooting. In this paper, we address the corresponding optimization problem, and more generally d-dimensional trees with the cost measure as the optimizing criterion. We give a construction of quadtrees and octrees which yields cost O(M), where M is th...
Hervé Brönnimann, Marc Glisse
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Authors Hervé Brönnimann, Marc Glisse
Comments (0)