By Topic

Geometric constraint solving for parametric conics

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)
Bi Chen ; Al Inst., Zhejiang Univ., China ; Min Tang ; Jinxiang Dong

Geometric constraint solving is a rapidly developing field, with applications in areas such as kinematics, molecular modeling, surveying, and geometric theorem proving. This paper has incorporated conic arcs into a geometric constraint solver and describes how to construct conic blending arcs from constraints using a rational parametric representation - rational quadratic Bezier which combines the separate cases of blending edges. There are some possible constraints: traverse a fixed point, or tangency to or distance from a line. Here a uniform rational Bezier representation has been developed first, then the paper presents two methods to solve tangency to or distance from a line.

Published in:

Computer Supported Cooperative Work in Design, 2002. The 7th International Conference on

Date of Conference: