Acceleration structure
- SPH based on pair-wise interation \(\Rightarrow\) spatial sorting acceleration structure
-
- - Uniform grid: simple and efficient.
- - Verlet lists (wider neighborhood, updated every \(n\) steps only)
- - List of vertices per cell, hash table for cell storage
- - Spatial sorting for cache efficiency
M. Teschner