Cost-Optimal Trees for Ray Shooting

  • Hervé Brönnimann
  • Marc Glisse
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2976)


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 of [1] as the optimizing criterion. We give a construction of quadtrees and octrees which yields cost O(M), where M is the infimum of the cost measure on all trees, for points or for (d-1)-simplices. Sometimes, a balance condition is important. (Informally, balanced trees ensures that adjacent leaves have similar size.) We also show that rebalancing does not affect the cost by more than a constant multiplicative factor, for both points and (d-1)-simplices. To our knowledge, these are the only results that provide performance guarantees within approximation factor of optimality for 3-dimensional ray shooting with the octree model of computation.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aronov, B., Brönnimann, H., Chang, A.Y., Chiang, Y.-J.: Cost prediction for ray shooting. In: Proc. of Eighteenth ACM Symp. on Geom. Comput., Barcelona, Spain, pp. 293–302 (2002)Google Scholar
  2. 2.
    Aronov, B., Brönnimann, H., Chang, A.Y., Chiang, Y.-J.: Cost-driven octree construction schemes: an experimental study. In: Proc. of Nineteenth ACM Symp. on Geom. Comput., San Diego, CA (2003)Google Scholar
  3. 3.
    Aronov, B., Fortune, S.: Approximating minimum weight triangulations in three dimensions. Discrete Comput. Geom. 21(4), 527–549 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Ball, K.: Cube slicing in ℝn. Proc. Amer. Math. Soc. 97(3), 465–473 (1986)zbMATHMathSciNetGoogle Scholar
  5. 5.
    Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. In: Computing in Euclidean Geometry. Lecture Notes Series on Computing, vol. 4, pp. 47–123. World Scientific, Singapore (1992)Google Scholar
  6. 6.
    Brönnimann, H., Glisse, M., Wood, D.: Cost-optimal quadtrees for ray shooting. In: Proc. Canad. Conf. on Comput. Geom. (CCCG 2002), Lethbridge, Alberta (2002)Google Scholar
  7. 7.
    MacDonald, J.D., Booth, K.S.: Heuristics for ray tracing using space subdivision. The Visual Computer 6, 153–166 (1990)CrossRefGoogle Scholar
  8. 8.
    Moore, D.W.: Simplicial Mesh Generation with Applications. Ph.D dissertation, Cornell University (1992)Google Scholar
  9. 9.
    Reinhard, E., Kok, A.J.F., Jansen, F.W.: Cost prediction in ray tracing. In: Hanrahan, P., Purgathofer, W., et al. (eds.) Rendering Techniques 1997, Porto, Portugal, pp. 42–51 (1996)Google Scholar
  10. 10.
    Samet, H.: Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading (1990)Google Scholar
  11. 11.
    Subramanian, K.R., Fussell, D.S.: Automatic termination criteria for ray tracing hierarchies. In: Proc. of Graphics Interface 1991, June 3-7 (1991)Google Scholar
  12. 12.
    Whang, K.Y., Song, J.W., Chang, J.W., Kim, J.Y., Choand, W.S., Park, C.M., Song, I.Y.: Octree-R: An adaptive octree for efficient ray tracing. IEEE Trans. Visual and Comp. Graphics 1, 343–349 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hervé Brönnimann
    • 1
  • Marc Glisse
    • 2
  1. 1.Computer and Information SciencePolytechnic University, Six Metrotech CenterBrooklynUSA
  2. 2.Ecole Normale Supérieure ParisParis, Cedex 5France

Personalised recommendations