Approximation of discrete data by \(G^ 1\) arc splines (Q1195289): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Prem Narain / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Prem Narain / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0010-4485(92)90047-e / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064582867 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:55, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation of discrete data by \(G^ 1\) arc splines |
scientific article |
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
