Efficient ray tracing of subdivision surfaces using tessellation caching

Benthin, Carsten; Woop, Sven; Nießner, Matthias; Selgrad, Kai; Wald, Ingo

doi:10.1145/2790060.2790061

Cited by 23 publications

(13 citation statements)

References 24 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First of all, our current work was not tested with displacement mapping. Fortunately, supporting displacement mapping has been reasonably well known [BWN*15], and our hierarchy can be extended in a similar manner with a larger error bound containing the displaced geometry. Nonetheless, the naive extension could be very conservative and will require more elaborated study for computing tight bounds.…”

Section: Results and Comparisonsmentioning

confidence: 99%

“…To avoid memory overflow caused by large scale models, this approach does not retain any of the subdivided patches in memory once rays terminate. To efficiently evaluate the underlying surface representation, Benthin et al also proposed to lazily tessellate necessary patches, while utilizing adaptive subdivision [BWN*15].…”

Section: Related Workmentioning

confidence: 99%

“…To address them, prior techniques on ray tracing subdivision surfaces focused on adaptive tessellation methods [MTF03, CLF*03], packetization [BBLW07], and on‐demand computations [BWN*15]. Nonetheless, ray tracing subdivision surfaces has been considered slow and required high memory footprints at runtime.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

TSS BVHs: Tetrahedron Swept Sphere BVHs for Ray Tracing Subdivision Surfaces

Kim

Yoon

2016

Computer Graphics Forum

View full text Add to dashboard Cite

We present a novel, compact bounding volume hierarchy, TSS BVH, for ray tracing subdivision surfaces computed by the Catmull-Clark scheme. We use Tetrahedron Swept Sphere (TSS) as a bounding volume to tightly bound limit surfaces of such subdivision surfaces given a user tolerance. Geometric coordinates defining our TSS bounding volumes are implicitly computed from the subdivided mesh via a simple vertex ordering method, and each level of our TSS BVH is associated with a single distance bound, utilizing the Catmull-Clark scheme. These features result in a linear space complexity as a function of the tree depth, while many prior BVHs have exponential space complexity. We have tested our method against different benchmarks with path tracing and photon mapping. We found that our method achieves up to two orders of magnitude of memory reduction with a high culling ratio over the prior AABB BVH methods, when we represent models with two to four subdivision levels. Overall, our method achieves three times performance improvement thanks to these results. These results are acquired by our theorem that rigorously computes our TSS bounding volumes.

show abstract

Section: Results and Comparisonsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

TSS BVHs: Tetrahedron Swept Sphere BVHs for Ray Tracing Subdivision Surfaces

Kim

Yoon

2016

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…Lazy build is a prominent technique that can reduce the construction cost because only the necessary AS is built on demand. Since Hunt et al [2007] first proposed the algorithm, some production renderers [Benthin et al 2015;Georgiev et al 2018] have introduced this feature in production. One downside is that it should queue rays hitting the object on which AS is being built.…”

Section: Related Workmentioning

confidence: 99%

Lazy Build of Acceleration Structures with Traversal Shaders

Lee¹,

Liktor²

2020

SIGGRAPH Asia 2020 Technical Communications

View full text Add to dashboard Cite

Intel Corporation (c) (d) (e) (b) (a) Figure 1: Our algorithm allows the AS builder to ignore geometry if no rays traverse their bounds. When rendering the Sponza scene with several dynamic objects (a), conventional renderers may update the AS of all dynamic objects (b), while our lazy build omits invisible ones including secondary rays (c). We can also extend the scope of the algorithm for procedural geometry, such as tessellation (d). We visualize the bounds of animated patches that were not even tessellated for the current frame (e).

show abstract

“…The hardware graphics pipeline supports dynamic tessellation, in order to better match the geometric resolution to the spatial sampling resolution. Tessellation within ray tracing systems is desirable but non-trivial [Benthin et al 2015].…”

Section: Future Workmentioning

confidence: 99%

Hierarchical Visibility for Virtual Reality

Hunt¹,

Mara

Nankervis³

2018

Proc. ACM Comput. Graph. Interact. Tech.

View full text Add to dashboard Cite

We introduce a novel primary visibility algorithm based on ray casting that provides real time performance and a feature set well suited for rendering virtual reality. The flexibility provided by our approach allows for a variety of features such as lens distortion, sub-pixel rendering, very wide field of view, foveation and stochastic depth of field blur to be implemented and composed naturally while maintaining real time performance. In contrast, the current rasterization pipelines implemented in hardware require multiple passes and/or post processing to approximate these features and current highly optimized ray tracers, which primarily focus on Monte Carlo path tracing, do not achieve real time performance on current VR displays (1080x1200x2@90hz). Our approach uses a bounding volume hierarchy acceleration and a two level frustum culling/entry point search algorithm to optimize the traversal of coherent primary visibility rays. We introduce an adaptation of MSAA for raycasting that significantly lowers memory bandwidth, we leverage an AVX optimized CPU traversal to perform the majority of culling and an optimized CUDA GPU implementation for triangle intersection, multi-sample antialiasing, and shading. The implementation provides support for animation and physically-based shading and lighting. We believe this approach presents a concrete, viable alternative to rasterization that is significantly better suited to rendering for virtual and augmented reality. In order to engage the community, we have released our implementation under an open-source license.

show abstract

Efficient ray tracing of subdivision surfaces using tessellation caching

Cited by 23 publications

References 24 publications

TSS BVHs: Tetrahedron Swept Sphere BVHs for Ray Tracing Subdivision Surfaces

TSS BVHs: Tetrahedron Swept Sphere BVHs for Ray Tracing Subdivision Surfaces

Lazy Build of Acceleration Structures with Traversal Shaders

Hierarchical Visibility for Virtual Reality

Contact Info

Product

Resources

About