By Topic

Data reduction using cubic rational B-splines

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

2 Author(s)

A geometric method for fitting rational cubic B-spline curves to data representing smooth curves, such as intersection curves or silhouette lines, is presented. The algorithm relies on the convex hull and on the variation diminishing properties of Bezier/B-spline curves. It is shown that the algorithm delivers fitting curves that approximate the data with high accuracy even in cases with large tolerances. The ways in which the algorithm computes the end tangent magnitudes and inner control points, fits cubic curves through intermediate points, checks the approximate error, obtains optimal segmentation using binary search, and obtains appropriate final curve form are discussed.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:12 ,  Issue: 3 )