A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies
DOI10.1016/J.CMA.2012.04.006zbMATH Open1253.90165OpenAlexW2158013545MaRDI QIDQ695915FDOQ695915
Authors: Gwen Johnson, M. Ortiz, Sigrid Leyendecker
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
Recommendations
- Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction
- Solving discretized contact problems using linear programming
- A contact detection algorithm for superellipsoids based on the common-normal concept
- A linear algorithm for determining the separation of convex polyhedra
- Contact mechanical algorithms
Convex programming (90C25) Linear programming (90C05) Convex functions and convex programs in convex geometry (52A41) Collision of rigid or pseudo-rigid bodies (70F35)
Cites Work
- Numerical Optimization
- Title not available (Why is that?)
- Convex Analysis
- Discrete mechanics and optimal control for constrained systems
- Nonsmooth Lagrangian Mechanics and Variational Collision Integrators
- Variational integrators for constrained dynamical systems
- Finite element analysis of nonsmooth contact
- A linear algorithm for determining the separation of convex polyhedra
- Time-discretized variational formulation of non-smooth frictional contact
- Linear Programming
- Linear programming and its application.
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
- Decomposition contact response (DCR) for explicit finite element dynamics
- A compact formulation of an elastoplastic analysis problem
- A Note on Shadow Prices in Linear Programming
- SMB: Collision detection based on temporal coherence
- Force-stepping integrators in Lagrangian mechanics
- Title not available (Why is that?)
- Postoptimal analysis of a linear program under simultaneous changes in matrix coefficients
- The Computation of Shadow Prices in Linear Programming
- LP-Based Algorithms for Detecting the Collision of Moving Objects
- Marginal Values in Linear Programming
- Unrestricted variables in linear programming
Cited In (3)
Uses Software
This page was built for publication: A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695915)