filename     : Ste08a.pdf
entry        : article
conference   : Journal of Computers & Graphics 
pages        : 245-255
year         : 2008
month        : April
title        : Tight and efficient surface bounds in meshless animation
subtitle     :
author       : Denis Steinemann, Miguel A. Otaduy, Markus Gross
booktitle    : 
ISSN/ISBN    : DOI 10.1016/j.cag.2008.01.01
editor       : Joaquim A. Jorge 
publisher    : Elsevier
publ.place   : 
volume       : 32
issue        : 2
language     : 
keywords     : 
abstract     : 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.
r 2008 Elsevier Ltd. All rights reserved.