Abstract
Robust handling of collisions on non-oriented deformable surfaces requires advanced methods for recovering intersecting surfaces. We present a novel method that resolves intersections between two intersecting surface regions by inducing relative displacements which minimize the length of the intersection contour between them. This method, which does not rely on intersection regions, has a broader application field than existing methods, and its implementation is also much simpler, allowing integration into most existing collision response schemes. We demonstrate the efficiency of this method through examples in the context of cloth simulation.
Supplemental Material
- Baraff D., Witkin A., 1998, Large Steps in Cloth Simulation, Proceedings of ACM SIGGRAPH 98, ACM Press, 32, p. 106--117. Google Scholar
Digital Library
- Baraff D., Witkin A., Kass M., 2003, Untangling Cloth, ACM Transactions on Graphics (ACM SIGGRAPH 2003), 22, pp 862--870. Google Scholar
Digital Library
- Bridson R., Fedkiw R., Anderson J., 2002. Robust treatment of collisions, contact, and friction for cloth animation, ACM Transactions on Graphics (ACM SIGGRAPH 2002), pp 594--603. Google Scholar
Digital Library
- Bridson R., Marino S., Fedkiw R., 2003, Simulation of Clothing with Folds and Wrinkles, Eurographics-SIGGRAPH Symposium on Computer Animation, pp 28--36. Google Scholar
Digital Library
- Etzmuss O., Gross J., Strasser W., 2003, Deriving a Particle System from Continuum Mechanics for the Animation of Deformable Objects, IEEE Transaction on Visualization and Computer Graphics, 9(4), pp 538--550. Google Scholar
Digital Library
- Govindaraju N. K., Knott D., Jain N., Kabul I., Tamstorf R., Gayle R., Lin M., Manocha D, 2005, Interactive Collision Detection between Deformable Models using Chromatic Decomposition, ACM Transactions on Graphics (ACM SIGGRAPH 2005), 24(3), pp 991--999. Google Scholar
Digital Library
- Hauth M., Etzmuss O., Strasser W., 2002, Analysis of Numerical Methods for the Simulation of Deformable Models, The Visual Computer, 19(7-8), pp 581--600.Google Scholar
Digital Library
- Klosowski J. T., Held M., Mitchell J. S. B., 1997, Efficient Collision Detection Using Bounding Volume Hierarchies of k-dops, IEEE transactions on Visualization and Computer Graphics, 4(1), pp 21--36. Google Scholar
Digital Library
- Teschner M., Kimmerle S., Heidelberger B., Zachmann G., Raghupathi L., Fuhrmann A., Cani M. P., Faure F., Magnenat-Thalmann N., Strasser W., Volino P., 2005, Collision Detection for Deformable Objects. Computer Graphics Forum, 24(1), pp 61--81.Google Scholar
Cross Ref
- Volino P., Magnenat Thalmann N., 1994, Efficient Self-Collision Detection on Smoothly Discretised Surface Animations using Geometrical Shape Regularity, Computer Graphics Forum (Proceedings of EuroGraphics 1994), 13(3), pp 155--166.Google Scholar
- Volino P., Courchesne M., Magnenat-Thalmann N., 1995, Versatile and Efficient Techniques for Simulating Cloth and Other Deformable Objects, Proceedings of ACM SIGGRAPH 95, ACM Press, pp 137--144. Google Scholar
Digital Library
- Volino P., Magnenat-Thalmann N., 2000, Accurate Collision response on polygonal Meshes, Computer Animation 2000, IEEE Computer Society, pp 154--163. Google Scholar
Digital Library
- Volino P., Magnenat-Thalmann N., 2005, Accurate Garment Prototyping and Simulation, Computer-Aided Design and Applications, CAD Solutions, 2(5), pp 645--654.Google Scholar
Index Terms
Resolving surface collisions through intersection contour minimization
Recommendations
Resolving surface collisions through intersection contour minimization
SIGGRAPH '06: ACM SIGGRAPH 2006 PapersRobust handling of collisions on non-oriented deformable surfaces requires advanced methods for recovering intersecting surfaces. We present a novel method that resolves intersections between two intersecting surface regions by inducing relative ...
Linear perturbation methods for topologically consistent representations of free-form surface intersections
By applying displacement maps to slightly perturb two free-form surfaces, one can ensure exact agreement between the images in R3 of parameter-domain approximations to their curve of intersection. Thus, at the expense of slightly altering the surfaces ...
HelSweeper: Screw-sweeps of canal surfaces
A tube is a solid bounded by the union of a one-parameter family of circles that may be decomposed into canal-surfaces and planar disks or annuli. A screw-sweep is the region swept by a shape during a screw motion. HelSweeper computes the boundary of a ...





Comments