This paper presents an algorithm for extending B-spline curves and surfaces. Based on the unclamping algorithm for B-spline curves, we propose a new algorithm for extending B-spline curves that extrapolates using the recurrence property of the de Boor algorithm. This algorithm provides a nice extension, with maximum continuity, to the original curve segment. Moreover, it can be applied to the e...

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...

This paper studies the construction of hexagonal tight wavelet frame filter banks which contain three “idealized” high-pass filters. These three high-pass filters are suitable spatial shifts and frequency modulations of the associated low-pass filter, and they are used by Simoncelli and Adelson in [37] for the design of hexagonal filter banks and by Riemenschneider and Shen in [30, 31] for the ...

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...