Iterative Respacing of Polygonal Curves

09/08/2021
by   Marcella Manivel, et al.
0

A polygonal curve is a collection of m connected line segments specified as the linear interpolation of a list of points {p_0, p_1, …, p_m}. These curves may be obtained by sampling points from an oriented curve in ℝ^n. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2014

On the mathematic modeling of non-parametric curves based on cubic Bézier curves

Bézier splines are widely available in various systems with the curves a...
research
10/25/2017

Bézier curves that are close to elastica

We study the problem of identifying those cubic Bézier curves that are c...
research
02/16/2023

Detecting and approximating decision boundaries in low dimensional spaces

A method for detecting and approximating fault lines or surfaces, respec...
research
06/04/2011

Recovering Epipolar Geometry from Images of Smooth Surfaces

We present four methods for recovering the epipolar geometry from images...
research
11/28/2013

A local Gaussian filter and adaptive morphology as tools for completing partially discontinuous curves

This paper presents a method for extraction and analysis of curve--type ...
research
08/10/2021

Symmetries of discrete curves and point clouds via trigonometric interpolation

We formulate a simple algorithm for computing global exact symmetries of...
research
01/10/2023

A Continuation Method for Fitting a Bandlimited Curve to Points in the Plane

In this paper, we describe an algorithm for fitting an analytic and band...

Please sign up or login with your details

Forgot password? Click here to reset