MPI-INF Logo
MPI-INF/SWS Research Reports 1991-2021

2. Number - only D4

MPI-I-2006-4-004

On fast construction of spatial hierarchies for ray tracing

Havran, Vlastimil and Herzog, Robert and Seidel, Hans-Peter

June 2006, 40 pages.

.
Status: available - back from printing

In this paper we address the problem of fast construction of spatial hierarchies for ray tracing with applications in animated environments including non-rigid animations. We discuss properties of currently used techniques with $O(N \log N)$ construction time for kd-trees and bounding volume hierarchies. Further, we propose a hybrid data structure blending between a spatial kd-tree and bounding volume primitives. We keep our novel hierarchical data structures algorithmically efficient and comparable with kd-trees by the use of a cost model based on surface area heuristics. Although the time complexity $O(N \log N)$ is a lower bound required for construction of any spatial hierarchy that corresponds to sorting based on comparisons, using approximate method based on discretization we propose a new hierarchical data structures with expected $O(N \log\log N)$ time complexity. We also discuss constants behind the construction algorithms of spatial hierarchies that are important in practice. We document the performance of our algorithms by results obtained from the implementation tested on nine different scenes.

  • MPI-I-2006-4-004.ps
  • Attachement: MPI-I-2006-4-004.ps (9337 KBytes)

URL to this document: https://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2006-4-004

Hide details for BibTeXBibTeX
@TECHREPORT{HavranHerzogSeidel2006,
  AUTHOR = {Havran, Vlastimil and Herzog, Robert and Seidel, Hans-Peter},
  TITLE = {On fast construction of spatial hierarchies for ray tracing},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-2006-4-004},
  MONTH = {June},
  YEAR = {2006},
  ISSN = {0946-011X},
}