(pdf 864 KB)
| This paper presents two automatic fairing algorithms for para- metric C2-continuous bi-cubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smooths the surface. Search strategies like best-¯rst-search and simulated-annealing are searching for the global minimum of the fairing measure. The best-¯rst-search algorithm constructs only partially a search tree and reduces signi¯cantly the complex- ity of a systematic search. Simulated annealing is a heuristic algorithm which needs a probability function and some further parameters as input. Both methods can satisfy end constraints and tolerances. Their performance is discussed for two numerical experiments. |
Return to
Stefanie Hahmann's homepage.