Sliced data structure for particle-based simulations on GPUs

Authors:
Takahiro Harada;Seiichi Koshizuka;Yoichiro Kawaguchi
Affiliations:
The University of Tokyo;The University of Tokyo;The University of Tokyo
Venue:
Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia
Year:
2007

Citing 8
Cited 3

Physically-based visual simulation on graphics hardware

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Photon mapping on programmable graphics hardware

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Simulation of cloud dynamics on graphics hardware

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Particle-based fluid simulation for interactive applications

Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation
UberFlow: a GPU-based particle engine

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Perfect spatial hashing

ACM SIGGRAPH 2006 Papers
Cloth simulation on the GPU

SIGGRAPH '05 ACM SIGGRAPH 2005 Sketches
Adaptively sampled particle fluids

ACM SIGGRAPH 2007 papers

Massive particles: particle-based simulations on multiple GPUs

ACM SIGGRAPH 2008 talks
Interactive SPH simulation and rendering on the GPU

Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
GPU-based parallel algorithm for particle contact detection and its application in self-compacting concrete flow simulations

Computers and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a sliced data structure that is effective for use in neighboring particle search for particle-based simulations. In this method, a grid is dynamically constructed to fit to a particle distribution. Rather than computing the grid to fit perfectly to the particle distribution, it compute a grid with some margin to the distribution. This lowers the computation cost of constructing the data structure. Before storing particle indices on a grid, key values which are used to compute the index of a voxel are calculated. The proposed data structure can be introduced into particle-based simulations that run entirely on the Graphics Processing Unit (GPU) because the construction of this data structure and access to storing values can also be also performed entirely on the GPU. The proposed data structure removes the restriction of a computation region with a fixed grid and makes it possible to simulate particle motions over a larger area. Moreover, the cost of the proposed method is low enough for use in real-time applications. In this paper, we first introduce the sliced data structure and then describe its implementation on the GPU. Finally, we apply the propsed method to particle-based simulations and present its quantitative evaluations.