By Topic

The tangency problem of variable radius circle to lines, circles and ellipses

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)
Ching-Shoei Chiang ; Dept. of Comput. & Inf. Sci., Soochow Univ., Taipei, Taiwan ; Hsien-Lin Liu

Variable-radius circles are common constructs in planar constraint solving and are usually not handled completely by algebraic constraint solvers, especially when the ellipse is the geometric entities. Consider the cluster merge problems, there are two constraints between the variable radius circle and each of the rigid geometric objects. It can be handled when the rigid geometric objects concerning point, ray (oriented line) and cycle (oriented circle). The cluster merge problem become more complex when the ellipse added into the geometric elements. This paper proposed two methods to find the variable radius circle tangent to three geometric objects, including line, circle and ellipse. These methods construct a system of equation from the tangency properties between geometric entities and variable radius circle, consider the geometric entities is oriented (the 2nd method) or not oriented (the 1st method). For all cases, an upper bound of the number of variable radius circle is calculated.

Published in:

Ninth International Conference on Computer Aided Design and Computer Graphics (CAD-CG'05)

Date of Conference:

7-10 Dec. 2005