Minimizing probable collision pairs searched in interactive animation authoring

Animation authoring involves an author's interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detection and prediction of collision in minimal time and with high accuracy is a challenge. This paper proposes using the bounding volume-based space subdivision mechanism to reduce search space for an object pair collision search. This data structure is enhanced using a direction-based spatial hash table, which predicts collision between static and dynamic objects. These techniques are shown to work in conjunction with existing search space reduction methods. The event of collision is accurately detected using known methods, such as kinetic data structures. Simulation results show that for a scene with 10000 objects with varying dynamic objects (10%

• Type: Journal
• Year: 2008
• Where: VC
• Authors: Parag Agarwal, Srinivas Rajagopalan, B. Prabhakaran
• Keywords: Collision, Search Space, Spatial Hash Table, VC 2008