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

We present an algorithm for fast optimization of bounding volume hierarchies (BVH) for efficient ray tracing. We perform selective updates of the hierarchy driven by the cost model derived from the surface area heuristic. In each step the algorithm updates a fraction of the hierarchy nodes in order to minimize the overall hierarchy cost. The updates are realized by simple operations on the tree nodes: removal, search, and insertion. Our method can quickly reduce the cost of the hierarchy constructed by the traditional techniques such as the surface area heuristic. We evaluate the properties of the proposed method on fourteen test scenes of different complexity including individual objects and architectural scenes. The results show that our method can improve a BVH initially constructed with the surface area heuristic by up to 27% and a BVH constructed with the spatial median split by up to 88%.

show abstract

“…The first node inefficiency measure M SUM corresponds to a component of the cost model used by Lauterbach et al [LYTM06] and is evaluated as:…”

Section: Selecting Nodes For Updatementioning

confidence: 99%

Fast Insertion‐Based Optimization of Bounding Volume Hierarchies

Bittner

Hapala

Havran

2013

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…However, spatial splits also remove some of the simplicity of regular BVHs. In particular, the ability to easily refit bounding volumes in dynamic scenes [Lauterbach et al 2006;Wald et al 2007] is lost. Finding a way to combine the two concepts presents an interesting area of future research.…”

Section: Future Workmentioning

confidence: 99%

Spatial splits in bounding volume hierarchies

Stich

Friedrich

Dietrich

2009

Proceedings of the Conference on High Performance Graphics 2009

105

View full text Add to dashboard Cite

Figure 1: Sample scene consisting of roughly 1.9 million triangles (left). Our method (middle) results in a significant reduction of ray shooting costs compared to a regular bounding volume hierarchy (right). The heat views visualize the summed number of traversal steps and primitive intersections for primary rays. AbstractBounding volume hierarchies (BVH) have become a widely used alternative to kD-trees as the acceleration structure of choice in modern ray tracing systems. However, BVHs adapt poorly to nonuniformly tessellated scenes, which leads to increased ray shooting costs. This paper presents a novel and practical BVH construction algorithm, which addresses the issue by utilizing spatial splitting similar to kD-trees. In contrast to previous preprocessing approaches, our method uses the surface area heuristic to control primitive splitting during tree construction. We show that our algorithm produces significantly more efficient hierarchies than other techniques. In addition, user parameters that directly influence splitting are eliminated, making the algorithm easily controllable.

show abstract

“…In this section, RTRPS is compared with famous ray tracing methods [19], [25], [26], [34] and a GPU ray tracer constructing BVH rapidly [27]. The RTRPS is designed for high quality image generation using a large number of secondary rays, such as diffuse rays, at an interactive rate.…”

Section: Applying To the First-hit Ray Tracingmentioning

confidence: 99%

“…RTRPS is also compared to the proposal based on the axis aligned bounding box (AABB) hierarchies [25], where two AABB techniques using surface area heuristic (SAH) and median split (Med), respectively, were implemented. From the table, we can see that RTRPS shows better performance than AABB with SAH.…”

Section: Applying To the First-hit Ray Tracingmentioning

confidence: 99%

A Fast Ray-Tracing Using Bounding Spheres and Frustum Rays for Dynamic Scene Rendering

Suzuki

Kaeriyama

Komatsu

et al. 2010

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYRay tracing is one of the most popular techniques for generating photo-realistic images. Extensive research and development work has made interactive static scene rendering realistic. This paper deals with interactive dynamic scene rendering in which not only the eye point but also the objects in the scene change their 3D locations every frame. In order to realize interactive dynamic scene rendering, RTRPS (Ray Tracing based on Ray Plane and Bounding Sphere), which utilizes the coherency in rays, objects, and grouped-rays, is introduced. RTRPS uses bounding spheres as the spatial data structure which utilizes the coherency in objects. By using bounding spheres, RTRPS can ignore the rotation of moving objects within a sphere, and shorten the update time between frames. RTRPS utilizes the coherency in rays by merging rays into a ray-plane, assuming that the secondary rays and shadow rays are shot through an aligned grid. Since a pair of ray-planes shares an original ray, the intersection for the ray can be completed using the coherency in the ray-planes. Because of the three kinds of coherency, RTRPS can significantly reduce the number of intersection tests for ray tracing. Further acceleration techniques for ray-plane-sphere and ray-triangle intersection are also presented. A parallel projection technique converts a 3D vector inner product operation into a 2D operation and reduces the number of floating point operations. Techniques based on frustum culling and binary-tree structured ray-planes optimize the order of intersection tests between ray-planes and a sphere, resulting in 50% to 90% reduction of intersection tests. Two ray-triangle intersection techniques are also introduced, which are effective when a large number of rays are packed into a ray-plane. Our performance evaluations indicate that RTRPS gives 13 to 392 times speed up in comparison with a ray tracing algorithm without organized rays and spheres. We found out that RTRPS also provides competitive performance even if only primary rays are used.

show abstract

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

Cited by 84 publications

References 37 publications

Fast Insertion‐Based Optimization of Bounding Volume Hierarchies

Fast Insertion‐Based Optimization of Bounding Volume Hierarchies

Spatial splits in bounding volume hierarchies

A Fast Ray-Tracing Using Bounding Spheres and Frustum Rays for Dynamic Scene Rendering

Contact Info

Product

Resources

About