Approximating NURBS curves by arc splines
Xunnian Yang
Abstract
Xunnian Yang
Abstract
It is desirable to approximate a smooth curve by arc splines with the fewest segments within a prescribed tolerance. We present an efficient algorithm for fitting planar smooth curves by arc splines. The main idea is that we construct the optimal arc spline by optimizing the interpolating biarc curve. The scheme consists of three steps: sampling the curve based on consecutive tangent deviation; construct the interpolating arc spline; and reduce the arc number to the minimum within a prescribed tolerance. The algorithm can control the approximating error efficiently and results in the fewest number of arc segments.
OpenAlex reports 7 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.
It is desirable to approximate a smooth curve by arc splines with the fewest segments within a prescribed tolerance. We present an efficient algorithm for fitting planar smooth curves by arc splines. The main idea is that we construct the optimal arc spline by optimizing the interpolating biarc curve. The scheme consists of three steps: sampling the curve based on consecutive tangent deviation; construct the interpolating arc spline; and reduce the arc number to the minimum within a prescribed tolerance. The algorithm can control the approximating error efficiently and results in the fewest number of arc segments.
Key concepts: Arc length, Arc (geometry), Spline (mechanical), Mathematics, Tangent, Algorithm, Curve fitting, Box spline