A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies
Johnson G, Ortiz M, Leyendecker S (2012)
Publication Language: English
Publication Type: Journal article
Publication year: 2012
Journal
Publisher: Elsevier
Book Volume: 232-236
Pages Range: 49-67
DOI: 10.1016/j.cma.2012.04.006
Abstract
A subdifferentiable global contact detection algorithm, the Supporting Separating Hyperplane (SSH) algorithm, based on the signed distance between supporting hyperplanes of two convex sets is developed. It is shown that for polyhedral sets, the SSH algorithm may be evaluated as a linear program, and that this linear program is always feasible and always subdifferentiable with respect to the configuration variables, which define the constraint matrix. This is true regardless of whether the program is primal degenerate, dual degenerate, or both. The subgradient of the SSH linear program always lies in the normal cone of the closest admissible configuration to an inadmissible contact configuration. In particular if a contact surface exists, the subgradient of the SSH linear program is orthogonal to the contact surface, as required of contact reactions. This property of the algorithm is particularly important in modeling stiff systems, rigid bodies, and tightly packed or jammed systems. © 2012 Elsevier B.V.
Authors with CRIS profile
Involved external institutions
United States (USA) (US)How to cite
APA:
Johnson, G., Ortiz, M., & Leyendecker, S. (2012). A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies. Computer Methods in Applied Mechanics and Engineering, 232-236, 49-67. https://doi.org/10.1016/j.cma.2012.04.006
MLA:
Johnson, Gwendolyn, M. Ortiz, and Sigrid Leyendecker. "A linear programming-based algorithm for the signed separation of (non-smooth) convex bodies." Computer Methods in Applied Mechanics and Engineering 232-236 (2012): 49-67.
BibTeX: Download