English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  On fast construction of spatial hierarchies for ray tracing

Havran, V., Herzog, R., & Seidel, H.-P.(2006). On fast construction of spatial hierarchies for ray tracing (MPI-I-2006-4-004). Saarbrücken: Max-Planck-Institut für Informatik.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0014-6807-8 Version Permalink: http://hdl.handle.net/11858/00-001M-0000-0014-7977-5
Genre: Report

Files

show Files
hide Files
:
MPI-I-2006-4-004.ps (Any fulltext), 10MB
Name:
MPI-I-2006-4-004.ps
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/postscript / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Havran, Vlastimil1, Author              
Herzog, Robert1, Author              
Seidel, Hans-Peter1, Author              
Affiliations:
1Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              

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 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.

Details

show
hide
Language(s): eng - English
 Dates: 2006
 Publication Status: Published in print
 Pages: 40 p.
 Publishing info: Saarbrücken : Max-Planck-Institut für Informatik
 Table of Contents: -
 Rev. Method: -
 Identifiers: URI: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2006-4-004
Report Nr.: MPI-I-2006-4-004
BibTex Citekey: HavranHerzogSeidel2006
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Research Report / Max-Planck-Institut für Informatik
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -