Fast proximity computation among deformable models using discrete Voronoi diagrams
Avneesh Sud, Naga Govindaraju, Russell Gayle, Ilknur Kabul, Dinesh Manocha
In ACM Transactions on Graphics, 25(3), July 2006.
Abstract: We present novel algorithms to perform collision and distance queries among multiple deformable models in dynamic environments. These include inter-object queries between different objects as well as intra-object queries. We describe a unified approach to compute these queries based on N-body distance computation and use properties of the 2nd order discrete Voronoi diagram to perform N-body culling. Our algorithms involve no preprocessing and also work well on models with changing topologies. We can perform all proximity queries among complex deformable models consisting of thousands of triangles in a fraction of a second on a high-end PC. Moreover, our Voronoi-based culling algorithm can improve the performance of separation distance and penetration queries by an order of magnitude.
Keyword(s): N-body queries, deformable collisions, distance fields, penetration computation, self-collisions
Article URL: http://doi.acm.org/10.1145/1141911.1142006
BibTeX format:
@article{Sud:2006:FPC,
  author = {Avneesh Sud and Naga Govindaraju and Russell Gayle and Ilknur Kabul and Dinesh Manocha},
  title = {Fast proximity computation among deformable models using discrete Voronoi diagrams},
  journal = {ACM Transactions on Graphics},
  volume = {25},
  number = {3},
  pages = {1144--1153},
  month = jul,
  year = {2006},
}
Search for more articles by Avneesh Sud.
Search for more articles by Naga Govindaraju.
Search for more articles by Russell Gayle.
Search for more articles by Ilknur Kabul.
Search for more articles by Dinesh Manocha.

Return to the search page.


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