Approximation of discrete data by \(G^ 1\) arc splines (Q1195289)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation of discrete data by \(G^ 1\) arc splines |
scientific article; zbMATH DE number 69284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of discrete data by \(G^ 1\) arc splines |
scientific article; zbMATH DE number 69284 |
Statements
Approximation of discrete data by \(G^ 1\) arc splines (English)
0 references
26 October 1992
0 references
The authors develop algorithms for fitting a \(G^ 1\) arc spline to data so that the data points are within a specified distance of the arc spline. The \(G^ 1\) arc spline is made of biarcs that are joined in a \(G^ 1\) manner. These methods adaptively find the number of biarcs to use for the approximation. These methods do not use least squares and the solution of a linear system of equations but use standard formulae to estimate tangents from discrete data and standard algorithms to partition the discrete points for the approximation by biarcs.
0 references
discrete-data approximation
0 references
biarcs
0 references
locally optimal approximations
0 references
bisection algorithm
0 references
algorithms
0 references
fitting
0 references
arc spline
0 references
