Computation of a penetration measure between 3D convex polyhedral objects for collision detection

Journal of Robotic Systems

Volumn 18, Issue 11, 2001, Pages 623-631

  Sridharan, K ^a,c   Keerthi, S S ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANIMATION; APPROXIMATION THEORY; COLLISION AVOIDANCE; THREE DIMENSIONAL COMPUTER GRAPHICS; VIRTUAL REALITY;

COLLISION DETECTION; CONVEX POLYHEDRAL OBJECTS;

COMPUTATIONAL COMPLEXITY;

EID: 0035503274     PISSN: 07412223     EISSN: None     Source Type: Journal    
DOI: 10.1002/rob.8101     Document Type: Article

References (18)

1. A proximity metric for continuum path planning
2. Determining the minimum translational distance between two convex polyhedra
3. Properties of penetration between general objects
4. Distance measures on intersecting objects and their applications
5. Computation of certain measures of proximity between convex polytopes: A complexity viewpoint
6. Growth distances: New measures for object separation and penetration
7. A incremental version of growth distance
8. A fast procedure for computing incremental growth distances
9. Properties of touching distances between planar objects
10. Linear programming in linear time when the dimension is fixed
11. Fast detection of polyhedral intersections
12. Fast detection of polyhedral intersection
13. Determining the separation of preprocessed polyhedra-A unified approach
14. A fast procedure for computing the distance between complex objects in three dimensional space
15. Robot path planning with penetration growth distance