Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Iterative Respacing of Polygonal Curves (2109.03908v1)

Published 8 Sep 2021 in math.NA and cs.NA

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

We haven't generated a summary for this paper yet.