Fast, parallel, GPU-based construction of space filling curves and octrees

Authors:
Prekshu Ajmera;Rhushabh Goradia;Sharat Chandran;Srinivas Aluru
Affiliations:
Indian Institute of Technology, Bombay;Indian Institute of Technology, Bombay;Indian Institute of Technology, Bombay;Iowa State University
Venue:
Proceedings of the 2008 symposium on Interactive 3D graphics and games
Year:
2008

Citing 0
Cited 8

A massively parallel adaptive fast-multipole method on heterogeneous architectures

Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Efficient Strategies for Acceleration Structure Updates in Interactive Ray Tracing Applications on the Cell Processor

ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
Real time ray tracing of point-based models

Proceedings of the 2010 ACM SIGGRAPH symposium on Interactive 3D Graphics and Games
Diagnosis, Tuning, and Redesign for Multicore Performance: A Case Study of the Fast Multipole Method

Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Implicit surface octrees for ray tracing point models

Proceedings of the Seventh Indian Conference on Computer Vision, Graphics and Image Processing
Data-parallel hierarchical link creation for radiosity

EG PGV'09 Proceedings of the 9th Eurographics conference on Parallel Graphics and Visualization
Real-time high-resolution sparse voxelization with application to image-based modeling

Proceedings of the 5th High-Performance Graphics Conference
A CPU: GPU Hybrid Implementation and Model-Driven Scheduling of the Fast Multipole Method

Proceedings of Workshop on General Purpose Processing Using GPUs

Quantified Score

Hi-index	0.00

Visualization

Abstract

Space Filling Curves (SFC) are particularly useful in linearization of data living in two and three dimensional spaces and have been used in a number of applications in scientific computing, and visualization. Interestingly, octrees, another versatile data structure in computer graphics, can be viewed as multiple SFCs at varying resolutions, albeit with parent-child relationship. In this paper we provide a parallel implementation of SFCs and octrees on GPUs that rely on algorithms designed to minimize or eliminate communications.