Estimate of minimum distance between convex polyhedra based on enclosed ellipsoids

IEEE International Conference on Intelligent Robots and Systems

Volumn 1, Issue , 2000, Pages 739-744

  Shiang, S P ^a   Liu, J S ^a   Chien, Y R ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL GEOMETRY; DISTANCE MEASUREMENT; ESTIMATION; NUMERICAL METHODS; ROBOTICS;

CONVEX POLYHEDRA; ELLIPSOIDS;

MOTION PLANNING;

EID: 0034446383     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Obstacle collision detection using best ellipsoid fit
2. A fast procedure for computing the distance between complex objects in three-dimensional space
3. A fast algorithm for incremental distance calculation
4. A framework for efficient minimum distance computations
5. Enhancing GJK: Computing minimum and penetration distances between convex polyherdra
6. Computing distances between NURBS-defined convex objects
7. Bound coherence for minimum distance computations
8. A proximity metric for continuum path planning
9. Determining the minimum translational distance between two convex polyhedra
10. Fast and accurate collision detection based on enclosed ellipsoids