DEEP: Dual-space expansion for estimating penetration depth between convex polytopes

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2002, Pages 921-926

  Kim, Young J ^a   Lin, Ming C ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Incremental algorithm; Minkowski sums; Penetration depth

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ESTIMATION; ROBOTICS; THREE DIMENSIONAL COMPUTER GRAPHICS; VIRTUAL REALITY;

CONVEX POLYTOPES; INCREMENTAL ALGORITHM; MINKOWSKI SUMS; PENETRATION DEPTH;

COMPUTATIONAL GEOMETRY;

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

References (22)

1. Determining the minimum translational distance between two convex polyhedra
2. On finding narrow passages with probabilistic roadmap planners
3. Six degree-of-freedom haptic rendering using voxel sampling
4. 6-dof haptic display of polygonal models
5. Six-degree-of-freedom haptic display using localized contact computations
6. Dynamic simulation of autonomous legged locomotion
7. Collision detection and response for computer animation
8. Enhancing gjk: Computing minimum and penetration distance between convex polyhedra
9. Computing the intersection-depth of polyhedra
10. Proximity queries and penetration depth computation on 3d game objects
11. Collision detection between geometric models: A survey
12. Penetration depth of two convex polytopes in 3d
13. A fast procedure for computing the distance between objects in three-dimensional space
14. Fast penetration depth estimation for elastic bodies using deformed distance fields
15. Fast and simple geometric proximity queries using graphics hardware
16. Fast 3d geometric proximity queries between rigid and deformable models using graphics hardware acceleration
17. New distances for the separation and penetration of objects
18. Computing the width of a set
19. Accelerated proximity queries between convex polyhedra using multi-level voronoi marching
20. Efficient algorithms for incremental distance computation
21. A new linear algorithm for intersecting convex polygons
22. Fast penetration depth computation using rasterization hardware and hierarchical refinement