Efficient Bounds for Point-Based Animations
| dc.contributor.author | Steinemann, Denis | en_US |
| dc.contributor.author | Otaduy, Miguel A. | en_US |
| dc.contributor.author | Gross, Markus | en_US |
| dc.contributor.editor | M. Botsch and R. Pajarola and B. Chen and M. Zwicker | en_US |
| dc.date.accessioned | 2014-01-29T16:52:10Z | |
| dc.date.available | 2014-01-29T16:52:10Z | |
| dc.date.issued | 2007 | en_US |
| dc.description.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. | en_US |
| dc.description.seriesinformation | Eurographics Symposium on Point-Based Graphics | en_US |
| dc.identifier.isbn | 978-3-905673-51-7 | en_US |
| dc.identifier.issn | 1811-7813 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/SPBG/SPBG07/057-064 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling. | en_US |
| dc.title | Efficient Bounds for Point-Based Animations | en_US |