scientific article; zbMATH DE number 1617270

MaRDI QIDQ2721992zbMATH OpenFDO

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

Publication date 11 July 2001

Mathematics Subject Classification ID

Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

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

Cited in

(6)

• Computing two penetration measures for curved 2D objects
• Computation of a penetration measure between 3D convex polyhedral objects for collision detection
• Approximate convex intersection detection with applications to width and Minkowski sums
• Penetration depth of two convex polytopes in 3D
• A fast and practical algorithm for generalized penetration depth computation
• Generalized penetration depth computation based on kinematical geometry

This page was built for publication:

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