Abstract
Theorems and corresponding algorithms are presented which produce a parametric curve of a specified arc length subject to certain constraints. Extraneous inflection points are avoided. The problem is reduced to expressing the arc length as a function of a single variable. A general theorem is presented which gives conditions under which the arc length function is convex or strictly convex. It is also shown that initial parameters may be automatically chosen so that the secant method will produce a solution to this problem with performance comparable to the Newton-Raphson method. Earlier results of one of the authors for Bézier polynomial curves are strengthened and extended using these results.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
