Automatic Creation of Object Hierarchies for Ray Tracing

Authors:
Jeffrey Goldsmith;John Salmon
Affiliations:
Jet Propulsion Laboratory;California Institute of Technolgy
Venue:
IEEE Computer Graphics and Applications
Year:
1987

Citing 0
Cited 75

A hypercube Ray-tracer

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
An updated cross-indexed guide to the ray-tracing literature

ACM SIGGRAPH Computer Graphics
A clustering algorithm for radiosity in complex environments

SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Feature-based control of visibility error: a multi-resolution clustering algorithm for global illumination

SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Approximating polyhedra with spheres for time-critical collision detection

ACM Transactions on Graphics (TOG)
Clustering for glossy global illumination

ACM Transactions on Graphics (TOG)
Computing bounding volume hierarchies using model simplification

I3D '99 Proceedings of the 1999 symposium on Interactive 3D graphics
Collision Detection and Response for Computer Animation

SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Cost prediction for ray shooting

Proceedings of the eighteenth annual symposium on Computational geometry
Occlusion Culling Algorithms: A Comprehensive Survey

Journal of Intelligent and Robotic Systems
Minimal hierarchical collision detection

VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
Efficient clustering and visibility calculation for global illumination

Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa
Collision Detection for Interactive Graphics Applications

IEEE Transactions on Visualization and Computer Graphics
A Unified Hierarchical Algorithm for Global Illumination with Scattering Volumes and Object Clusters

IEEE Transactions on Visualization and Computer Graphics
Octree-R: An Adaptive Octree for Efficient Ray Tracing

IEEE Transactions on Visualization and Computer Graphics
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs

IEEE Transactions on Visualization and Computer Graphics
Spacetime Ray Tracing for Animation

IEEE Computer Graphics and Applications
A Survey of Shadow Algorithms

IEEE Computer Graphics and Applications
Faster Ray Tracing Using Adaptive Grids

IEEE Computer Graphics and Applications
An efficient instantiation algorithm for simulating radiant energy transfer in plant models

ACM Transactions on Graphics (TOG)
Cost-driven octree construction schemes: an experimental study

Proceedings of the nineteenth annual symposium on Computational geometry
Efficiency issues for ray tracing

Journal of Graphics Tools
Automatic Creation of Object Hierarchies for Radiosity Clustering

PG '99 Proceedings of the 7th Pacific Conference on Computer Graphics and Applications
Applying space subdivision techniques to volume rendering

VIS '90 Proceedings of the 1st conference on Visualization '90
Superposing images with shadow casting

VIS '90 Proceedings of the 1st conference on Visualization '90
Cost-driven octree construction schemes: an experimental study

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Algorithms for two-box covering

Proceedings of the twenty-second annual symposium on Computational geometry
Cost prediction for ray shooting in octrees

Computational Geometry: Theory and Applications
Octrees with near optimal cost for ray-shooting

Computational Geometry: Theory and Applications
Data structures for graphics

SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
The RTRT core

SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Efficiency issues for ray tracing

SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Ray tracing deformable scenes using dynamic bounding volume hierarchies

ACM Transactions on Graphics (TOG)
High quality rendering using ray tracing and photon mapping

ACM SIGGRAPH 2007 courses
B-KD trees for hardware accelerated ray tracing of dynamic scenes

GH '06 Proceedings of the 21st ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Interactive Isosurface Ray Tracing of Time-Varying Tetrahedral Volumes

IEEE Transactions on Visualization and Computer Graphics
Technical strategies for massive model visualization

Proceedings of the 2008 ACM symposium on Solid and physical modeling
Advanced global illumination using photon mapping

ACM SIGGRAPH 2008 classes
Real-time KD-tree construction on graphics hardware

ACM SIGGRAPH Asia 2008 papers
Spatial splits in bounding volume hierarchies

Proceedings of the Conference on High Performance Graphics 2009
Object partitioning considered harmful: space subdivision for BVHs

Proceedings of the Conference on High Performance Graphics 2009
Accelerating shadow rays using volumetric occluders and modified kd-tree traversal

