Nonlinear corner-cutting
type: Item
instance of: scholarly article
title: Nonlinear corner-cutting
zbMATH Open document ID: 0908.65008
DOI: 10.1023/A:1018940112654
author: Lyle Noakes
published in: Advances in Computational Mathematics
publication date: 1998-08-09T00:00:00Z
review text: The author describes a generalization of an algorithm due to \textit{J. M. Lane} and \textit{R. F. Riesenfeld} [IEEE Trans. Pattern Anal. Mach. Intell. PAMI-2, 35-46 (1980; Zbl 0436.68063)] for generating cubic polynomial curves. This generalization consists mainly in the fact that the usual Euclidean metric is replaced by a Riemannian metric, which means that straight lines are replaced by geodesics. The convergence of the developed algorithm is proved. It is shown that the limit curve is differentiable, and that this derivative satisfies a Lipschitz condition.
reviewed by: Guido Walz
Mathematics Subject Classification ID: 65D17
zbMATH DE Number: 1185510
zbMATH Keywords: nonlinear corner-cutting
zbMATH Keywords: algorithm
zbMATH Keywords: cubic polynomial curves
zbMATH Keywords: Riemannian metric
zbMATH Keywords: geodesics
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: a:1018940112654
OpenAlex ID: W243180070
description: scientific article; zbMATH DE number 1185510