Approximation of discrete data by \(G^ 1\) arc splines
type: Item
instance of: scholarly article
title: Approximation of discrete data by \(G^ 1\) arc splines
zbMATH Open document ID: 0755.65010
DOI: 10.1016/0010-4485(92)90047-E
author: D. S. Meek
author: D. J. Walton
published in: CAD. Computer-Aided Design
publication date: 1992-10-26T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65D10
Mathematics Subject Classification ID: 65D07
zbMATH DE Number: 69284
zbMATH Keywords: discrete-data approximation
zbMATH Keywords: biarcs
zbMATH Keywords: locally optimal approximations
zbMATH Keywords: bisection algorithm
zbMATH Keywords: algorithms
zbMATH Keywords: fitting
zbMATH Keywords: arc spline
reviewed by: Prem Narain
MaRDI profile type: Publication
full work available at URL: 0010-4485(92)90047-e
OpenAlex ID: W2064582867
description: scientific article; zbMATH DE number 69284