Nonlinear corner-cutting (Q1127000)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1185510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonlinear corner-cutting |
scientific article; zbMATH DE number 1185510 |
Statements
Nonlinear corner-cutting (English)
0 references
9 August 1998
0 references
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.
0 references
nonlinear corner-cutting
0 references
algorithm
0 references
cubic polynomial curves
0 references
Riemannian metric
0 references
geodesics
0 references
convergence
0 references
0.7936764359474182
0 references
0.7875542640686035
0 references
0.7748651504516602
0 references
