Affiliation:
1. Department of Mechanical Engineering, University of Alaska Fairbanks, P.O. Box 755905, Fairbanks, AK 99775-5905
Abstract
A new method for formulation, solution, and sensitivity analysis of collision detection of convex objects in motion is presented. The collision detection problem is formulated as a parametric programming problem governed by the changes in the relative translation and relative rotation between the two objects considered. The two parameters together determine all the possible relative configurations between two moving convex objects. Therefore, solving this parametric problem allows for knowing the proximity information for all the possible configurations of the objects. We develop a two-step decomposition procedure to solve this parametric programming problem, and show that the solution is a convex function of the two parameters. This convexity feature enables an archive of the proximity information and sensitivity analysis for the collision detection problem.
Subject
Industrial and Manufacturing Engineering,Computer Graphics and Computer-Aided Design,Computer Science Applications,Software
Reference18 articles.
1. Gross Motion Planning—A Survey;ACM Comput. Surv.,1992
2. A Linear Programming Solution for Exact Collision Detection;ASME J. Comput. Inf. Sci. Eng.,2005
3. Lin, M., and Gottschalk, S., 1998, “Collision Detection Between Geometric Models: a Survey,” Proceedings of IMA Conference on Mathematics of Surfaces.
4. Cohen, J. D., Lin, M. C., Manocha, D., and Ponamgi, M. K., 1995, “I-COLLIDE: An Interactive and Exact Collision System for Large-Scale Environments,” Proceedings of ACM Interactive 3D Graphic Conference, Monterey, CA, pp. 189–196.
5. Gottschalk, S., Lin, M. C., and Manocha, D., 1996, “OBB-Tree: A Hierarchical Structure for Rapid Interference Detection,” Proceedings of SIGGRAPH, New Orleans, LA, pp. 171–180.