## Consistent penetration depth estimation for deformable collision response (2004)

### Cached

### Download Links

- [graphics.ethz.ch]
- [cg.informatik.uni-freiburg.de]
- [graphics.ethz.ch]
- [graphics.ethz.ch]
- DBLP

### Other Repositories/Bibliography

Citations: | 30 - 10 self |

### BibTeX

@MISC{Heidelberger04consistentpenetration,

author = {Bruno Heidelberger and Matthias Teschner and Richard Keiser and Matthias Müller and Markus Gross},

title = {Consistent penetration depth estimation for deformable collision response },

year = {2004}

}

### OpenURL

### Abstract

### Citations

278 | A fast procedure for computing the distance between complex objects in three-dimensional space
- Gilbert, Johnson, et al.
(Show Context)
Citation Context ...he collision. Exact penetration depth computations can be based on Minkowski sums [Cam86, Gui86] or hierarchical object presentations [Dob93], while approximative solutions based on the GJK algorithm =-=[Gil88]-=- and iteratively expanding polytopes have been presented in [Cam97, Ber01]. Further approaches are based on object space discretizations [Fis01], employ graphics hardware [Hof02, Sud04], or introduce ... |

231 | Collision detection and response for computer animation - Moore, Wilhelms - 1988 |

213 | Fast Contact Force Computation for Nonpenetrating Rigid Bodies - Baraff - 1994 |

183 | Analytical Methods for Dynamic Simulation of Non-Penetrating Rigid Bodies - Baraff - 1989 |

159 | Realistic animation of rigid bodies - Hahn - 1988 |

149 | A fast Voxel traversal algorithm for ray tracing
- Amanatides, Woo
(Show Context)
Citation Context ...implicit subdivision of R 3 as described in Sec. 3.2. In a first step, all intersecting edges are classified with respect to the hash grid cells by using an efficient voxel traversal technique, e. g. =-=[Ama87]-=-. In a second step, a simplified boxplane intersection test [Gre94] is performed to classify all mesh faces. If a face intersects with a hash grid cell, all associated edges of the cell are checked fo... |

128 | Constraints methods for flexible models - Platt, Barr - 1988 |

125 | Interactive Animation of Structured Deformable Objects - Desbrun, Schröder, et al. - 1999 |

116 | Enhancing GJK: Computing minimum and penetration distance between convex polyhedra - Cameron - 1997 |

110 | Optimized spatial hashing for collision detection of deformable objects
- Teschner, Heidelberger, et al.
- 2003
(Show Context)
Citation Context ...ions The first stage detects all object points that collide with any tetrahedral mesh in the scene. This volumetric collision detection is accomplished by the spatial hashing approach as presented in =-=[Tes03]-=-. Figure 3: The first stage classifies all mesh points either as colliding points (black) or non-colliding points (white). Spatial hashing implicitly subdivides R 3 into a hash grid composed of small ... |

102 |
An implicit formulation for precise contact modeling between exible solids
- Gascuel
- 1993
(Show Context)
Citation Context ...en used in simulations with deformable objects, cloth and rigid bodies [Moo88, McK90, Des99]. A third approach which directly computes contact surfaces of colliding deformable objects is presented in =-=[Gas93]-=-. Due to their computational efficiency, penaltybased approaches are very appropriate for interactive simulations of deformable objects. They can consider various elasto-mechanical object properties. ... |

93 | Issues in computing contact forces for non-penetrating rigid bodies - Baraff - 1993 |

81 | Coping with friction for non-penetrating rigid body simulation - BARAFF - 1991 |

80 | P.: Collision detection for deformable objects
- Teschner, Kimmerle, et al.
(Show Context)
Citation Context ...ell-investigated, the detection of collisions between deformable structures only recently gained increasing attention. A survey of current approaches to deformable collision detection can be found in =-=[Tes04b]-=-. Based on existing approaches to deformable modeling and collision detection, scenes consisting of several thousand volumetric elements can be simulated at interComputer Graphics Laboratory ETH Zuric... |

68 | Dynamic simulation of autonomous legged locomotion - McKenna, Zeltzer - 1990 |

64 | Computing convolutions by reciprocal search - Guibas, Seidel - 1986 |

59 | A versatile and robust model for geometrically complex deformable solids
- Teschner, Heidelberger, et al.
- 2004
(Show Context)
Citation Context ...tage, all colliding points have a consistent penetration depth and direction assigned (see Fig. 7).s4 Results We have integrated our method in a simulation environment for deformable objects based on =-=[Tes04a]-=-. Various experiments have been carried out to compare the quality and performance of the proposed method with the standard closest-feature approach. All test scenarios presented in this section have ... |

56 | Determining the minimum translational distance between two convex polyhedra - Cameron, Culley - 1986 |

41 | DiFi: Fast 3D Distance Field Computation Using Graphics Hardware - SUD, OTADUY, et al. - 2004 |

25 |
Deformed distance fields for simulation of non-penetrating flexible bodies,” in Eurographic workshop on Computer animation and simulation
- Fisher, Lin
- 2001
(Show Context)
Citation Context ...hile approximative solutions based on the GJK algorithm [Gil88] and iteratively expanding polytopes have been presented in [Cam97, Ber01]. Further approaches are based on object space discretizations =-=[Fis01]-=-, employ graphics hardware [Hof02, Sud04], or introduce incremental optimization steps [Kim04]. While existing approaches very efficiently compute the minimal penetration depth, they do notsaddress in... |

21 |
Detecting intersection of a rectangular solid and a convex polyhedron
- Greene
- 1994
(Show Context)
Citation Context ...ep, all intersecting edges are classified with respect to the hash grid cells by using an efficient voxel traversal technique, e. g. [Ama87]. In a second step, a simplified boxplane intersection test =-=[Gre94]-=- is performed to classify all mesh faces. If a face intersects with a hash grid cell, all associated edges of the cell are checked for intersection with the respective face. The actual intersection te... |

14 | Fast 3d geometric proximity queries between rigid and deformable models using graphics hardware acceleration - Hoff, Zaferakis, et al. - 2002 |

10 | An energy-based method for contact force computation - Faure - 1996 |

9 | Incremental penetration depth estimation between convex polytopes using dual-space expansion
- Kim, Lin, et al.
(Show Context)
Citation Context ...topes have been presented in [Cam97, Ber01]. Further approaches are based on object space discretizations [Fis01], employ graphics hardware [Hof02, Sud04], or introduce incremental optimization steps =-=[Kim04]-=-. While existing approaches very efficiently compute the minimal penetration depth, they do notsaddress inconsistency problems of the result in discrete-time simulations (see Figs. 1, 2). One solution... |

1 |
Computing the Intersection
- Dobkin, Hershberger, et al.
- 1993
(Show Context)
Citation Context ... as the minimum translation that one object undergoes to resolve the collision. Exact penetration depth computations can be based on Minkowski sums [Cam86, Gui86] or hierarchical object presentations =-=[Dob93]-=-, while approximative solutions based on the GJK algorithm [Gil88] and iteratively expanding polytopes have been presented in [Cam97, Ber01]. Further approaches are based on object space discretizatio... |