Proceedings of the Conference on High Performance Graphics 2009
Cost prediction for ray shooting in octrees

Computational Geometry: Theory and Applications
Octrees with near optimal cost for ray-shooting

Computational Geometry: Theory and Applications
Cost-driven octree construction schemes: an experimental study

Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Speculative parallelization of multipath radiosity algorithm

SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Efficient Strategies for Acceleration Structure Updates in Interactive Ray Tracing Applications on the Cell Processor

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
OptiX: a general purpose ray tracing engine

ACM SIGGRAPH 2010 papers
Two-level ray tracing with reordering for highly complex scenes

Proceedings of Graphics Interface 2010
Parallel SAH k-D tree construction

Proceedings of the Conference on High Performance Graphics
HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry

Proceedings of the Conference on High Performance Graphics
ROSy+: 3D Object Pose Normalization Based on PCA and Reflective Object Symmetry with Application in 3D Object Retrieval

International Journal of Computer Vision
RDH: ray distribution heuristics for construction of spatial data structures

Proceedings of the 25th Spring Conference on Computer Graphics
Ray casting using a roped BVH with CUDA

Proceedings of the 25th Spring Conference on Computer Graphics
Implicit and dynamic trees for high performance rendering

Proceedings of Graphics Interface 2011
Simpler and faster HLBVH with work queues

Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
SAH KD-tree construction on GPU

Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
Razor: An architecture for dynamic multiresolution ray tracing

ACM Transactions on Graphics (TOG)
Fast, effective BVH updates for animated scenes

I3D '12 Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games
Energy-based self-collision culling for arbitrary mesh deformations

ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Technical Section: Visibility driven BVH build up algorithm for ray tracing

Computers and Graphics
Shallow bounding volume hierarchies for fast SIMD ray tracing of incoherent rays

EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
ReduceM: interactive and memory efficient ray tracing of large models

EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering
SRDH: specializing BVH construction and traversal order using representative shadow ray sets

EGGH-HPG'12 Proceedings of the Fourth ACM SIGGRAPH / Eurographics conference on High-Performance Graphics
Ray tracing dynamic scenes using selective restructuring

EGSR'07 Proceedings of the 18th Eurographics conference on Rendering Techniques
Instant ray tracing: the bounding interval hierarchy

EGSR'06 Proceedings of the 17th Eurographics conference on Rendering Techniques
A distributed data model for raytracing

EGGH'88 Proceedings of the Third Eurographics conference on Advances in Computer Graphics Hardware
A massively parallel approach for the design of a raytracing oriented architecture

EGGH'88 Proceedings of the Third Eurographics conference on Advances in Computer Graphics Hardware
An efficient parallel ray tracing scheme for highly parallel architectures

EGGH'90 Proceedings of the Fifth Eurographics conference on Advances in Computer Graphics Hardware: rendering, ray tracing and visualization systems
PDQ: Parallel Distance Queries for deformable meshes

Graphical Models
clOpenCL: supporting distributed heterogeneous computing in HPC clusters

Euro-Par'12 Proceedings of the 18th international conference on Parallel processing workshops
gkDtree: A group-based parallel update kd-tree for interactive ray tracing

Journal of Systems Architecture: the EUROMICRO Journal
Efficient BVH construction via approximate agglomerative clustering

Proceedings of the 5th High-Performance Graphics Conference
Fast parallel construction of high-quality bounding volume hierarchies

Proceedings of the 5th High-Performance Graphics Conference
On quality metrics of bounding volume hierarchies

Proceedings of the 5th High-Performance Graphics Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Intersection calculations dominate the run time of canonical ray tracers. A common algorithm to reduce the number of intersection tests required is the intersection of rays with a tree of extents, rather than the whole database of objects. A shortcoming of this method is that these trees are difficult to generate. Additionally, manually generated trees can be poor, greatly reducing the run-time improvement available. We present methods for evaluation of these trees in approximate number of intersection calculations required and for automatic generation of good trees. These methods run in O(nlogn) expected time where n is the number of objects in the scene. We report some examples of speedups.