Iterative Respacing of Polygonal Curves

arXiv2109.03908MaRDI QIDQ6377166FDOQ6377166

Authors: Marcella Manivel, Milena Silva, R. T. Thompson 

Publication date: 8 September 2021

Abstract: A $extitpolygonalcurve$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $p_0,p_1,ldots,p_m$. These curves may be obtained by sampling points from an oriented curve in $mathbb{R}^n$. In applications it can be useful for this sample of points to be close to extit{equilateral}, with equal distance between consecutive points. We present a computationally efficient method for respacing the points of a polygonal curve and show that iteration of this method converges to an equilateral polygonal curve.

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical approximation and computational geometry (primarily algorithms) (65D99) Computational methods for problems pertaining to convex and discrete geometry (52-08)

This page was built for publication: Iterative Respacing of Polygonal Curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6377166)