Accurate and fast proximity queries between polyhedra using convex surface decomposition

Computer Graphics Forum

Volumn 20, Issue 3, 2001, Pages 500-511

  Ehmann, S A ^a   Liu, M C ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANIMATION; DATA STRUCTURES; FAULT TOLERANT COMPUTER SYSTEMS; VIRTUAL REALITY;

CONVEX SURFACE DECOMPOSITION; POLYHEDRA; PROXIMITY QUERIES;

COMPUTER SIMULATION;

EID: 0035801068     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00543     Document Type: Article

References (30)

1. BOXTREE: A hierarchical representation of surfaces in 3D
2. Convex decomposition of polyhedra and robustness
3. Modeling contacts in a physically based simulation
4. Enhancing GJK: Computing minimum and penetration distance between convex polyhedra
5. Convex partitions of polyhedra: A lower bound and worst-case optimal algorithm
6. Strategies for polyhedral surface decomposition: An experimental study
7. Triangulating a non-convex polytope
8. Decomposing the boundary of a nonconvex polyhedron
9. Determining the separation of preprocessed polyhedra - A unified approach
10. Accelerated proximity queries between convex polyhedra using multi-level Voronoi marching
11. Accelerated proximity queries between convex polyhedra using multi-level Voronoi marching
12. Accurate and fast proximity queries between polyhedra using convex surface decomposition
13. A fast procedure for computing the distance between objects in three-dimensional space
14. OBB-Tree: A hierarchical structure for rapid interference detection
15. H-walk: Hierarchical distance computation for moving convex bodies
16. Interactive collision detection
17. Efficient collision detection using bounding volume hierarchies of k-DOPs
18. Efficient collision detection for interactive 3D graphics and virtual environments
19. Collision detection between geometric models: A survey
20. Fast proximity queries with swept sphere volumes
21. Efficient algorithms for incremental distance computation
22. 3 and related problems
23. Impulse-based simulation of rigid bodies
24. V-clip: Fast and robust polyhedral collision detection
25. Efficient distance computation between non-convex objects
26. The extended convex differences tree (ECDT) representation for N-dimensional polyhedra
27. On the difficulty of triangulating three-dimensional non-convex polyhedra
28. Linear programming and convex hulls made easy