Name
Abstract | ||
|---|---|---|
We present a novel multi-resolution algorithm for simulation of complex cloth-like deforming meshes. Our algorithm precomputes a multi-resolution hierarchy by using a combination of 'chromatic decomposition'(1) and polygonal simplification of the underlying mesh. At runtime we selectively refine or coarsen the mesh based on the collision proximity of the mesh primitives with non-adjacent primitives. Our algorithm handles all kind of contacts, including self collisions among mesh primitives. The multi-resolution hierarchy is used to compute simplification of contact manifolds and to accelerate collision detection and response computations. We have implemented our algorithm on a high-end PC and applied it to complex simulations with tens of thousands of polygons. In practice, our algorithm is able to achieve interactive performance, while maintaining good visual fidelity. Copyright (c) 2005 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1002/cav.106 | COMPUTER ANIMATION AND VIRTUAL WORLDS |
Keywords | Field | DocType |
chromatic decomposition, collision detection, multi-resolution simulation, collision response | Polygon,Collision detection,Polygon mesh,Simulation,Computer science,Collision,Hierarchy,Collision response,Manifold,Computation | Journal |
Volume | Issue | ISSN |
16 | 3-4 | 1546-4261 |
Citations | PageRank | References |
2 | 0.38 | 30 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nitin Jain | 1 | 2 | 0.38 |
| Ilknur Kabul | 2 | 144 | 7.54 |
| Naga K. Govindaraju | 3 | 3331 | 234.15 |
| Dinesh Manocha | 4 | 9551 | 787.40 |
| Ming Lin | 5 | 7046 | 525.99 |