A Hierarchical Hashing Scheme for Nearest Neighbor Search and Broad-Phase Collision Detection
Mickael Pouchol, Alexandre Ahmad, Benoit Crespin, Olivier Terraz
In Journal of Graphics, GPU, and Game Tools, 14(2), 2009.
Abstract: Increasing computational power allows computer graphics researchers to model spectacular phenomena such as fluids and their interactions with deformable objects and structures. Particle-based (or Lagrangian) fluid and solid simulations are commonly managed separately and mixed together for the collision detection phase. We present a unified dynamic acceleration model to be used for particle neighborhood queries and broad-phase collision detection, based on a hierarchical hash table data structure. Our method is able to significantly reduce computations in large, empty areas, and thus gives better results than existing acceleration techniques, such as multilevel hashing schemes or KD-trees, in most situations.
Article URL: http://dx.doi.org/10.1080/2151237X.2009.10129281
BibTeX format:
@article{Pouchol:2009:AHH,
  author = {Mickael Pouchol and Alexandre Ahmad and Benoit Crespin and Olivier Terraz},
  title = {A Hierarchical Hashing Scheme for Nearest Neighbor Search and Broad-Phase Collision Detection},
  journal = {Journal of Graphics, GPU, and Game Tools},
  volume = {14},
  number = {2},
  pages = {45--59},
  year = {2009},
}
Search for more articles by Mickael Pouchol.
Search for more articles by Alexandre Ahmad.
Search for more articles by Benoit Crespin.
Search for more articles by Olivier Terraz.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."