Name
Abstract | ||
|---|---|---|
We present a technique for accelerating Smoothed Particle Hydrodynamics (SPH) by adaptively constructing and reusing particle pairing information. Based on a small calculation performed on each particle pair, we can determine whether or not pairing information needs to be recomputed at each simulation frame. We present simulations that show that for numbers of particles above 8,000, total simulation computation time is less than one-third of that of the non-adaptive algorithm. In addition, our simulations demonstrate that our algorithm produces simulation results that are visually very similar to the unoptimized version and that visual error does not accumulate as the simulation progresses. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-17274-8_19 | ISVC |
Keywords | Field | DocType |
reusing particle,small calculation,adaptive neighbor,non-adaptive algorithm,present simulation,particle hydrodynamics,simulation result,particle pair,pairing information,total simulation computation time,simulation frame,smoothed particle hydrodynamics,smooth particle hydrodynamics,information need | Smoothed-particle hydrodynamics,Mathematical optimization,Pattern recognition,Computer science,Algorithm,Pairing,Artificial intelligence,Particle,Computation | Conference |
Volume | ISSN | ISBN |
6454 | 0302-9743 | 3-642-17273-3 |
Citations | PageRank | References |
1 | 0.36 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brandon Pelfrey | 1 | 35 | 2.67 |
| Donald H. House | 2 | 513 | 55.27 |