A hierarchical hashing scheme for nearest neighbor search and broad-phase collision detection

zbMATH Open1184.68569MaRDI QIDQ3400337FDOQ3400337

Authors: Mickael Pouchol, Alexandre Ahmad, B. Crespin, Olivier Terraz 

Publication date: 5 February 2010

Recommendations

• Efficient neighbor search for particle methods on GPUs
• An octree-based proxy for collision detection in large-scale particle systems
• Hash-based algorithms for discretized data
• scientific article; zbMATH DE number 1487774
• Algorithms for particle-field simulations with collisions

zbMATH Keywords

dynamic acceleration modelparticle neighborhood queries

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (2)

• Hash Bit Selection for Nearest Neighbor Search
• An octree-based proxy for collision detection in large-scale particle systems

This page was built for publication: A hierarchical hashing scheme for nearest neighbor search and broad-phase collision detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400337)