Fairing Bicubic B-Spline Surfaces using Simulated Annealing
نویسندگان
چکیده
In this paper we present an automatic fairing algorithm for bicubic B-spline surfaces. The fairing method consists of a knot removal and knot reinsertion step which locally smoothes the surface. The simulated-annealing search strategy is used to search for the global minimum of the fairing measure.
منابع مشابه
Knot-removal surface fairing using search strategies
This paper presents two automatic fairing algorithms for parametric C-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-first-search and simulated-annealing are searching for the global minimum of the fairing measure. The best-first-search algorithm constructs only partial...
متن کاملShape Improvement of Surfaces
An automatic and local fairing algorithm for bicubic Bspline surfaces is proposed. A local fairness criterion selects the knot, where the spline surface has to be faired. A fairing step is than applied, which locally modi es the control net by a constrained least-squares approximation. It consists of increasing locally the smoothness of the surface from C to C. Some extensions of this method ar...
متن کاملFairing spline curves and surfaces by minimizing energy
New algorithms for the classical problem of fairing cubic spline curves and bicubic spline surfaces are presented. To fair a cubic spline curve or a bicubic spline surface with abnormal portions, the algorithms (automatically or interactively) identify thèbad' data points and replace them with new points produced by minimizing the strain energy of the new curve or surface. The proposed algorith...
متن کاملAPPROXIMATION OF 3D-PARAMETRIC FUNCTIONS BY BICUBIC B-SPLINE FUNCTIONS
In this paper we propose a method to approximate a parametric 3 D-function by bicubic B-spline functions
متن کاملLocal Energy Fairing of B{Spline Surfaces
An algorithm for local fairing of B-spline surfaces of arbitrary order is presented. This stepwise algorithm is based on the idea of changing only one control point in each iteration step. Which point has to be changed is determined by a ranking-list where all control points are sorted in regard to their corresponding values of a suitable chosen fairness criterion. The criterion is chosen in su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997