Fitting curve to planar digital data
Muhammad Sarfraz
Abstract
Muhammad Sarfraz
Abstract
An optimal curve fitting technique has been developed which is meant to automatically provide a fit to any ordered digital data in a plane. A more flexible class of rational cubic functions is the basis of this technique. This class of functions involves two control parameters, which help to produce an optimal curve fit. The curve technique has used various ideas for curve design. These ideas include end-point interpolation, intermediate point interpolation, detection of characteristic points, and parameterization. The final shape is achieved by stitching the generalized Bezier cubic pieces with C/sup 1/ smoothness.
OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An optimal curve fitting technique has been developed which is meant to automatically provide a fit to any ordered digital data in a plane. A more flexible class of rational cubic functions is the basis of this technique. This class of functions involves two control parameters, which help to produce an optimal curve fit. The curve technique has used various ideas for curve design. These ideas include end-point interpolation, intermediate point interpolation, detection of characteristic points, and parameterization. The final shape is achieved by stitching the generalized Bezier cubic pieces with C/sup 1/ smoothness.
Key concepts: Bézier curve, Curve fitting, Interpolation (computer graphics), Image stitching, Data point, Smoothness, Control point, Point (geometry)