Object partitioning considered harmful

Popov, Stefan; Georgiev, Iliyan; Dimov, R.; Slusallek, Philipp

doi:10.1145/1572769.1572772

Cited by 30 publications

(28 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[Stich et al 2009], [Popov et al 2009], or using node areas to approximate triangle areas), but EPO was significantly more descriptive than the alternatives.…”

Section: End-point Overlap (Epo)mentioning

confidence: 99%

“…The construction of optimal acceleration structures for ray tracing is believed to be an NP-hard problem [Havran 2000;Ng and Trifonov 2003;Popov et al 2009], and we need to rely on greedy algorithms and heuristic quality descriptors to be able to build the trees in a reasonable amount of time. By far the most commonly used descriptor is the surface area heuristic, SAH [Goldsmith and Salmon 1987;MacDonald and Booth 1990] which corresponds to the expected cost of tracing a non-terminating (long) random ray: (1) where I, L and N are the sets of inner, leaf, and all nodes, respectively.…”

Section: Introductionmentioning

confidence: 99%

“…[Ng and Trifonov 2003;Popov et al 2009;Bittner et al 2013]. We analyze this relationship comprehensively by implementing nine different tree builders and quantifying how well SAH correlates with the ray tracing performance in 22 test scenes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On quality metrics of bounding volume hierarchies

Aila¹,

Karras²,

Laine³

2013

Proceedings of the 5th High-Performance Graphics Conference

View full text Add to dashboard Cite

The surface area heuristic (SAH) is widely used as a predictor for ray tracing performance, and as a heuristic to guide the construction of spatial acceleration structures. We investigate how well SAH actually predicts ray tracing performance of a bounding volume hierarchy (BVH), observe that this relationship is far from perfect, and then propose two new metrics that together with SAH almost completely explain the measured performance. Our observations shed light on the increasingly common situation that a supposedly good tree construction algorithm produces trees that are slower to trace than expected. We also note that the trees constructed using greedy top-down algorithms are consistently faster to trace than SAH indicates and are also more SIMD-friendly than competing approaches.

show abstract

“…[Stich et al 2009], [Popov et al 2009], or using node areas to approximate triangle areas), but EPO was significantly more descriptive than the alternatives.…”

Section: End-point Overlap (Epo)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On quality metrics of bounding volume hierarchies

Aila¹,

Karras²,

Laine³

2013

Proceedings of the 5th High-Performance Graphics Conference

View full text Add to dashboard Cite

show abstract

“…Methods proposed by Dammertz and Keller [7] and Ernst and Greiner [8] recommend splitting triangles to get a better quality data structure. Stich et al [9] and Popov et al [10] proposed variations to BVHs to improve their quality. The construction of Spatial BVH (SBVH) proposed in [9] is considerably higher as an efficient building method is mapped onto GPU is still an issue.…”

Section: Background and Previous Workmentioning

confidence: 99%

Raytracing Dynamic Scenes on the GPU Using Grids

Guntury

Narayanan

2012

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-Raytracing dynamic scenes at interactive rates have received a lot of attention recently. We present a few strategies for high performance raytracing on a commodity GPU. The construction of grids needs sorting, which is fast on today's GPUs. The grid is thus the acceleration structure of choice for dynamic scenes as per-frame rebuilding is required. We advocate the use of appropriate data structures for each stage of raytracing, resulting in multiple structure building per frame. A perspective grid built for the camera achieves perfect coherence for primary rays. A perspective grid built with respect to each light source provides the best performance for shadow rays. Spherical grids handle lights positioned inside the model space and handle spotlights. Uniform grids are best for reflection and refraction rays with little coherence. We propose an Enforced Coherence method to bring coherence to them by rearranging the ray to voxel mapping using sorting. This gives the best performance on GPUs with only user-managed caches. We also propose a simple, Independent Voxel Walk method, which performs best by taking advantage of the L1 and L2 caches on recent GPUs. We achieve over 10 fps of total rendering on the Conference model with one light source and one reflection bounce, while rebuilding the data structure for each stage. Ideas presented here are likely to give high performance on the future GPUs as well as other manycore architectures.

show abstract

“…In the main branches of graphics such as ray tracing and collision detection, researches for spatial hierarchical index structure processing [1,2,3] have become important components. Its introduction makes the processes of such algorithms gain more spatial localities of load distributions, thus their global performances get enhanced a lot.…”

Section: Introductionmentioning

confidence: 99%

A spatial hierarchy FPGA implementation with DPR square root partitions

Huang

Gen

2011

IET International Communication Conference on Wireless Mobile and Computing (CCWMC 2011)

View full text Add to dashboard Cite

The customized hardware platform for spatial hierarchy construction with DPR square root partitions is validly obtained. Specialized process structures and storage structures are constructed to ensure the reutilization of presorting results on each level. The objective functions for division evaluation oriented to specific applications are scheduled. DPR partitions are built to meet intensive square root finding requests. After optimizations for algorithm and architecture, such achievement provides the starting points for future development.

show abstract

Object partitioning considered harmful

Cited by 30 publications

References 12 publications

On quality metrics of bounding volume hierarchies

On quality metrics of bounding volume hierarchies

Raytracing Dynamic Scenes on the GPU Using Grids

A spatial hierarchy FPGA implementation with DPR square root partitions

Contact Info

Product

Resources

About