This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated by a comparatively small number of simulation nodes, we are able to compute tight bounding volumes with a cost linear in the number of simulation nodes. Our approach extends concepts about bounds of convex sets to the meshless deformation setting, and we introduce an efficient algorithm for finding extrema of these convex sets. The extrema can be used for efficiently updating bounding volumes such as AABBs or k-DOPs, as we show in our results. The choice of particular bounding volume may depend on the complexity of the contact configurations, but in all cases we can compute surface bound orders of magnitude faster and/or tighter than with previous methods.

For more information, visit http://graphics.ethz.ch/research/physics/tightbounds.php

@Article\{SOG08a,
  author       = "Steinemann, Denis and Otaduy, Miguel A. and Gross, Markus",
  title        = "Tight and Efficient Surface Bounds in Meshless Animation",
  journal      = "Computers \& Graphics",
  number       = "2",
  volume       = "32",
  pages        = "235--245",
  month        = "apr",
  year         = "2008",
  url          = "http://gmrv.es/Publications/2008/SOG08a"
}