Dynamic Acceleration Structures for Interactive Ray Tracing

Reinhard, Erik; Smits, Brian; Hansen, Chuck

doi:10.1007/978-3-7091-6303-0_27

Cited by 39 publications

(26 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic Scenes: There is relatively less work on ray tracing dynamic scenes. Reinhard et al [21] use a grid structure that can be updated efficiently for any type of animation. Lext et al [16] present a general purpose framework and benchmarks for ray tracing animated scenes.…”

Section: Previous Workmentioning

confidence: 99%

RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs

Lauterbach

Yoon

Tuft

et al. 2006

2006 IEEE Symposium on Interactive Ray Tracing

View full text Add to dashboard Cite

We present an efficient approach for interactive ray tracing of deformable or animated models. Unlike many of the recent approaches for ray tracing static scenes, we use bounding volume hierarchies (BVHs) instead of kd-trees as the underlying acceleration structure. Our algorithm makes no assumptions about the simulation or the motion of objects in the scene and dynamically updates or recomputes the BVHs. We also describe a method to detect BVH quality degradation during the simulation in order to determine when the hierarchy needs to be rebuilt. Furthermore, we show that the ray coherence techniques introduced for kd-trees can be naturally extended to BVHs and yield similar improvements. Finally, we compare BVHs to spatial kd-trees, which have been used recently as a replacement for AABB hierarchies. Our algorithm has been applied to different scenarios arising in animation and simulation and consisting of tens of thousands to a million triangles. In practice, our system can ray trace these models at 3-13 frames a second on a desktop PC including secondary rays.

show abstract

Section: Previous Workmentioning

confidence: 99%

RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs

Lauterbach

Yoon

Tuft

et al. 2006

2006 IEEE Symposium on Interactive Ray Tracing

View full text Add to dashboard Cite

show abstract

“…A grid, in contrast, can be created and modified at interactive rates [Reinhard et al 2000], at least for moderate sized scenes of up to a few hundred thousand triangles. Consequently, grids are attractive for dynamic scenes because of their faster build, even if they have a higher traversal cost than a kd-tree.…”

Section: Dynamic Scenesmentioning

confidence: 99%

“…Though schemes for incrementally [Reinhard et al 2000] or hierarchically [Lext and Akenine-Möller 2001] updating a grid exist, we did not want to impose any restrictions on the kind of animations we support, and thus opted for the most general method by rebuilding the grid from scratch for every frame. We use the common scheme of choosing the number of cells to be a multiple, λ, of the number of triangles, N [Cleary et al 1983].…”

Section: Acceleration Structure Rebuildmentioning

confidence: 99%

“…Each of these data structures has its own strengths and weaknesses, and the effectiveness of each technique strongly depends on the scene, application, and efficiency of the actual implementation. Recent work in interactive ray tracing, however, has focused primarily on kd-trees [Wald 2004;Foley and Sugerman 2005;Reshetov et al 2005;Woop et al 2005] and grids [Purcell et al 2002], or multilevel grids [Parker et al 1999b;Reinhard et al 2000].…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Ray tracing animated scenes using coherent grid traversal

et al. 2006

View full text Add to dashboard Cite

Figure 1: Several animated models ray traced using our coherent grid traversal: a) A gesturing hand of 16K triangles. b) An animated "Poser" model (78K triangles). c) Animated wind-up toys (11K triangles) walking and jumping incoherently around each other. d) A rigid-body dynamics simulation of marbles (8.8K triangles). e) A complex scene of 174K animated triangles, where a fairy and a dragonfly dance through an animated forest. Scenes are rebuilt from scratch every frame, allowing fully dynamic animation. Including shading, texturing, and hard shadows, as used in the above images, we can render these scenes at 1024 × 1024 pixels with 15.3, 7.8, 10.2, 26.2, and 1.4 frames per second on a dual 3.2 GHz Xeon. Excluding shading, texturing, and shadows, we achieve 34.5, 15.8, 29.3, 57.1, and 3.4 frames per second. AbstractWe present a new approach to interactive ray tracing of moderatesized animated scenes based on traversing frustum-bounded packets of coherent rays through uniform grids. By incrementally computing the overlap of the frustum with a slice of grid cells, we accelerate grid traversal by more than a factor of 10, and achieve ray tracing performance competitive with the fastest known packet-based kd-tree ray tracers. The ability to efficiently rebuild the grid on every frame enables this performance even for fully dynamic scenes that typically challenge interactive ray tracing systems.

show abstract

“…As the construction of these data structures is expensive, it £ szecsi@iit.bme.hu Ý benedek@iit.bme.hu Þ szirmay@iit.bme.hu is critical to construct and re-build them rapidly without increasing the cost of the ray traversal. This problem was addressed by research related to interactive ray-tracing [16] [14]. Second, modified regions of the scene, and the corresponding items of light representation should be identified.…”

Section: Introductionmentioning

confidence: 99%

Accelerating animation through verification of shooting walks

Szécsi

Benedek

Szirmay‐Kalos

2003

Proceedings of the 19th Spring Conference on Computer Graphics

View full text Add to dashboard Cite

Until recently, research on global illumination and photon maps in particular considered only static scenes. As hardware capabilities and acceleration techniques allow for more rapid image generation, the application of these methods for animation becomes more relevant. Techniques that retain more information about rendered frames are able to exploit coherence between frames to a larger extent. Storing all of the shooting walks, as does the photon map, is a good basis for generating a modified image more rapidly. In this paper, we describe a fast, but conservative method to verify the stored shooting walks. As a result, the cost of updating of the modified walks becomes comparable to the cost of verification, making nonconservative methods and their inherent assumptions unnecessary. In order to achieve this, we use a separation of dynamic and static objects that allows for occlusion tests limited to potentially moving objects.

show abstract

Dynamic Acceleration Structures for Interactive Ray Tracing

Cited by 39 publications

References 7 publications

RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs

RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs

Ray tracing animated scenes using coherent grid traversal

Accelerating animation through verification of shooting walks

Contact Info

Product

Resources

About