Show simple item record

dc.contributor.authorSteinemann, Denisen_US
dc.contributor.authorOtaduy, Miguel A.en_US
dc.contributor.authorGross, Markusen_US
dc.contributor.editorM. Botsch and R. Pajarola and B. Chen and M. Zwickeren_US
dc.date.accessioned2014-01-29T16:52:10Z
dc.date.available2014-01-29T16:52:10Z
dc.date.issued2007en_US
dc.identifier.isbn978-3-905673-51-7en_US
dc.identifier.issn1811-7813en_US
dc.identifier.urihttp://dx.doi.org/10.2312/SPBG/SPBG07/057-064en_US
dc.description.abstractWe 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.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling.en_US
dc.titleEfficient Bounds for Point-Based Animationsen_US
dc.description.seriesinformationEurographics Symposium on Point-Based Graphicsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record