Penetration depth of two convex polytopes in 3D

zbMATH Open0977.68088MaRDI QIDQ2708236FDOQ2708236

Authors: Alexander Rabinovitch, Pankaj K. Agarwal, Leonidas Guibas, Sariel Har-Peled, Micha Sharir 

Publication date: 17 January 2002

Published in: Nordic Journal of Computing (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1617270
• Linear time approximation of 3D convex polytopes
• Approximate convex intersection detection with applications to width and Minkowski sums
• Overlap of convex polytopes under rigid motion
• Computation of a penetration measure between 3D convex polyhedral objects for collision detection

zbMATH Keywords

penetration depth

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (8)

• Solving the irregular strip packing problem via guided local search for overlap minimization
• An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
• Interactive generalized penetration depth computation for rigid and articulated models using object norm
• Minimizing the error of linear separators on linearly inseparable data
• Approximate convex intersection detection with applications to width and Minkowski sums
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• Removing Node Overlaps Using Multi-sphere Scheme
• An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry

This page was built for publication: Penetration depth of two convex polytopes in 3D

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