An Efficient Scattered Data Approximation Using Multilevel B-splines Based on Quasi-Interpolants

In this paper, we propose an efficient approximation algorithm using multilevel B-splines based on quasiinterpolants. Multilevel technique uses a coarse to fine hierarchy to generate a sequence of bicubic B-spline functions whose sum approaches the desired interpolation function. To compute a set of control points, quasi-interpolants gives a procedure for deriving local spline approximation methods where a B-spline coefficient only depends on data points taken from the neighborhood of the support corresponding the B-spline. Experimental results show that the smooth surface reconstruction with high accuracy can be obtained from a selected set of scattered or dense irregular samples.

Chebyshev–Bernstein

A simple matrix form for degree reduction of Bézier curves usin

PLEASE SCROLL DOWN FOR ARTICLE

This article maybe used for research, teaching and private study purposes. Any substantial or systematic reproduction, re-distribution, re-selling, loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae and drug doses should be independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings, demand or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with o

best weighted Euclidean

www.elsevier.com/locate/cagd Constrained polynomial degree reduction in the L2-norm equal