2010 2nd International Workshop on Database Technology and Applications 2010
DOI: 10.1109/dbta.2010.5659015
|View full text |Cite
|
Sign up to set email alerts
|

A New GPU-Based Neighbor Search Algorithm for Fluid Simulations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…However, the bit width of data for hashing is limited. Developed along a similar line of approach, the GPU‐based neighbor search method on binary search can be found in . In , z‐indexing method have been employed to improve the hashing algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…However, the bit width of data for hashing is limited. Developed along a similar line of approach, the GPU‐based neighbor search method on binary search can be found in . In , z‐indexing method have been employed to improve the hashing algorithm.…”
Section: Related Workmentioning
confidence: 99%
“…Shifting the computational burden from the Central Processing Unit (CPU) to the GPU in SPH is now common. Two examples are the works by Goswami [67] and Zhao [68], each of which provide unique algorithms to streamline the SPH fluid formulation on the GPU.…”
Section: Smoothed Particle Hydrodynamicsmentioning
confidence: 99%