An orientation-based pruning tool to speed up contact determination between translating polyhedral models

International Journal of Robotics Research

Volumn 20, Issue 6, 2001, Pages 466-483

  Jimenez P ^a   Torras, C ^a  

^a INSTITUT DE ROBÒTICA I INFORMÀTICA INDUSTRIAL CSIC UPC   (Spain)

Author keywords

Collision detection; Interference checking; Multiple contacts; Nonconvex polyhedra; Sphere of orientations

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER AIDED DESIGN; COMPUTER AIDED MANUFACTURING; COMPUTER SIMULATION; GRAPH THEORY; MOTION PLANNING; ROBOTS;

COLLISION DETECTION; INTERFERENCE CHECKING; MULTIPLE CONTACTS; NONCONVEX POLYHEDRA; SPHERE OF ORIENTATIONS;

COLLISION AVOIDANCE;

EID: 0035355467     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/02783640122067499     Document Type: Article

References (35)

1. Partitioning arrangements of lines: II. Applications
2. Red-blue intersection detection algorithm, with applications to motion planning and collision detection
3. Reporting red-blue intersections between connected sets of line segments
4. Interference detection among solids and surfaces
5. Efficient bounds in constructive solid geometry
6. I-collide: An interactive and exact collision detection system for large-scale environments
7. A search algorithm for motion planning with six degrees of freedom
8. A fast procedure for computing the distance between complex objects in three dimensional space
9. Obb-tree: A hierarchical structure for rapid interference detection
10. Efficient distance calculation using the spherically-extended polytope (s-tope) model
11. Extended Gaussian images
12. Interactive collision detection
13. Collision detection for interactive graphics applications
14. V-collide: Accelerated collision detection for vrml
15. Static and dynamic interference detection between nonconvex polyhedra
16. Collision detection: A survey
17. Speeding up interface detection between polyhedra
18. Benefits of applicability constraints in decomposition-free interference detection between nonconvex polyhedral models
19. An efficient algorithm for searching implicit and/or graphs with circles
20. Spatialized normal cone hierarchies
21. Efficient collision detection using bounding volume hierarchies of k-dops
22. A fast algorithm for incremental distance calculation
23. Collision detection between geometric models: A survey
24. Incremental algorithms for collision detection between polygonal models
25. Set operations on polyhedra using binary space partitioning trees
26. Inferring feasible assemblies from spatial constraints
27. Interference detection between non-convex polyhedra revisited with a practical aim
28. Efficient collision detection of complex deformable models using aabb trees
29. Back-face culling applied to collision detection of polyhedra