By Topic

Speeding up interference detection between polyhedra

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
$33 $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)
P. Jimenez ; Inst. de Cibernetica, CSIC, Barcelona, Spain ; C. Torras

A classical paradigm for interference detection between polyhedra consists in testing all edges of one polyhedron against all faces of the other one for intersection. If the relative orientation of the polyhedra is fixed, only certain edge-face pairs can intersect first, when the polyhedra come into contact. These candidate pairs are efficiently determined using a representation which the authors call spherical face orientation graph. By applying the interference test to candidates only, the computational effort is significantly reduced, as shown by experimental results with convex polyhedra. In the non-convex case, the strategy is conservative, but it still leads to savings

Published in:

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

Date of Conference:

22-28 Apr 1996