The paper proposes a fast fairing algorithm for curves and surfaces. It rst de nes a base algorithm for fairing curves, which is then extended to the surface case, where the isocurves of the surface are faired. The curve fairing process involves the discrete integration of a pseudo-arc-length parameterization of B-spline curves, with a blending and tting phase concluding the algorithm. In the c...

We propose a novel method for fitting planar B-spline curves to unorganized data points. In traditional methods, optimization of control points and foot points are performed in two very time-consuming steps in each iteration: 1) control points are updated by setting up and solving a linear system of equations; and 2) foot points are computed by projecting each data point onto a B-spline curve. ...

This article presents a new approach to build a kinetic elastic model of the coronar,, tree. Our purpose is to use this model in order to achieve spatio-temporal understanding of the cardiovascular dynamics. A semantic network was developed to make a static structural model. Then, to estimate the motion, the network uses a Kalman filtering device guided by the trajectory model. The vessel defor...

This paper presents a new method for robust data hiding in curves and highlights potential applications including digital fingerprinting of map document for trace and track purposes. We parameterize a curve using the B-spline model and add a spread spectrum sequence to the coordinates of the B-spline control points. In order to achieve robust fingerprint detection, we propose an iterative align...

Both the four-point and the uniform cubic B-spline refinement (i.e. subdivision) schemes double the number of vertices of a closed-loop polygonal curve P and respectively produce sequences of vertices fk and bk. The Js refinement proposed here produces vertices vk=(1–s)fk+sbk. Iterative applications of Js yield a family of curves parameterized by s. It includes the four-point curve (J0), the un...

We present a novel method for determining local multiresolution filters for B-spline subdivision curves of any order. Our approach is based on constraining the wavelet coefficients such that the coefficients at even vertices can be computed from the coefficients of neighboring odd vertices. This constraint leads to an initial set of decomposition filters. To increase the quality of these initia...

A new method using the cubic B-spline curves with nominal uniform knot set to parameterize the geometry is proposed to deal with shape optimization problems. In the method, the control points of the B-spline curves are set to be the design variables in the optimization scheme. A knot insertion algorithm has been introduced in order to keep the geometry unchanged whilst increasing the number of ...

Many papers describe techniques for evaluating spline curves and surfaces. While each paper provides some theoretical or empirical evidence with which to compare techniques, there exist few global comparisons Peters94]. Also, papers describing particular algorithms often provide few details, making implementation of the technique presented diicult or impossible. This report attempts to illumina...