Fast Collision Detection for Skeletally DeformableModels

نویسندگان

  • Ladislav Kavan
  • Jirí Zára
چکیده

We present a new method of collision detection for models deformed by linear blend skinning. The linear blend skinning (also known as skeleton-subspace deformation, vertex-blending, or enveloping) is a popular method to animate believable organic models. We consider an exact collision detection based on a hierarchy of bounding spheres. The main problem with this approach is the update of bounding volumes – they must follow the current deformation of the model. We introduce a new fast method to refit the bounding spheres, which can be executed on spheres in any order. Thanks to this on-demand refitting operation we obtain a collision detection algorithm with speed comparable to the standard rigid body collision detection. The algorithm was tested on a variety of practical situations, including an animated crowd. According to these experiments, the proposed approach is considerably faster than the previous method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast swept-volume distance for robust collision detection

The need for collision detection arises in several robotics areas, including motion-planning, online collision avoidance, and simulation. At the heart of most current methods are algorithms for interference detection andor distance computation. A few recent algorithms and implementations are very fast, but to use them for accurate collision detection, very small step sizes can be necessary, red...

متن کامل

Continuous Collision Detection Between Points and Signed Distance Fields

We present an algorithm for fast continuous collision detection between points and signed distance fields. Such robust queries are often needed in computer animation, haptics and virtual reality applications, but have so far only been investigated for polygon (triangular) geometry representations. We demonstrate how to use an octree subdivision of the distance field for fast traversal of distan...

متن کامل

Hierarchical Approach for Fast and Efficient Collision Detection in Urban Simulation

Urban simulation research has become an important research area in computer graphics due to the need to visualize urban environment as realistic as possible. Urban environment consists of elements such as culling, lighting, shadows, collision detection and others that will determine the realism level of simulation. One of the key components that need further consideration is to equip the synthe...

متن کامل

Fast, three-dimensional, collision-free motion planning

Issues dealing with fast, 3-D, collision-free motion planning are discussed, and a fast path planning system under developnlent at NBS i s described. The components of a general motion planner are outlined, and some of their computational aspects are discussed. It is argued that an octree representation of the obstacles in the world leads to fast path planning algorithms. The system we are deve...

متن کامل

Fast distance computation for on-line collision detection with multi-arm robots

For the on-line collision detection with a multi-arm robot a fast method for computing the so-called collision vector is presented. Manipulators and obstacles are modelled by sets of convex polytopes. Known distance algorithms serve as a foundation. To speed up the collision detection dynamic obstacles are approximated by geometric primitives and organized in hierarchies. On-line, the here intr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2005