State of the art in ray tracing animated scenes
Ray tracing has long been a method of choice for off‐line rendering, but traditionally was too
slow for interactive use. With faster hardware and algorithmic improvements this has recently …
slow for interactive use. With faster hardware and algorithmic improvements this has recently …
A survey on bounding volume hierarchies for ray tracing
Ray tracing is an inherent part of photorealistic image synthesis algorithms. The problem of
ray tracing is to find the nearest intersection with a given ray and scene. Although this …
ray tracing is to find the nearest intersection with a given ray and scene. Although this …
Fast BVH construction on GPUs
We present two novel parallel algorithms for rapidly constructing bounding volume
hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton …
hierarchies on manycore GPUs. The first uses a linear ordering derived from spatial Morton …
Understanding the efficiency of ray traversal on GPUs
We discuss the mapping of elementary ray tracing operations---acceleration structure
traversal and primitive intersection---onto wide SIMD/SIMT machines. Our focus is on …
traversal and primitive intersection---onto wide SIMD/SIMT machines. Our focus is on …
On building fast kd-trees for ray tracing, and on doing that in O (N log N)
Though a large variety of efficiency structures for ray tracing exist, kd-trees today seem to
slowly become the method of choice. In particular, kd-trees built with cost estimation …
slowly become the method of choice. In particular, kd-trees built with cost estimation …
Quasi-Monte Carlo light transport simulation by efficient ray tracing
C Waechter, A Keller - US Patent 7,952,583, 2011 - Google Patents
the present invention relates generally to methods and systems for image rendering in and
by digital computing systems, such as computer graphics methods and systems for motion …
by digital computing systems, such as computer graphics methods and systems for motion …
On fast construction of SAH-based bounding volume hierarchies
I Wald - 2007 IEEE Symposium on Interactive Ray Tracing, 2007 - ieeexplore.ieee.org
With ray traversal performance reaching the point where real-time ray tracing becomes
practical, ray tracing research is now shifting away from faster traversal, and towards the …
practical, ray tracing research is now shifting away from faster traversal, and towards the …
A novel random forests based class incremental learning method for activity recognition
Automatic activity recognition is an active research topic which aims to identify human
activities automatically. A significant challenge is to recognize new activities effectively. In …
activities automatically. A significant challenge is to recognize new activities effectively. In …
Highly parallel fast KD‐tree construction for interactive ray tracing of dynamic scenes
M Shevtsov, A Soupikov… - Computer Graphics Forum, 2007 - Wiley Online Library
We present a highly parallel, linearly scalable technique of kd‐tree construction for ray
tracing of dynamic geometry. We use conventional kd‐tree compatible with the high …
tracing of dynamic geometry. We use conventional kd‐tree compatible with the high …
[PDF][PDF] HLBVH: Hierarchical LBVH construction for real-time ray tracing of dynamic geometry
J Pantaleoni, D Luebke - Proceedings of the Conference on High …, 2010 - researchgate.net
We present HLBVH and SAH-optimized HLBVH, two high performance BVH construction
algorithms targeting real-time ray tracing of dynamic geometry. HLBVH provides a novel …
algorithms targeting real-time ray tracing of dynamic geometry. HLBVH provides a novel …