By Topic

An efficient three-point arc 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
$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

1 Author(s)
Galton, I. ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA

For many applications a 2-D circular arc can be conveniently specified by three points that lie on the arc. Since the radius of curvature grows without bound as the three points become collinear, any practical algorithm must avoid calculating the arc's radius or functions of the radius. An algorithm that achieves this objective is presented. It is very efficient because it uses exclusively integer arithmetic and requires only addition, subtraction, comparison, and branch operation in the inner loop.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:9 ,  Issue: 6 )