Ray tracing a three-dimensional scene using a hierarchical data structure
Abstract
Ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. One example embodiment is a method for ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. In this example embodiment, the hierarchical data structure includes at least a parent node and a corresponding plurality of child nodes. The method includes a first act of determining that a first active ray in the packet hits the parent node and a second act of descending to each of the plurality of child nodes.
- Inventors:
- Issue Date:
- Research Org.:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1078291
- Patent Number(s):
- 8259105
- Application Number:
- 12/374,392
- Assignee:
- The University of Utah Research Foundation (Salt Lake City, UT)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06T - IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- DOE Contract Number:
- W-7405-ENG-48
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Wald, Ingo, Boulos, Solomon, and Shirley, Peter. Ray tracing a three-dimensional scene using a hierarchical data structure. United States: N. p., 2012.
Web.
Wald, Ingo, Boulos, Solomon, & Shirley, Peter. Ray tracing a three-dimensional scene using a hierarchical data structure. United States.
Wald, Ingo, Boulos, Solomon, and Shirley, Peter. Tue .
"Ray tracing a three-dimensional scene using a hierarchical data structure". United States. https://www.osti.gov/servlets/purl/1078291.
@article{osti_1078291,
title = {Ray tracing a three-dimensional scene using a hierarchical data structure},
author = {Wald, Ingo and Boulos, Solomon and Shirley, Peter},
abstractNote = {Ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. One example embodiment is a method for ray tracing a three-dimensional scene made up of geometric primitives that are spatially partitioned into a hierarchical data structure. In this example embodiment, the hierarchical data structure includes at least a parent node and a corresponding plurality of child nodes. The method includes a first act of determining that a first active ray in the packet hits the parent node and a second act of descending to each of the plurality of child nodes.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Sep 04 00:00:00 EDT 2012},
month = {Tue Sep 04 00:00:00 EDT 2012}
}
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.
Works referenced in this record:
Memory-Conserving Bounding Volume Hierarchies with Coherent Raytracing
journal, June 2006
- Mahovsky, J.; Wyvill, B.
- Computer Graphics Forum, Vol. 25, Issue 2
Ray tracing animated scenes using coherent grid traversal
journal, July 2006
- Wald, Ingo; Ize, Thiago; Kensler, Andrew
- ACM Transactions on Graphics, Vol. 25, Issue 3
Multi-level ray tracing algorithm
conference, January 2005
- Reshetov, Alexander; Soupikov, Alexei; Hurley, Jim
- ACM SIGGRAPH 2005 Papers on - SIGGRAPH '05
An Evaluation of Parallel Grid Construction for Ray Tracing Dynamic Scenes
conference, September 2006
- Ize, Thiago; Wald, Ingo; Robertson, Chelsea
- 2006 IEEE Symposium on Interactive Ray Tracing