A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies
From MaRDI portal
Publication:695915
DOI10.1016/j.cma.2012.04.006zbMath1253.90165MaRDI QIDQ695915
Gwen Johnson, Sigrid Leyendecker, Michael Ortiz
Publication date: 17 December 2012
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cma.2012.04.006
90C25: Convex programming
90C05: Linear programming
52A41: Convex functions and convex programs in convex geometry
70F35: Collision of rigid or pseudo-rigid bodies
Related Items
An Improved Contact Formulation for Impact Crack Simulations in a Laminated Glass Beam, A three-dimensional computational framework for impact fracture analysis of automotive laminated glass, Discontinuous variational time integrators for complex multibody collisions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unrestricted variables in linear programming
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- A compact formulation of an elastoplastic analysis problem
- Finite element analysis of nonsmooth contact
- SMB: Collision detection based on temporal coherence
- Force-stepping integrators in Lagrangian mechanics
- Discrete mechanics and optimal control for constrained systems
- A Note on Shadow Prices in Linear Programming
- Decomposition contact response (DCR) for explicit finite element dynamics
- A linear algorithm for determining the separation of convex polyhedra
- Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients
- The Computation of Shadow Prices in Linear Programming
- Numerical Optimization
- Linear Programming
- Nonsmooth Lagrangian Mechanics and Variational Collision Integrators
- Time-discretized variational formulation of non-smooth frictional contact
- LP-Based Algorithms for Detecting the Collision of Moving Objects
- Variational integrators for constrained dynamical systems
- Convex Analysis
- Marginal Values in Linear Programming
