An Improved Method of Nearly Arc-Length Parameterized Quintic-Spline Interpolation
Bai Hong-wu
Abstract
Bai Hong-wu
Abstract
In Wang etc.’s paper [1], a method of nearly arc-length parameterized quintic-spline interpolation was given, but there were errors in the paper, and what is more important is that the method is not always feasible. The reason for this is that in the method Newton’s iteration algorithm was used to solve a quartic equation, but nothing can guarantee the existence of reasonable roots for that equation. Because of these reasons, we point out some errors in that paper and give a new method of nearly arc-length parameterized quintic-spline interpolation that is always feasible based on that method.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In Wang etc.’s paper [1], a method of nearly arc-length parameterized quintic-spline interpolation was given, but there were errors in the paper, and what is more important is that the method is not always feasible. The reason for this is that in the method Newton’s iteration algorithm was used to solve a quartic equation, but nothing can guarantee the existence of reasonable roots for that equation. Because of these reasons, we point out some errors in that paper and give a new method of nearly arc-length parameterized quintic-spline interpolation that is always feasible based on that method.
Key concepts: Quintic function, Parameterized complexity, Spline interpolation, Arc (geometry), Mathematics, Interpolation (computer graphics), Quartic function, Arc length