Divide and Truncate: A Penetration and Inversion Free Framework for Coupled Multi-physics System
Open Access
- 19 July 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Abstract
We present Divide and Truncate (DAT), a unified framework for coupling multi-physics systems through penetration-free collision handling, including rigid bodies, volumetric soft bodies, thin shells, rods, and animated objects. By partitioning the ambient space into exclusive regions and truncating displacements to remain within them, DAT guarantees penetration-free contact resolution. Our Planar-DAT variant further refines this by restricting only motion toward nearby surfaces, leaving tangential movement unconstrained, which addresses the artificial damping and deadlock problems of previous works. The framework is material-agnostic: each object responds to contact without knowledge of the opposing body’s physics. Our method is also solver-agnostic; it can be integrated seamlessly with any iterative optimizer as a post-processing step, enabling robust simulation of complex multi-body interactions.Keywords
This publication has 23 references indexed in Scilit:
- A Safe and Fast Repulsion Method for GPU-based Cloth Self CollisionsACM Transactions on Graphics, 2020
- Incremental potential contactACM Transactions on Graphics, 2020
- Recent advances in trust region algorithmsMathematical Programming, 2015
- C2A: Controlled conservative advancement for continuous collision detection of polygonal models2009
- Interactive continuous collision detection for non-convex polyhedraThe Visual Computer, 2006
- A Robust Trust Region Method for Constrained Nonlinear Programming ProblemsSIAM Journal on Optimization, 1992
- Convergence properties of trust region methods for linear and convex constraintsMathematical Programming, 1990
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces1986
- Recent Developments in Algorithms and Software for Trust Region Methods1983