Fixed-radius Near Neighbors Searching for 2D Simulations on the GPU using Delaunay Triangulations

Abstract
We propose to explore a GPU solution to the fixed-radius nearest-neighbor problem in 2D based on Delaunay triangulations. This problem is crucial for many particle-based simulation techniques for collision detection or momentum exchange between particles. Our method computes the neighborhood of each particle at each iteration without neighbor lists or grids, using a Delaunay triangulation whose consistency is preserved by edge flipping. We study how this approach compares to a grid-based implementation on a flocking simulation with variable parameters.
Description

CCS Concepts: Computing methodologies --> Physical simulation; Massively parallel and high-performance simulations

        
@inproceedings{
10.2312:egp.20221002
, booktitle = {
Eurographics 2022 - Posters
}, editor = {
Sauvage, Basile
and
Hasic-Telalovic, Jasminka
}, title = {{
Fixed-radius Near Neighbors Searching for 2D Simulations on the GPU using Delaunay Triangulations
}}, author = {
Porro, Heinich
and
Crespin, BenoƮt
and
Hitschfeld-Kahler, Nancy
and
Navarro, Cristobal
}, year = {
2022
}, publisher = {
The Eurographics Association
}, ISSN = {
1017-4656
}, ISBN = {
978-3-03868-171-7
}, DOI = {
10.2312/egp.20221002
} }
Citation