Fast, effective BVH updates for animated scenes

A new fast divide and conquer ray tracing algorithm based on BVH partition which can remove unnecessary rays in subspace is proposed to resolve the problem that bounding boxes not tightly surround the primitives by space divide scheme which then increased unnecessary rays in subspace. Its core idea is that using Bin based BVH construction algorithm to partition primitives into two parts then distributing primitives and rays into corresponding subspace using stream filter. If the number of rays and primitives which intersect a sub space meet some limit condition, the primitives and rays in the subspace then begin basic ray tracing. A comparison between divide conquer ray tracing algorithm using BVH and using space divide schemes such as Kd-tree, grid shows our method can reduce computing with unnecessary rays in subspace substantially and lead to faster performance significantly.

show abstract

“…This scene has a different trend along animation with the frame rate dropping about half. Kopta' research also appears this dropping [24].…”

Section: B Dynamic Scene Testmentioning

confidence: 82%

Divide and Conquer Ray Tracing Algorithm Based on BVH Partition

Hong

Bin

2013

2013 International Conference on Virtual Reality and Visualization

View full text Add to dashboard Cite

show abstract

“…Ref. [12] proposed a method to efficiently extend refitting for animated scenes with tree rotations. Ref.…”

Section: Related Workmentioning

confidence: 99%

“…(5) 11 end for 12 Save contribution of pixel i in frame a 13 end for 14 end for and the intersection cached in the record of the jth neighbor. Finally we sum the weighted radiance values from records according to Eq.…”

Section: The Rendering Frameworkmentioning

confidence: 99%

Variance reduction using interframe coherence for animated scenes

Zhou

Chen

2015

Comp. Visual Media

View full text Add to dashboard Cite

In an animated scene, geometry and lighting often change in an unpredictable way. Rendering algorithms based on Monte Carlo methods are usually employed to precisely capture all features of an animated scene. However, Monte Carlo methods typically take a long time to produce a noise-free image. In this paper, we propose a variance reduction technique for Monte Carlo methods which exploits coherence between frames. Firstly, we introduce a dual cone model to measure the incident coherence intersecting camera rays in object space. Secondly, we allocate multiple frame buffers to store image samples from consecutive frames. Finally, the color of a pixel in one frame is computed by borrowing samples from neighboring pixels in current, previous, and subsequent frames. Our experiments show that noise is greatly reduced by our method since the number of effective samples is increased by use of borrowed samples.

show abstract

“…While its traversal speed is close to the k-d tree's, the BVH has the superior construction performance [Wald et al 2007b]. It is suited for dynamic as well as incremental updates [Larsson and Akenine-Möller 2006;Kopta et al 2012]. The Bounding Interval Hierarchy (BIH) was proposed independently, with only minor differences, by three groups of researchers Woop et al 2006;Wächter and Keller 2006].…”

Section: Irregular Subdivisionsmentioning

confidence: 99%

Spatial data structures for accelerated 3D visibility computation to enable large model visualization on the web

Stein

Limper

Kuijper

2014

Proceedings of the 19th International ACM Conference on 3D Web Technologies

View full text Add to dashboard Cite

The visualization of massive 3D models is an intensively examined field of research. Due to their rapidly growing complexity of such models, visualisation them in real-time will never be possible through a higher speed of rasterization alone. Instead, a practical solution has to reduce the amount of data to be processed, using a fast visibility determination. In recent years, the combination of Javascript and WebGL raised attention for the possibility of rendering hardware-accelerated 3D graphics directly in the browser. However, when compared to desktop applications, they are still fighting with their disadvantages of a generally slower execution speed, or a downgraded set of functionality. We demonstrate the integration of spatial data structures, computed on the client side, using latest technology trends to mitigate the shortcomings of the 3D Web environment. We employ comparably small bounding volume hierarchies to accelerate our visibility determination, as well as to enable specific culling techniques. This allows for an interactive visualization of such massive 3D data sets. Our in-depth analysis of different data structures and environments shows which combination of data structure and visibility determination techniques are currently the best fit for the Web

show abstract

Fast, effective BVH updates for animated scenes

Cited by 37 publications

References 16 publications

Divide and Conquer Ray Tracing Algorithm Based on BVH Partition

Divide and Conquer Ray Tracing Algorithm Based on BVH Partition

Variance reduction using interframe coherence for animated scenes

Spatial data structures for accelerated 3D visibility computation to enable large model visualization on the web

Contact Info

Product

Resources

About