Papers
Topics
Authors
Recent
Search
2000 character limit reached

Iterative Respacing of Polygonal Curves

Published 8 Sep 2021 in math.NA and cs.NA | (2109.03908v1)

Abstract: A $\textit{polygonal curve}$ 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 \textit{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.

Citations (1)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.