Dynamic collision detection using space partitioning

Journal of Mechanical Design, Transactions of the ASME

Volumn 115, Issue 1, 1993, Pages 150-155

  Ganter, M A ^a   Isarankura, B P ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DEGREES OF FREEDOM (MECHANICS); DYNAMICS; MATHEMATICAL MODELS;

COLLISION DETECTION TIME; DYNAMIC COLLISION DETECTION; NONCONVEX POLYHEDRA; SPACE PARTITIONING;

MECHANISMS;

EID: 0027560576     PISSN: 10500472     EISSN: None     Source Type: Journal    
DOI: 10.1115/1.2919312     Document Type: Article

References (18)

1. Baumgart, B. G., 1974, “Geometric Modeling for Computer Vision,” Ph.D. Dissertation, Stanford University.
2. Boyse, J. W., 1979, “Interference Detection Among Solids and Surfaces,” Comm, of ACM, Vol. 22, No. 1.
3. Cameron, S. A., 1985, “A Study of the Clash Detection Problem in Robotics,” IEEE Int. Conf. on Robotics and Automation, St Louis, MO.
4. Cameron, S. A., 1989, “Efficient Intersection Tests for Objects Defined Constructively,” Intr. Journ. of Robotics Research, Vol. 8, No. 1.
5. Edelsbrunner, H., 1987, Algorithms in Combinatorial Geometry, E.A.T.C.S. Monographs, Springer-Verlang, Berlin, Germany.
6. Ganter, M. A., and Uicker, J. J., Jr., 1986, “Dynamic Collision Detection using Swept Solids,” ASME Journal of Mechanisms, Transmissions and Automation in Design, Vol. 108, No. 4.
7. Knuth, D. E., 1973, The Art of Computer Programming, Volume3 /Sorting and Searching, Addison-Wesley, Reading, MA.
8. Korein, J. U., 1984, “A Geometric Investigation of Reach,” Ph.D. Dissertation, Univ. of Pennsylvania. Univ. Microfilm #84-17323.
9. Mantyla, M., 1988, An Introduction to Solid Modeling, Computer Science Press, Rockville, MA.
10. Mantyla, M., and Tamminen, M., 1983, “Localized Set Operations for Solid Modeling,” ACM Computer Graphics, Vol. 17, No. 3.
11. Maruyama, K., 1972, “A Procedure to Determine Intersection Between Polyhedral Objects,” Int. Journ. of Comp, and Info. Science.
12. Mehlhorn, K., 1984, Data Structures and Algorithms 1: Sorting and Searching, E.A.T.C.S. Monographs, Springer-Verlag, Berlin, Germany.
13. Paul, R. P., 1981, Robot Manipulators: Mathematics, Programming and Control, MIT Press, Cambridge, MA.
14. Preparata, F. P., and Shamos, M. I., 1985, Computation Geometry An Introduction, Springer-Verlag, New York, NY.
15. Rogers, D. F., 1985, Procedural Elements for Computer Graphics, McGraw-Hill, New York, NY.
16. Sutherland, I. E., Spoull, R. F., and Schumacker, R. A., 1974, “A Characterization of Ten Hidden Surface Algorithms,” ACM Computing Surveys, Vol. 6, No. 1.
17. Thibault, W. C., and Naylor, B. F., 1987, “Set Operations on Polyhedra Using Binary Space Partitioning Tree,” ACM Computer Graphics, Vol. 21, No. 4.
18. Wang, W. P., and Wang, K. K., 1986, “Geometric Modeling for Swept Volume of Moving Solids,” IEEE Computer Graphics and Applications, Vol. 6, No. 12.