By Topic

Efficient collision detection using fast distance-calculation algorithms for convex and non-convex objects

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sato, Y. ; Fujitsu Labs. Ltd., Kawasaki, Japan ; Hirata, M. ; Maruyama, T. ; Arita, Y.

This paper describes a practical and efficient collision detection algorithm for non-convex objects in R3. The algorithm is based on two other distance calculation algorithms: one is for convex polyhedra and the other is for non-convex polyhedra. The applied algorithm is switched between convex and non-convex, according to the distance between the objects. The closest points between the objects are followed continuously in time and can be calculated by searching for the nearest neighbors of the previous closest points. This feature greatly improves the distance calculation speed and makes it possible, for instance, to pick and move an object with a mouse, interactively getting the distance between the object and other objects. The algorithm is implemented in C++, and embedded in a series of C++ class libraries for a graphic simulation system-which the authors have named ContactScope

Published in:

Robotics and Automation, 1996. Proceedings., 1996 IEEE International Conference on  (Volume:1 )

Date of Conference:

22-28 Apr 1996