3D collision detection: A survey

Computers and Graphics (Pergamon)

Volumn 25, Issue 2, 2001, Pages 269-285

  Jimenez P ^a   Thomas, F ^a   Torras, C ^a  

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

Author keywords

Collision detection; Geometric algorithms; Interference tests; Languages and systems

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; HIERARCHICAL SYSTEMS; IMAGE ANALYSIS; IMAGE QUALITY; THREE DIMENSIONAL COMPUTER GRAPHICS;

GEOMETRIC ALGORITHMS; THREE-DIMENSIONAL COLLISION DETECTION;

COMPUTER VISION;

EID: 0035311963     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(00)00130-8     Document Type: Article

References (88)

1. Collision detection between geometric models: A survey
2. Evaluation of collision detection methods for virtual reality fly-throughs
3. Collision detection by four-dimensional intersection testing
4. A safe swept volume method for collision detection
5. Fast, three-dimensional, collision-free motion planning
6. Interference detection among solids and surfaces
7. A study of the clash detection problem in robotics
8. A collision detection algorithm based on velocity and distance bounds
9. A new algorithm for detecting the collision of moving objects
10. Computing the distance between general convex objects in three-dimensional space
11. Collision detection and response for computer animation
12. Collision detection for moving polyhedra
13. Collision detection: A geometric approach
14. Efficient collision detection for moving polyhedra
15. Interval methods for multi-point collisions between time-dependent curved surfaces
16. Geometric collisions for time-dependent parametric surfaces
17. A fast algorithm for incremental distance calculation
18. Determining the separation of preprocessed polyhedra - A unified approach
19. Convex decomposition of polyhedra and robustness
20. Convex partitions of polyhedra: A lower bound and a worst-case optimal algorithm
21. Decomposition algorithms in geometry
22. Triangulations
23. Decomposing the boundary of a nonconvex polytope
24. Strategies for polyhedral surface decomposition: An experimental study
25. Interference detection between non-convex polyhedra revisited with a practical aim
26. Evaluating signs of determinants using single-precision arithmetic
27. An approach to the movers problem that combines oriented matroid theory and algebraic geometry
28. Spherical-object representation and fast distance computation for robotic applications
29. Obstacle collision detection using best ellipsoid fit
30. Computing signed distances between free-form objects
31. A fast procedure for computing the distance between complex objects in three dimensional space
32. Efficient distance calculation using the spherically-extended polytope (s-tope) model
33. Determining the minimum translational distance between two convex polyhedra
34. Distance between boxes: Applications to collision detection and clipping
35. Fast contact determination in dynamic environments
36. I-COLLIDE: An interactive and exact collision detection system for large-scale environments
37. Incremental algorithms for collision detection between polygonal models
38. V-collide: Accelerated collision detection for vrml
39. V-clip: Fast and robust polyhedral collision detection
40. A comparison of two fast algorithms for computing the distance between convex polyhedra
41. Enhancing gjk: Computing minimum and penetration distances between convex polyhedra
42. A fast and robust gjk implementation for collision detection of convex objects
43. A direct optimization approach for obtaining the distance between convex polyhedra
44. A fast distance calculation between convex objects by optimization approach
45. Linear time algorithms for some separable quadratic programming problems
46. Computation of certain measures of proximity between convex polytopes: A complexity viewpoint
47. An adaptive spatial subdivision of the object space for fast collision detection of animating rigid bodies
48. Merging bsp trees yields polyhedral set operations
49. Collision detection and analysis in a physical based simulation
50. Efficient collision detection using bounding volume hierarchies of k-dops
51. Solving the collision detection problem
52. Interference detection and collision avoidance among three dimensional objects
53. Fast collision detection scheme by recursive decomposition of a manipulator workspace
54. Interactive collision detection
55. A new solid model hsm and its application to interference detection between moving objects
56. Set operations on polyhedra using binary space partitioning trees
57. A new representation for collision avoidance and detection
58. Very fast collision detection for practical motion planning. Part I: The spatial representation
59. Efficient distance computation between non-convex objects
60. Collision detection for animation using sphere-trees
61. Real-time collision detection and time-critical computing
62. A representation scheme for rapid 3-D collision detection
63. Rapid and accurate contact determination between spline models using shelltrees
64. Obb-tree: A hierarchical structure for rapid interference detection
65. Efficient collision detection of complex deformable models using aabb trees
66. Efficient and accurate interference detection for polynomial deformation
67. Collision and self-collision detection: Efficient and robust solutions for highly deformable surfaces
68. Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity
69. Efficient intersection tests for objects defined constructively
70. Back-face culling applied to collision detection of polyhedra
71. A search algorithm for motion planning with six degrees of freedom
72. Speeding up interference detection between polyhedra
73. Benefits of applicability constraints in decomposition-free interference detection between nonconvex polyhedral models
74. The use of awareness in collision prediction
75. Impulse-based dynamic simulation
76. Point location in fat subdivisions
77. Incremental algorithms for collision detection between solid models
78. Algorithms for reporting and counting geometric intersections
79. Stabbing and ray shooting in 3-space
80. Fast and accurate collision detection for haptic interaction using a three degree-of-freedom force-feedback device
81. Computing distances between Nurbs-defined convex objects