A fast and practical algorithm for generalized penetration depth computation
From MaRDI portal
Publication:3598950
zbMATH Open1354.65032MaRDI QIDQ3598950FDOQ3598950
Authors:
Publication date: 3 February 2009
Recommendations
- Interactive generalized penetration depth computation for rigid and articulated models using object norm
- Generalized penetration depth computation based on kinematical geometry
- scientific article; zbMATH DE number 1617270
- Computation of penetration between smooth convex objects in three-dimensional space
- Computation of a penetration measure between 3D convex polyhedral objects for collision detection
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (5)
- Monte Carlo calculation of deep penetration benchmark sensitivities
- Interactive generalized penetration depth computation for rigid and articulated models using object norm
- Subdivision schemes for the fair discretization of the spherical motion group
- Efficient distance computation in configuration space
- Generalized penetration depth computation based on kinematical geometry
This page was built for publication: A fast and practical algorithm for generalized penetration depth computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598950)
