English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  On the Fast Construction of Spatial Hierarchies for Ray Tracing

Havran, V., Herzog, R., & Seidel, H.-P. (2006). On the Fast Construction of Spatial Hierarchies for Ray Tracing. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing (pp. 71-80). Piscataway, USA: IEEE.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2397-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2398-F
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Havran, Vlastimil1, Author           
Herzog, Robert1, 2, Author           
Seidel, Hans-Peter1, Author           
Wald, Ingo1, Editor           
Parker, Steven G., Editor
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              

Content

show
hide
Free keywords: -
 Abstract: 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 will propose a hybrid data structure blending a spatial kd-tree with bounding volume primitives. We will keep our novel hierarchical data structures algorithmically efficient and comparable with kd-trees by using 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, which corresponds to sorting based on comparisons, using an approximate method based on space discretization, we propose a new hierarchical data structures with expected $O(N \log\log N)$ time complexity. We also discuss the constants behind the construction algorithms of spatial hierarchies that are important in practice. We document the performance of our algorithms by results obtained from nine different scenes.

Details

show
hide
Language(s): eng - English
 Dates: 2007-03-032006
 Publication Status: Issued
 Pages: -
 Publishing info: Piscataway, USA : IEEE
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314634
Other: Local-ID: C125675300671F7B-94561A8D2A5BD650C125722F005A0243-HavranRT2006
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Salt Lake City, UT, USA
Start-/End Date: 2006-09-18

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Piscataway, USA : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 71 - 80 Identifier: ISBN: 1-4244-0693-5