By Topic

Benefits of applicability constraints in decomposition-free interference detection between nonconvex polyhedral models

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

2 Author(s)
Jimenez, P. ; Inst. de Robotica i Inf. Ind., CSIC, Barcelona, Spain ; Torras, C.

Nonconvex polyhedral models of workpieces or robot parts can be directly tested for interference, without resorting to a previous decomposition into convex entities. We show that this interference detection, based on the elemental edge face intersection test, can be performed efficiently: a strategy based on applicability constraints reduces drastically the set of edge - face pairings that have to be considered for intersection. This is accomplished by using an appropriate representation, the spherical face orientation graph, developed by the authors, as well as feature pairing algorithms based on the plane sweep paradigm that have been adapted to work on that representation. Furthermore, the benefits of such a strategy extend to the computation of a lower distance bound between the polyhedra, both lowering the computational effort and improving the quality of the bound. Experimental results confirm the expected advantages of this strategy

Published in:

Robotics and Automation, 1999. Proceedings. 1999 IEEE International Conference on  (Volume:3 )

Date of Conference: