Implicit convex-hull distance of finite-screw-swept volumes

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2002, Pages 847-854

  Xavier, Patrick G ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; FINITE VOLUME METHOD; MOTION PLANNING;

COLLISION DETECTION; DISTANCE COMPUTATION; FINITE SCREW MOTION;

ROBOTICS;

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

References (34)

1. A feasible apprach to automatic planning of collision-free robot motions
2. Curved surfaces and coherence for nonpenetrating rigid body simulation
3. Collision detection by 4D intersection testing
4. Dealing with geometric complexity in motion planning
5. Enhancing GJK: Computing minimum and penetration distances between convex polyhedra
6. Collision detection for moving polyhedra
7. A fast algorithm for incremental distance calculation
8. I-collide: An interactive and exact collision detection system for large-scale environments
9. Accelerated proximity queries between convex polyhedra using multi-level voroni marching
10. Accurate and fast proximity queries between polyhedra using convex surface decomposition
11. Hierarchical object models for efficient anti-collision algorithms
12. On visible surface generation by a priori tree structures.
13. Efficient generation of object hierarchies from 3d scenes
14. Computing the distance between general convex objects in three-dimensional space
15. A fast procedure for computing the distance between complex objects in three-dimensional space
16. OBB-tree: A hierarchical structure for rapid interference detection
17. H-walk: Hierarchical distance computation for moving convex bodies
18. Octtrees and their use in representing three-dimensional objects
19. Efficient collision detection using bounding volume hierarchies of k-dops
20. Fast proximity queries with swept sphere volumes
21. Fast contact determination in dynamic environments
22. Collision detection between geometric models: A survey
23. V-clip: Fast and robust polyhedral collision detection
24. Impulse-based simulation of rigid bodies
25. Interactive solid geometry via partitioning trees
26. The Gilbert-Johnson-Keerthi distance algorithm: A fast version for incremental motions
27. Efficient distance computation between non-convex objects
28. Efficient collision detection using fast distance calculation algorithms for convex and non-convex objects
29. Efficient collision detection for moving polyhedra
30. A fast and robust GJK implementation for collision detection of convex objects
31. BRep index, a multi-dimensional space partitioning tree
32. A generic algorithm for constructing hierarchical representations of geometric objects
33. Fast swept-volume distance for robust collision detection