摘要
Resorting to cubic spline function instead of parametric spline representation, an explicit fairness indicator and an efficient fairing algorithm for 2D curves are presented. The input point sequence is firstly partitioned into several overlapped function segments. For each segment, a cubic spline function is used as the representation tool which entails a polyline approximation of curvature plot. Based on the extrinsic relationship between the polyline and the positions of data points, a coarse-to-fine faring method is proposed which efficiently identifies and eliminates the unnecessary inflection points. Our algorithm generates the best results to date, which is validated by numerous practical examples.
Resorting to cubic spline function instead of parametric spline representation, an explicit fairness indicator and an efficient fairing algorithm for 2D curves are presented. The input point sequence is firstly partitioned into several overlapped function segments. For each segment, a cubic spline function is used as the representation tool which entails a polyline approximation of curvature plot. Based on the extrinsic relationship between the polyline and the positions of data points, a coarse-to-fine faring method is proposed which efficiently identifies and eliminates the unnecessary inflection points. Our algorithm generates the best results to date, which is validated by numerous practical examples.
基金
Supported by the National Natural Science Foundation of China(61222206,11526212)
