An automatic algorithm for fairing B-spline curves of general order is presented. This work was motivated by a method of Farin and Sapidis about fairing planar cubic B-spline curves by subsequently removing and reinserting knots. Instead our new algorithm is based on the idea of subsequently changing one control point of a given B-spline curve so that the new curve minimizes the integral of the...

Measured bidirectional reflectance distribution function (BRDF) data have been used to represent complex interaction between lights and surface materials for photorealistic rendering. However, their massive size makes it hard to adopt them in practical rendering applications. In this paper, we propose an adaptive method for B-spline volume representation of measured BRDF data. It basically perf...

We propose a fast alternative to B-splines in image processing based on an approximate calculation using precomputed B-spline weights. During B-spline indirect transformation, these weights are efficiently retrieved in a nearest-neighbor fashion from a look-up table, greatly reducing overall computation time. Depending on the application, calculating a B-spline using a look-up table, called B-L...

in this paper , the quintic b-spline collocation scheme is employed to approximate numerical solution of the kdv-like rosenau equation . this scheme is based on the crank-nicolson formulation for time integration and quintic b-spline functions for space integration . the unconditional stability of the present method is proved using von- neumann approach . since we do not know the exact solution...

As a rule, an energy method is widely adopted for b-spline curve smoothing, but this method has the disadvantages such as massive calculation, computation complexity and low efficiency. Compared with the energy method, multi-resolution smoothing approaches nicely overcome these obstacles. Presently, some researches have been conducted on multi-resolution smoothing, but these efforts mainly aime...

This paper presents a mixed-integer quadratically constrained programming (MIQCP) formulation for B-spline constraints. The formulation can be used to obtain an exact MIQCP reformulation of any spline-constrained optimization problem. This reformulation allows practitioners to use a general-purpose MIQCP solver, instead of a special-purpose spline solver, when solving B-spline constrained probl...

T-spline has been recently developed to represent objects of arbitrary shapes using a smaller number of control points than the conventional NURBS or B-spline representations in computer aided design, computer graphics, and reverse engineering. However, existing methods for fitting a T-spline over a point cloud are slow. By shifting away from the conventional iterative fitand-refine paradigm, w...

Non-uniform B-spline dictionaries on a compact interval are discussed. For each given partition, dictionaries of B-spline functions for the corresponding spline space are constructed. It is asserted that, by dividing the given partition into subpartitions and joining together the bases for the concomitant subspaces, slightly redundant dictionaries of Bsplines functions are obtained. Such dictio...

This paper deals with polynomial Hermite splines. In the first part, we provide a simple and fast procedure to compute refinement mask of B-splines any order in case general scaling factor. Our is solely derived from reproduction properties satisfied by splines it does not require explicit construction or evaluation basis functions. The second part discusses factorization B-spline masks terms a...

B-spline curves and their rational generalizations (NURBS curves) play central role and are widely used in computer aided design today. A B-spline curve is uniquely defined by its degree, control points and knot values, while in terms of NURBS curves the weight vector has to be specified in addition. The modification of a curve is also an essential problem in CAD systems, hence numerous methods...