An automated curve fairing algorithm for cubic \(B\)-spline curves
CNC machining of curves requires the data representing the curve to be digitised. Such digitisation inevitably leads to errors. The reduction of these errors, the so-called fairing process, is the subject of the present paper. In a recent paper [Comput.-Aided Des. 28, No. 1, 59-66 (1996; Zbl 0844.65005)] the first author has introduced an extension of \textit{J. A. P. Kjellander}'s algorithm for fairing parametric \(B\)-splines [Smoothing of cubic parametric splines. Comput.-Aided Des. 15, No. 3, 175-179 (1983)], which can be applied to a wide range of two- and three-dimensional curves. The present paper describes developments towards a fully automated fairing process based on the new algorithm introduced in the mentioned paper. The key problems are to decide which points need to be faired and how many times to iterate.
scientific article; zbMATH DE number 1331073