Iterative Respacing of Polygonal Curves

Abstract

A polygonal curve is a collection of m connected line segments specified as the linear interpolation of a list of points \p0, p1, …, pm\. These curves may be obtained by sampling points from an oriented curve in Rn. In applications it can be useful for this sample of points to be close to 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…