Accelerated regular grid traversals using extended anisotropic chessboard distance fields on a parallel stream processor

Es, A.; İşler, Veysi

doi:10.1016/j.jpdc.2007.06.011

Cited by 4 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Distance maps encoding the Chebyshev distance metric to the nearest occupied voxel have proven to be effective for ray casting acceleration [7,8]. A ray is able to skip many voxels with a single sample of the distance map if far away from an occupied voxel.…”

Section: Related Workmentioning

confidence: 99%

“…Distance maps are not commonly used for ray casting acceleration because of the computational complexity of generating them which must be done every time the transfer function changes. Previous papers using Chebyshev distance maps for ray casting acceleration generated them at the full resolution of the volume with a serial algorithm [7,8].…”

Section: Chebyshev Distance Mapmentioning

confidence: 99%

“…Our method of skipping rays forward with a Chebyshev distance map is simpler than previous approaches [7,8] and supports lower resolution distance maps which reduces memory overhead and their computation time. In Section 4 we examine the impact on ray casting performance when using a reduced resolution distance map.…”

Section: Chebyshev Distance Mapmentioning

confidence: 99%

“…Es andİşler [8] take the acceleration structure even further and compute the extended anisotropic Chebyshev distance. This represents the distance that can be skipped on the x, y, and z axis separately for each octant.…”

Section: Anisotropic Chebyshev Distance Mapmentioning

confidence: 99%

See 3 more Smart Citations

Efficient ray casting of volumetric images using distance maps for empty space skipping

Deakin

Knackstedt

2020

Comp. Visual Media

View full text Add to dashboard Cite

Volume and isosurface rendering are methods of projecting volumetric images to two dimensions for visualisation. These methods are common in medical imaging and scientific visualisation.Head-mounted optical see-through displays have recently become an affordable technology and are a promising platform for volumetric image visualisation. Images displayed on a head-mounted display must be presented at a high frame rate and with low latency to compensate for head motion. High latency can be jarring and may cause cybersickness which has similar symptoms to motion sickness.Volumetric images can be very computationally expensive to render as they often have hundreds of millions of scalar values. Fortunately, certain materials in images such as air surrounding an object boundary are often made transparent and need not be sampled, which improves rendering efficiency.In our previous work we introduced a novel ray traversal technique for rendering large sparse volumetric images at high frame rates. The method relied on the computation of an occupancy and distance map to speed up ray traversal through empty regions.In this work we achieve higher frame rates than our previous work with an improved method of resuming empty space skipping and the use of anisotropic Chebyshev distance maps. An optimised algorithm for computing Chebyshev distance maps on a graphical processing unit is introduced supporting real-time transfer function editing.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Chebyshev Distance Mapmentioning

confidence: 99%

Section: Chebyshev Distance Mapmentioning

confidence: 99%

Section: Anisotropic Chebyshev Distance Mapmentioning

confidence: 99%

See 2 more Smart Citations

Efficient ray casting of volumetric images using distance maps for empty space skipping

Deakin

Knackstedt

2020

Comp. Visual Media

View full text Add to dashboard Cite

show abstract

“…uniform grids, to adapt to the local primitive density. Some solutions [CS94, EI07] are based on distance fields: The number of adjacent empty cells that can be skipped with a single traversal step is stored alongside each cell. The merge and expansion steps of our method can be seen as a generalization of the approach by Devillers [Dev89], which uses bounding boxes to enclose large regions of empty space.…”

Section: Introductionmentioning

confidence: 99%

GPU Ray Tracing using Irregular Grids

Pérard-Gayot

Kalojanov

Slusallek

2017

Computer Graphics Forum

View full text Add to dashboard Cite

We present a spatial index structure to accelerate ray tracing on GPUs. It is a flat, non-hierarchical spatial subdivision of the scene into axis aligned cells of varying size. In order to construct it, we first nest an octree into each cell of a uniform grid. We then apply two optimization passes to increase ray traversal performance: First, we reduce the expected cost for ray traversal by merging cells together. This adapts the structure to complex primitive distributions, solving the "teapot in a stadium" problem. Second, we decouple the cell boundaries used during traversal for rays entering and exiting a given cell. This allows us to extend the exiting boundaries over adjacent cells that are either empty or do not contain additional primitives. Now, exiting rays can skip empty space and avoid repeating intersection tests. Finally, we demonstrate that in addition to the fast ray traversal performance, the structure can be rebuilt efficiently in parallel, allowing for ray tracing dynamic scenes.

show abstract

A parallel algorithm for construction of uniform grids

Kalojanov

Slusallek

2009

Proceedings of the Conference on High Performance Graphics 2009

View full text Add to dashboard Cite

We present a fast, parallel GPU algorithm for construction of uniform grids for ray tracing, which we implement in CUDA. The algorithm performance does not depend on the primitive distribution, because we reduce the problem to sorting pairs of primitives and cell indices. Our implementation is able to take full advantage of the parallel architecture of the GPU, and construction speed is faster than CPU algorithms running on multiple cores. Its scalability and robustness make it superior to alternative approaches, especially for scenes with complex primitive distributions.

show abstract

Accelerated regular grid traversals using extended anisotropic chessboard distance fields on a parallel stream processor

Cited by 4 publications

References 23 publications

Efficient ray casting of volumetric images using distance maps for empty space skipping

Efficient ray casting of volumetric images using distance maps for empty space skipping

GPU Ray Tracing using Irregular Grids

A parallel algorithm for construction of uniform grids

Contact Info

Product

Resources

About