A parallel algorithm for construction of uniform grids

Authors:
Javor Kalojanov;Philipp Slusallek
Affiliations:
Saarland University;Saarland University
Venue:
Proceedings of the Conference on High Performance Graphics 2009
Year:
2009

Citing 14
Cited 16

Heuristics for ray tracing using space subdivision

The Visual Computer: International Journal of Computer Graphics
Fast, minimum storage ray-triangle intersection

Journal of Graphics Tools
Ray tracing on programmable graphics hardware

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Fast 3D triangle-box overlap testing

Journal of Graphics Tools
Fast scene voxelization and applications

I3D '06 Proceedings of the 2006 symposium on Interactive 3D graphics and games
Ray tracing animated scenes using coherent grid traversal

ACM SIGGRAPH 2006 Papers
Scan primitives for GPU computing

Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Accelerated regular grid traversals using extended anisotropic chessboard distance fields on a parallel stream processor

Journal of Parallel and Distributed Computing
Scalable Parallel Programming with CUDA

Queue - GPU Computing
Real-time KD-tree construction on graphics hardware

ACM SIGGRAPH Asia 2008 papers
Ray Casting Deformable Models on the GPU

ICVGIP '08 Proceedings of the 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing
Grid Creation Strategies for Efficient Ray Tracing

RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Realtime Ray Tracing on GPU with BVH-based Packet Traversal

RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing
Compact, fast and robust grids for ray tracing

EGSR'08 Proceedings of the Nineteenth Eurographics conference on Rendering

Fast parallel surface and solid voxelization on GPUs

ACM SIGGRAPH Asia 2010 papers
Interactive hydraulic erosion using CUDA

ICCVG'10 Proceedings of the 2010 international conference on Computer vision and graphics: Part I
Implicit and dynamic trees for high performance rendering

Proceedings of Graphics Interface 2011
Simpler and faster HLBVH with work queues

Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
VoxelPipe: a programmable pipeline for 3D voxelization

Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
An efficient parallel architecture for ray-tracing

Analog Integrated Circuits and Signal Processing
3D rasterization: a bridge between rasterization and ray casting

Proceedings of Graphics Interface 2012
Fast GPU perspective grid construction and triangle tracing for exhaustive ray tracing of highly coherent rays

International Journal of High Performance Computing Applications
Ray tracing dynamic scenes with shadows on GPU

EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization
Streamed ray tracing of single rays on the cell processor

EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization
GPU-based parallel algorithm for particle contact detection and its application in self-compacting concrete flow simulations

Computers and Structures
gkDtree: A group-based parallel update kd-tree for interactive ray tracing

Journal of Systems Architecture: the EUROMICRO Journal
Efficient hardware implementation of Ray Tracing based on an embedded software for intersection computation

Journal of Systems Architecture: the EUROMICRO Journal
Efficient divide-and-conquer ray tracing using ray sampling

Proceedings of the 5th High-Performance Graphics Conference
A micro 64-tree structure for accelerating ray tracing on a GPU

Proceedings of Graphics Interface 2013
A classification of scientific visualization algorithms for massive threading

UltraVis '13 Proceedings of the 8th International Workshop on Ultrascale Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.