Abstract
An algorithm of B-spline curve approximate merging of two adjacent B-spline curves is presented in this paper. In this algorithm, the approximation error between two curves is computed using norm which is known as best least square approximation. We develop a method based on weighed and constrained least squares approximation, which adds a weight function in object function to reduce error of merging. The knot insertion algorithm is also developed to meet the error tolerance.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
