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

DOI10.1002/(SICI)1097-4563(199605)13:5%3C303::AID-ROB4%3E3.0.CO;2-UMaRDI QIDQ4348622zbMATH OpenOpenAlexFDO

Authors

Publication date 29 January 1998

Full work available at URL https://doi.org/10.1002/(sici)1097-4563(199605)13:5%3C303::aid-rob4%3E3.0.co;2-u

zbMATH Keywords

geometrical models of objectsrobotics

Mathematics Subject Classification ID

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

Recommendations

• Computation of a penetration measure between 3D convex polyhedral objects for collision detection
• scientific article; zbMATH DE number 1174699
• A fast and practical algorithm for generalized penetration depth computation
• Generalized penetration depth computation based on kinematical geometry

Cites work

• A linear algorithm for determining the separation of convex polyhedra
• Computing the extreme distances between two convex polygons
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• Linear Programming in Linear Time When the Dimension Is Fixed

Cited in

(3)

• Computation of a penetration measure between 3D convex polyhedral objects for collision detection
• A fast and practical algorithm for generalized penetration depth computation
• scientific article; zbMATH DE number 1174699 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4348622)