CONVEXITY-PRESERVING FAIRING

This paper develops a two-stage automatic algorithm for fairing C-2-co ntinuous cubic parametric B-splines under convexity, tolerance and end constraints. The first stage is a global procedure, yielding a C-2 cu bic B-spline which satisfies the local-convexity, local-tolerance and end constraints imposed by the designer. The second stage is a local f ine-fairing procedure employing an iterative knot-removal knot-reinser tion technique, which adopts the curvature-slope discontinuity as the fairness measure of a C-2 spline. This procedure preserves the convexi ty and end properties of the output of the first stage and, moreover, it embodies a global-tolerance constraint. The performance of the algo rithm is discussed for four data sets. Copyright (C) 1996 Elsevier Sci ence Ltd