Fast adaptive shape matching deformations
Symposium on Computer Animation 2004(2008)
摘要
We present a new shape-matching deformation model that allows for efficient handling of topological changes and dynamic adaptive selection of levels of detail. Similar to the recently presented Fast Lattice Shape Matching (FLSM), we compute the position of simulation nodes by convolution of rigid shape matching operators on many overlapping regions, but we rely instead on octree-based hierarchical sampling and an interval-based region definition. Our approach enjoys the efficiency and robustness of shape-matching deformation models, and the same algorithmic simplicity and linear cost as FLSM, but it eliminates its dense sampling requirements. Our method can handle adaptive spatial discretizations, allowing the simulation of more degrees of freedom in arbitrary regions of interest at little additional cost. The method is also versatile, as it can simulate elastic and plastic deformation, it can handle cuts interactively, and it reuses the underlying data structures for efficient handling of (self-)collisions. All this makes it especially useful for interactive applications such as videogames.
更多查看译文
关键词
new shape-matching deformation model,deformation model,dynamic adaptive selection,additional cost,adaptive spatial discretizations,adaptive shape,efficient handling,linear cost,dense sampling requirement,plastic deformation,octree-based hierarchical sampling,degree of freedom,level of detail,region of interest,data structure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络