2010 | OriginalPaper | Buchkapitel
Adaptive Neighbor Pairing for Smoothed Particle Hydrodynamics
verfasst von : Brandon Pelfrey, Donald House
Erschienen in: Advances in Visual Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.