An automated curve fairing algorithm for cubic \(B\)-spline curves (Q1300784): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0377-0427(98)00209-x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2052480822 / rank | |||
Normal rank |
Latest revision as of 09:40, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An automated curve fairing algorithm for cubic \(B\)-spline curves |
scientific article |
Statements
An automated curve fairing algorithm for cubic \(B\)-spline curves (English)
0 references
13 November 2000
0 references
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.
0 references
curve fitting
0 references
curve fairing
0 references
cubic splines
0 references
curve fairing indicator
0 references
algorithm
0 references