Efficient Bounds for Point-Based Animations

Steinemann, Denis; Otaduy, Miguel A.; Gross, Markus

Efficient Bounds for Point-Based Animations

Files

057-064.pdf (248.17 KB)

pbg07_paper1009.avi (17.47 MB)

Date

2007

Authors

Steinemann, Denis
Otaduy, Miguel A.
Gross, Markus

Publisher

The Eurographics Association

Abstract

We introduce a new and efficient approach for collision detection in point-based animations, based on the fast computation of tight surface bounds. Our approach is able to tightly bound a high-resolution surface with a cost linear in the number of simulation nodes, which is typically small. We extend concepts about bounds of convex sets to the point-based deformation setting, and we introduce an efficient algorithm for finding extrema of these convex sets. We can compute surface bounds orders of magnitude faster and/or tighter than with previous methods.

        @inproceedings{:10.2312/SPBG/SPBG07/057-064
,
booktitle = {Eurographics Symposium on Point-Based Graphics
},
editor = {M. Botsch and R. Pajarola and B. Chen and M. Zwicker
},
title = {{Efficient Bounds for Point-Based Animations
}},
author = {Steinemann, Denis and 
Otaduy, Miguel A. and 
Gross, Markus
},
year = {2007
},
publisher = {The Eurographics Association
},
ISSN = {1811-7813
},
ISBN = {978-3-905673-51-7
},
DOI = {/10.2312/SPBG/SPBG07/057-064
}
}