Fast distance queries with rectangular swept sphere volumes

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 4, Issue , 2000, Pages 3719-3726

  Larsen, Eric ^a   Gottschalk, Stefan ^a   Lin, Ming C ^a   Manocha, Dinesh ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE COMPUTATION ALGORITHMS; DISTANCE QUERIES; ROUNDING VOLUMES; SWEPT SPHERE VOLUMES; VIRTUAL PROTOTYPING;

ALGORITHMS; APPROXIMATION THEORY; BENCHMARKING; BOUNDARY CONDITIONS; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; DISTANCE MEASUREMENT; HIERARCHICAL SYSTEMS;

MOTION PLANNING;

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

References (27)

1. D. Baraff. Curved surfaces and coherence for nonpenetrating rigid body simulation. ACM Computer Graphics, 24(4):19-28, 1990.
2. G. Barequet, B. Chazelle, L. Guibas, J. Mitchell, and A. Tal. Boxtree: A hierarchical representation of surfaces in 3d. In Proc. of Eurographics'96, 1996.
3. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The r*-tree: An efficient and robust access method for points and rectangles. Proc. SIGMOD Conf. on Management of Data, pages 322-331, 1990.
4. S. Cameron. Approximation hierarchies and s-bounds. In Proceedings. Symposium on Solid Modeling Foundations and CAD/CAM Applications, pages 129-137, Austin, TX, 1991.
5. S. Cameron. Enhancing gjk: Computing minimum and penetration distance between convex polyhedra. Proceedings of International Conference on Robotics and Automation, pages 3112-3117, 1997.
6. B. Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. Proc. 30th Annu. IEEE Sympos. Found. Comput. Sci., pages 586-591, 1989.
7. J. Cohen, M. Lin, D. Manocha, and M. Ponamgi. I-collide: An interactive and exact collision detection system for large-scale environments. In Proc. of ACM Interactive 3D Graphics Conference, pages 189-196, 1995.
8. R.O. Duda and P.E. Hart. Pattern Classification and Scene Analysis. John Wiley and Sons, 1973.
9. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. In Proc. 9th Internat. Col-loq. Automata Lang. Program., volume 140 of Lecture Notes in Computer Science, pages 154-165. Springer-Verlag, 1982.
10. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi. A fast procedure for computing the distance between objects in three-dimensional space. IEEE J. Robotics and Automation, vol RA-4:193-203, 1988.
11. A. Gregory, M. Lin, S. Gottschalk, and R. Taylor. H-collide: A framework for fast and accurate collision detection for haptic interaction. In Proceedings of Virtual Reality Conference 1999, 1999.
12. S. Gottschalk, M. Lin, and D. Manocha. Obb-tree: A hierarchical structure for rapid interference detection. In Proc. of ACM Siggraph'96, pages 171-180, 1996.
13. D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. Proc. of 3rd Workshop on Algorithmic Foundations of Robotics, 1998.
14. M. Held, J.T. Klosowski, and J.S.B. Mitchell. Evaluation of collision detection methods for virtual reality fiy-throughs. In Canadian Conference on Computational Geometry, 1995.
15. M. Held, J. Klosowski, and Joseph S. B. Mitchell. Realtime collision detection for motion simulation within com plex environments. In Proc. ACM SIGGRAPH'96 Visual Proceedings, page 151, 1996.
16. G. Hamlin, R. Kelley, and J. Tornero. Efficient distance calculation using the spherically-extended polytope (s-tope) model. In Proceedings of the 1992 IEEE International Conference on Robotics and Automation, pages 2502-2507, 1992.
17. P. M. Hubbard. Interactive collision detection. In Proceedings of IEEE Symposium on Research Frontiers in Virtual Reality, October 1993.
18. D. Johnson and E. Cohen. A framework for efficient minimum distance computation. IEEE Conference on Robotics and Automation, pages 3678-3683, 1998.
19. J. Klosowski, M. Held, J.S.B. Mitchell, H. Sowizral, and K. Zikan. Efficient collision detection using bounding volume hierarchies of k-dops. IEEE Trans, on Visualization and Computer Graphics, 4(l):21-37, 1998.
20. S. Krishnan, A. Pattekar, M. Lin, and D. Manocha. Spherical shell: A higher order bounding volume for fast proximity queries. In Proc. of Third International Workshop on Algorithmic Foundations of Robotics, pages 122-136, 1998.
21. J.C. Latombe. Personal Communication, 1996.
22. M.C. Lin and John F. Canny. Efficient algorithms for incremental distance computation. In IEEE Conference on Robotics and Automation, pages 1008-1014, 1991.
23. 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, 1999.
24. Brian Mirtich. V-Clip: Fast and robust polyhedral collision detection. ACM Transactions on Graphics, 17(3):177-208, July 1998.
25. C. Pisula, K. Hoff, M. Lin, and D. Manocha. Randomized path planning for a rigid body based on hardware accelerated voronoi sampling. In Proc. of 4th International Workshop on Algorithmic Foundations of Robotics, 2000.
26. S. Quinlan. Efficient distance computation between non-convex objects. In Proceedings of International Conference on Robotics and Automation, pages 3324-3329,1994.
27. R. Seidel. Linear programming and convex hulls made easy. In Proc. 6th Ann. ACM Conf. on Computational Geometry, pages 211-215, Berkeley, California, 1990.