Abstract

Curve fitting is commonly used in reverse engineering for the reconstruction of curves from measured points, and it is critically important to provide various kinds of curve-fitting algorithms to acquire curves that satisfy different constraint conditions. We divide the curve-fitting problem into unconstrained and constrained types. For the unconstrained type, three curve-fitting algorithms are investigated: general, smooth and extended curve fitting. The general curve fitting considers only the accuracy of the fitted curve; the smooth curve fitting can control both the accuracy and the fairness of the fitted curve, while the extended curve fitting can acquire a curve longer than the range of the measured points. For the constrained type, we propose three curve-fitting conditions: fixed end-points, closed curve and continuity to adjacent curves. Detailed discussion for each of the above cases is presented. Associated examples are also provided to illustrate the feasibility of the proposed algorithms.

Full Text
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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.