Distance computation between non-convex polyhedra at short range based on discrete Voronoi regions

Proceedings - Geometric Modeling and Processing 2000: Theory and Applications

Volumn , Issue , 2000, Pages 123-128

  Kawachi, K ^a   Suzuki, H ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY;

CONVEX POLYHEDRONS; DISTANCE COMPUTATION; INTERACTIVE RATES; MINIMUM DISTANCE; RANGE-BASED; VORONOI REGIONS;

GEOMETRY;

EID: 84969514471     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GMAP.2000.838244     Document Type: Conference Paper

References (10)

1. S. Cameron. Enhanceing GJK: Computing minimum penetration distances between convex polyhedra. In IEEE International Conference on Robotics and Automation, April 1997.
2. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Journal of Robotics and Automation, 4(2):193-203, April 1988.
3. S. Gottschalk, M. C. Lin, and D. Manocha. OBBTree: A hierarchical structure for rapid interference detection. In Computer Graphics Proceedings, Annual Conference Series, pages 171-180. ACM SIGGRAPH, 1996.
4. K. E. H. III, T. Culver, J. Keyser, M. Lin, and D. Manocha. Fast computation of generalized voronoi diagrams using graphics hardware. In Computer Graphics Proceedings, Annual Conference Series, pages 277-285. ACM SIGGRAPH, 1999.
5. E. Larsen, S. Gottschalk, M. Lin, and D. Manocha. Fast proximity queries with swept sphere volumes. Technical Report TR99-018, Department of Computer Science, University of North Carolina, Chapel Hill, 1999.
6. D. Lavender, A. Bowyer, J. Davenport, A. Wallis, and J. Woodwark. Voronoi diagrams of set-theoretic solid models. IEEE Computer Graphics and Applications, 12(5):69-77, September 1992.
7. M. C. Lin and J. F. Canny. Efficient algorithm for incremental distance computation. In IEEE Conference on Robotics and Automation, 1991.
8. B. Mirtich. V-Clip: Fast and robust polyhedral collision detection. Technical Report TR-97-05, MERL, July 1997.
9. J. Pitt-Francis and R. Featherstone. Automatic generation of sphere hierarchies from cad data. In Proceedings of IEEE International Conference on Robotics and Automation, 1998.
10. H. Samet. Spatial Data Structures: Quadtree, Octree and Other Hierarchial Methods. Addison Wesley, 1989.