Nonlinear corner-cutting
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.
scientific article; zbMATH DE number 1185510