Lightweight Bounding Volumes for Ray Tracing

Cline, David; Steele, Kevin L.; Egbert, Parris K.

doi:10.1080/2151237x.2006.10129226

Cited by 20 publications

(20 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast to reduced-precision methods [Mah05,HMB06], which work best when the overhead of transforming the packed data to world space is amortized over a bundle of rays, we increase the arity of the acceleration hierarchy, which saves memory for nodes and pointers. This is similar to a lightweight BVH [CSE06], but in the context of efficient SIMD processing and without the drawbacks of limited precision and median split tree construction.…”

Section: Introduction and Previous Workmentioning

confidence: 99%

Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays

Dammertz

Hanika

Keller³

2008

Computer Graphics Forum

View full text Add to dashboard Cite

Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths that are very incoherent by construction. We therefore investigate the use of SIMD instructions to accelerate incoherent rays. SIMD is used in the hierarchy construction, the tree traversal and the leaf intersection. This is achieved by increasing the arity of acceleration structures, which also reduces memory requirements. We show that the resulting hierarchies can be built quickly and are smaller than acceleration structures known so far while at the same time outperforming them for incoherent rays. Our new acceleration structure speeds up ray tracing by a factor of 1.6 to 2.0 compared to a highly optimized bounding interval hierarchy implementation, and 1.3 to 1.6 compared to an efficient kd-tree. At the same time, the memory requirements are reduced by 10-50%. Additionally we show how a caching mechanism in conjunction with this memory efficient hierarchy can be used to speed up shadow rays in a global illumination algorithm without increasing the memory footprint. This optimization decreased the number of traversal steps up to 50%.

show abstract

Section: Introduction and Previous Workmentioning

confidence: 99%

Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays

Dammertz

Hanika

Keller³

2008

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…In order to be able to compute the children for any node, we enforce the hierarchy to be a complete, left‐balanced tree arranged in breadth‐first order. This allows us to index it like a heap without explicitly saving any pointers or indices [CSE06], For any implicit node n i its children are indexed with kn i + m where k is the branching factor. In our case k = 2, and m ∈ {1, …, k } denotes the first child node, the second child and so on.…”

Section: Complete Implicit Representationmentioning

confidence: 99%

Geometry Presorting for Implicit Object Space Partitioning

Eisemann

Bauszat

Guthe

et al. 2012

Computer Graphics Forum

View full text Add to dashboard Cite

We present a new data structure for object space partitioning that can be represented completely implicitly. The bounds of each node in the tree structure are recreated at run‐time from the scene objects contained therein. By applying a presorting procedure to the geometry, only a known fraction of the geometry is needed to locate the bounding planes of any node. We evaluate the impact of the implicit bounding plane representation and compare our algorithm to a classic bounding volume hierarchy. Though the representation is completely implicit, we still achieve interactive frame rates on commodity hardware.

show abstract

“…Also, there have been several approach to compactly represent hierarchies for ray tracing [Mahovsky 2005;Cline et al 2006]. Lauterbach et al [2007] proposed Ray-Strips as a compact mesh and hierarchy representation for ray tracing.…”

Section: Compressionmentioning

confidence: 99%

Efficient data reduction and cache-coherent techniques toward real-time performance

Kasik

2007

ACM SIGGRAPH 2007 Courses

View full text Add to dashboard Cite

Figure 1: Application of our multi-resolution techniques and cache-efficient layouts to the rendering of the double eagle tanker (82 million triangles). By using these techniques, we are able to significantly improve the performance over the previous rasterization techniques and achieve an interactive performace on a commodity hardware. The performance improvement is mainly achieved by the significant reduction on the amount of necessary data and cache-coherent access patterns on the data. Course Notes: State-of-the art in Massive Model Visualization. Kasik et al. 44 Course Notes: State-of-the art in Massive Model Visualization. Kasik et al. 45limited memory . Algorithms for occlusion culling and out-of-core techniques also perform computations based on the view parameters. However, no known algorithms integrate conservative occlusion culling and out-of-core rendering with vertex hierarchies. Particularly, Yoon et al. [2004b; 2005b] proposed a clustered hierarchy of progressive meshes(CHPM) for interactive view-dependent rendering of massive models. The CHPM consists of two parts:• Cluster Hierarchy: The entire dataset is represented as a hierarchy of clusters, which are spatially localized mesh regions. Each cluster consists of a few thousand triangles. Conceptually, a cluster hierarchy is similar to a vertex hierarchy. However, every node of a cluster hierarchy represents a set of vertices and faces rather than a single vertex. The clusters provide the capability to perform coarse-grained view-dependent (or selective) refinement of the model. They are also used for visibility computations and out-of-core rendering.• Progressive Mesh: Then, each cluster is also represented as a linear sequence of edge collapses as a progressive mesh (PM). A PM is a mesh sequence built from an input mesh by a sequence of edge collapse operations. The inverse operation, a vertex split, restores the original vertices and replaces the removed triangles. The PMs are used for fine-grained local refinement and to compute an error-bounded simplification of each cluster at runtime. In practice, refining a PM is a very fast operation since PM can be stored in an array and can be refined without checking any dependency, which is typically required to guarantee correct LOD representation.CHPM representation provides two levels of refinement for interactive view-dependent rendering of massive models. First we perform a coarse-grained refinement at the cluster level. Next we refine the PMs of the selected clusters. The PM refinement provides smooth LOD transitions.This representation has been implemented as a system called Quick-VDR on a commodity PC. This system was demonstrated with several models including a complex CAD environment (12M triangles), scanned models (372M triangles), and an isosurface (100M triangles). Moreover, they were able to render these models at 10 − 35 frames per second using a limited memory footprint of 400 − 600MB.In this course note, we have discussed three orthogonal methods, 1) multi-resolution method to reduc...

show abstract

Lightweight Bounding Volumes for Ray Tracing

Cited by 20 publications

References 6 publications

Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays

Shallow Bounding Volume Hierarchies for Fast SIMD Ray Tracing of Incoherent Rays

Geometry Presorting for Implicit Object Space Partitioning

Efficient data reduction and cache-coherent techniques toward real-time performance

Contact Info

Product

Resources

About