By Topic

A symbolic-numeric silhouette algorithm

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

3 Author(s)
H. Hirukawa ; Electrotech. Lab., Tsukuba, Japan ; B. Mourrain ; Y. Papegay

The silhouette algorithm developed by Canny (1988, 1993) is a general motion planning algorithm which is known to have the best complexity of all of the general and complete algorithms. The authors present a symbolic-numeric version of the algorithm. This version does not require the symbolic computation of the determinants of resultant matrices, and can work on floating point arithmetic. Though its combinatorial complexity remains the same, but its algebraic complexity has been improved significantly which is very important towards its implementation. Several numerical examples are also presented

Published in:

Intelligent Robots and Systems, 2000. (IROS 2000). Proceedings. 2000 IEEE/RSJ International Conference on  (Volume:3 )

Date of Conference: