Computation of penetration between smooth convex objects in three-dimensional space

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U" /><303::AID-ROB4>3.0.CO;2-U 10.1002/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-UzbMath0881.68129OpenAlexW2048402413MaRDI QIDQ4348622

No author found.

Publication date: 29 January 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-4563(199605)13:5<303::aid-rob4>3.0.co;2-u

zbMATH Keywords

roboticsgeometrical models of objects

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computing methodologies and applications (68U99) Kinematics of mechanisms and robots (70B15)

Cites Work

• A linear algorithm for determining the separation of convex polyhedra
• Computing the extreme distances between two convex polygons
• Linear Programming in Linear Time When the Dimension Is Fixed
• Unnamed Item

This page was built for publication: Computation of penetration between smooth convex objects in three-dimensional space