Collision Detection for Deformable Objects
Total Page:16
File Type:pdf, Size:1020Kb
Collision Detection for Deformable Objects Matthias Teschner, Stefan Kimmerle, Bruno Heidelberger, Gabriel Zachmann, Laks Raghupathi, Arnulph Fuhrmann, Marie-Paule Cani, François Faure, Nadia Magnenat-Thalmann, Wolfgang Strasser, et al. To cite this version: Matthias Teschner, Stefan Kimmerle, Bruno Heidelberger, Gabriel Zachmann, Laks Raghupathi, et al.. Collision Detection for Deformable Objects. Eurographics State-of-the-Art Report (EG-STAR), Aug 2004, Grenoble, France. inria-00539916 HAL Id: inria-00539916 https://hal.inria.fr/inria-00539916 Submitted on 25 Nov 2010 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Volume xx , Number x Collision Detection for Deformable Objects M. Teschner1, S. Kimmerle3, B. Heidelberger2, G. Zachmann6, L. Raghupathi5, A. Fuhrmann7, M.-P. Cani5, F. Faure5, N. Magnenat-Thalmann4, W. Strasser3, P. Volino4 1 Computer Graphics Laboratory, University of Freiburg, Germany 2 Computer Graphics Laboratory, ETH Zurich, Switzerland 3 WSI/GRIS, Tübingen University, Germany 4 Miralab, University of Geneva, Switzerland 5 GRAVIR/IMAG, INRIA Grenoble, France 6 Bonn University, Germany 7 Fraunhofer Institute for Computer Graphics, Darmstadt, Germany Abstract Interactive environments for dynamically deforming objects play an important role in surgery simulation and entertainment technology. These environments require fast deformable models and very efficient collision han- dling techniques. While collision detection for rigid bodies is well-investigated, collision detection for deformable objects introduces additional challenging problems. This paper focuses on these aspects and summarizes recent research in the area of deformable collision detection. Various approaches based on bounding volume hierarchies, distance fields, and spatial partitioning are discussed. Further, image-space techniques and stochastic methods are considered. Applications in cloth modeling and surgical simulation are presented. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism 1. Introduction For many years, collision detection has been of major inter- est in computer graphics. Numerous approaches have been investigated to detect interfering objects in applications such as robotics, computational biology, games, surgery simula- tion, and cloth simulation. While many of the original col- lision detection methods primarily address the problem of rigid bodies, recent approaches have started focusing on de- formable objects. Deformable collision detection is an essential compo- nent in interactive physically-based simulation and anima- tion which is a rapidly growing research area with an in- creasing number of interesting applications. Fig. 1 illustrates Figure 1: In interactive cloth simulation, efficient de- one of the major applications for deformable collision de- formable collision detection is a key component. tection, namely cloth simulation. In cloth simulation, ap- proaches to dynamically deforming clothes have to be com- bined with efficient algorithms that handle self-collisions of cloth as well as the interaction of cloth with animated rithms that are appropriate for deformable and animated ob- avatars. Such applications require collision detection algo- jects. °c The Eurographics Association and Blackwell Publishing 2005. Published by Blackwell Publishing, 9600 Garsington Road, Oxford OX4 2DQ, UK and 350 Main Street, Malden, MA 02148, USA. Teschner et al. / Collision Detection for Deformable Objects Surgery simulation illustrated in Fig. 2 is a second major considered. This is in contrast to rigid body collision de- application area for deformable collision detection. In such tection, where self-collisions are commonly neglected. De- environments, collisions among deformable organs have to pending on the applications, rigid body approaches can fur- be detected and resolved. Furthermore, collisions between ther be accelerated by only detecting one contact point. surgical tools and deformable tissue have to be processed. In Pre-processing: Efficient collision detection algorithms the case of topological changes due to cutting, self-collisions are accelerated by spatial data structures including of tissue can occur and have to be handled. Since interactive bounding-volume hierarchies, distance fields, or alternative behavior of surgery simulation environments is essential, ef- ways of spatial partitioning. Such object representations are ficient algorithms for deformable collision detection are re- commonly built in a pre-processing stage and perform very quired. well for rigid objects. However, in the case of deforming ob- jects these pre-processed data structures have to be updated frequently. Therefore, pre-processed data structures are less efficient for deforming objects and their practicality has to be examined very carefully. Collision Information: Collision detection algorithms for deformable objects have to consider, that a realistic col- lision response requires appropriate information. Therefore, it is not sufficient to just detect the interference of objects. Instead, precise information such as penetration depth of ob- jects is desired. Performance: In interactive applications, such as surgery simulation, games, and cloth simulation, the efficiency of Figure 2: Interactive environments for surgery simulation collision detection algorithms for deformable modeling en- are one of the major application areas for deformable colli- vironments is particularly important. Interactivity is a key sion detection. characteristics in these applications, resulting in high de- mands for computing efficiency of collision detection algo- In addition to cloth and surgery simulation, deformable rithms. collision detection methods are useful in environments with In this paper, we discuss collision detection approaches animated objects. Fig. 3 illustrates a sequence of two ani- that address the above-mentioned problems in order to meet mated objects. In this example, specific collision detection the requirements of animation and simulation environments algorithms for deformable objects can be used to detect in- with dynamically deforming objects. Although all discussed terferences of both objects at interactive rates. Furthermore, algorithms are appropriate for deformable objects, they are the intersection volume of both objects can be computed if not restricted to deformable objects, but also work with rigid their surfaces are closed. bodies. The remainder of the paper is organized as follows. Sec. 2 discusses bounding volume hierarchies. Special emphasis is placed on generating and updating the hierarchy. These as- pects have to be optimized for deforming objects which re- quire frequent hierarchy updates. In Sec. 3, stochastic meth- ods are presented. These approaches are appropriate for in- teractive simulation environments, since they allow for bal- Figure 3: A sequence of two animated objects: Santa and ancing accuracy and performance. Sec. 4 describes the usage Rabbit. Specific deformable collision detection algorithms of distance fields for deformable collision detection. These can be used to compute the intersection volume of both ob- approaches inherently provide information on the penetra- jects at interactive rates. The intersection volume is shown tion depth of colliding objects which is important to compute in red. a realistic collision response in physically-based simula- tions. Sec. 5 shows, how spatial subdivision can be employed for deformable collision detection. In these approaches, ef- If compared to collision detection approaches for rigid ficient data structures for representing 3D grids are im- bodies, there are various aspects that complicate the prob- portant. Sec. 6 discusses recent image-space approaches. lem for deformable objects. These methods commonly process projections of objects. Collisions and Self-collisions: In order to realistically Thus, they can be accelerated with graphics hardware. Sec. 7 simulate interactions between deformable objects, all con- presents applications in cloth modeling and surgery simula- tact points including those due to self-collisions have to be tion. Finally, Sec. 8 summarizes advantages and drawbacks °c The Eurographics Association and Blackwell Publishing 2005. Teschner et al. / Collision Detection for Deformable Objects of the presented algorithms for deformable collision detec- tion. traverse(A,B) if A and B do not overlap then 2. Bounding Volume Hierarchies return end if Bounding-volume hierarchies (BVHs) have proven to be if A and B are leaves then among the most efficient data structures for collision detec- return intersection of primitives enclosed by A and B tion. Mostly, they have been applied to rigid body collision else detection. for all children A[i] and B[j] do traverse(A[i],B[j]) Usually, a BVH is constructed for each object in a pre- end for processing step. The idea of BVHs is to partition the set end if of object primitives recursively