A hierarchy of detail for fast collision detection

IEEE International Conference on Intelligent Robots and Systems

Volumn 1, Issue , 2000, Pages 745-750

  Martinez Salvador B ^a   del Pobil, A P ^a   Perez Francisco M ^a  

^a UNIVERSITAT JAUME I   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COLLISION AVOIDANCE; COMPUTATIONAL GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; HUMAN COMPUTER INTERACTION; MATHEMATICAL MODELS;

OBJECT REPRESENTATION; POLYHEDRAL APPROXIMATION;

MOTION PLANNING;

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

References (8)

1. Approximating polyhedral with spheres for time-critical collision detection
2. Very fast collision detection for practical motion planning. Part I: The spatial representation
3. Efficient distance computation between non convex objects
4. A generic algorithm for constructing hierarchical representations of geometric objects
5. Making service robots human-safe