Abstract
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, \ldots , p_m\}.\) In applications it can be useful for a polygonal curve to be 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
