High-Order Continuous Geometrical Validity

Abstract

We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform over a piecewise-linear trajectory. Our algorithm uses a combination of adaptive Bézier refinement and bisection search to determine if, when, and where the Jacobian determinant of an element's polynomial geometric map becomes negative in the transition from one configuration to another. Unlike previous approaches, our method preserves its properties also when implemented using floating point arithmetic: This feature comes at a small additional runtime cost compared to existing inexact methods, making it a drop-in replacement for current validity tests, while providing superior robustness and generality. To prove the practical effectiveness of our algorithm, we demonstrate its use in a high-order Incremental Potential Contact (IPC) elastodynamic simulator, and we experimentally show that it prevents invalid, simulation-breaking configurations that would otherwise occur using inexact methods, without the need for manual parameter tuning.

References in corpus (8)

• A Recursive Algebraic Coloring Technique for Hardware-Efficient Symmetric Sparse Matrix-Vector Multiplication
• Codimensional Incremental Potential Contact
• A Large-Scale Comparison of Tetrahedral and Hexahedral Elements for Solving Elliptic PDEs with the Finite Element Method
• A Large Scale Benchmark and an Inclusion-Based Algorithm for Continuous Collision Detection
• Indirect predicates for geometric constructions
• GIPC: Fast and stable Gauss-Newton optimization of IPC barrier energy
• Differentiable solver for time-dependent deformation problems with contact
• A Cross-Platform Benchmark for Interval Computation Libraries