Constructing iterative non-uniform B-spline curve and surface to fit data points

In this paper, based on the idea of profit and loss modification, we presentthe iterative non-uniform B-spline curve and surface to settle a key problem in computeraided geometric design and reverse engineering, that is, constructing the curve (surface)fitting (interpolating) a given ordered point set without solving a linear system. We startwith a piece of initial non-uniform B-spline curve (surface) which takes the given point setas its control point set. Then by adjusting its control points gradually with iterative formula,we can get a group of non-uniform B-spline curves (surfaces) with gradually higherprecision. In this paper, using modern matrix theory, we strictly prove that the limit curve(surface) of the iteration interpolates the given point set. The non-uniform B-spline curves(surfaces) generated with the iteration have many advantages, such as satisfying theNURBS standard, having explicit expression, gaining locality, and convexity preserving,etc

A Novel Contour Tracing Algorithm for Object Shape Reconstruction Using Parametric Curves

Parametric curves such as Bézier and B-splines, originally developedfor the design of automobile bodies, are now also used in image processing andcomputer vision. For example, reconstructing an object shape in an image,including different translations, scales, and orientations, can be performedusing these parametric curves. For this, Bézier and B-spline curves can be generatedusing a point set that belongs to the outer boundary of the object. Theresulting object shape can be used in computer vision fields, such as searchingand segmentation methods and training machine learning algorithms. Theprerequisite for reconstructing the shape with parametric curves is to obtainsequentially the points in the point set. In this study, a novel algorithm hasbeen developed that sequentially obtains the pixel locations constituting theouter boundary of the object. The proposed algorithm, unlike the methods inthe literature, is implemented using a filter containing weights and an outercircle surrounding the object. In a binary format image, the starting point ofthe tracing is determined using the outer circle, and the next tracing movementand the pixel to be labeled as the boundary point is found by the filter weights.Then, control points that define the curve shape are selected by reducing thenumber of sequential points. Thus, the Bézier and B-spline curve equationsdescribing the shape are obtained using these points. In addition, differenttranslations, scales, and rotations of the object shape are easily provided bychanging the positions of the control points. It has also been shown that themissing part of the object can be completed thanks to the parametric curves.

Efficient Construction of B-Spline Curves with Minimal Internal Energy

In this paper,we propose an efficient method to construct energy-minimizing B-spline curves by using discrete mask method.The linear relations between control points are firstly derived for different energy-minimization problems,then the construction of B-spline curve with minimal internal energy can be addressed by solving a sparse linear system.The existence and uniqueness of the solution for the linear system are also proved.Experimental results show the efficiency of the proposed approach,and its application in 1 G blending curve construction is also presented.

Approximate merging of B-spline curves and surfaces

Applying the distance function between two B-spline curves with respect to the L2 norm as the approximate error, we investigate the problem of approximate merging of two adjacent B-spline curves into one B-spline curve. Then this method can be easily extended to the approximate merging problem of multiple B-spline curves and of two adjacent surfaces. After minimizing the approximate error between curves or surfaces, the approximate merging problem can be transformed into equations solving. We express both the new control points and the precise error of approximation explicitly in matrix form. Based on homogeneous coordinates and quadratic programming, we also introduce a new framework for approximate merging of two adjacent NURBS curves. Finally, several numerical examples demonstrate the effectiveness and validity of the algorithm.

One Fairing Method of Cubic B-spline Curves Based on Weighted Progressive Iterative Approximation

A new method to the problem of fairing planar cubic B-spline curves is introduced in this paper. The method is based on weighted progressive iterative approximation （WPIA for short） and consists of following steps： finding the bad point which needs to fair, deleting the bad point, re-inserting a new data point to keep the structm-e of the curve and applying WPIA method with the new set of the data points to obtain the faired curve. The new set of the data points is formed by the rest of the original data points and the new inserted point. The method can be used for shape design and data processing. Numerical examples are provided to demonstrate the effectiveness of the method.

RECONSTRUCTION OF SYMMETRIC B-SPLINE CURVES AND SURFACES

A method to reconstruct symmetric B-spline curves and surfaces is presented. The symmetry property is realized by using symmetric knot vector and symmetric control points. Firstly, data points are divided into two parts based on the symmetry axis or symmetry plane extracted from data points. Then the divided data points are parameterized and a symmetric knot vector is selected in order to get symmetric B-spline basis functions. Constraint equations regarding the control points are deduced to keep the control points of the B-spline curve or surface to be symmetric with respect to the extracted symmetry axis or symmetry plane. Lastly, the constrained least squares fitting problem is solved with the Lagrange multiplier method. Two examples from industry are given to show that the proposed method is efficient, robust and able to meet the general engineering requirements.

THE RELATIONSHIP BETWEEN PROJECTIVE GEOMETRIC AND RATIONAL QUADRATIC B-SPLINE CURVES

Abstract For two rational quadratic B spline curves with same control vertexes, the cross ratio of four collinear points are represented: which are any one of the vertexes, and the two points that the ray initialing from the vertex intersects with the corresponding segments of the two curves, and the point the ray intersecting with the connecting line between the two neighboring vertexes. Different from rational quadratic Bézier curves, the value is generally related with the location of the ray, and the necessary and sufficient condition of the ratio being independent of the ray's location is showed. Also another cross ratio of the following four collinear points are suggested, i.e. one vertex, the points that the ray from the initial vertex intersects respectively with the curve segment, the line connecting the segments end points, and the line connecting the two neighboring vertexes. This cross ratio is concerned only with the ray's location, but not with the weights of the curve. Furthermore, the cross ratio is projective invariant under the projective transformation between the two segments.

A Methodology for Curve and Surface Fitting with Adaptive Fairing for Digitized Points

A new approach for NURBS(Non-uniform rational B-spline) curve and surface fitting for measured points was presented which employs a fairing method applied to digitized point data with discrete curvature. If measured points are used as control points to construct an NURBS curve, then the curvature of each data point corresponding to control point of the constructed curve can be computed. According to the convex hull and local properties of NURBS, based on the curvatures obtained, the measured points can be faired. If faired measured points are used as target points to modify, the constructed curve passing through these faired points can produce a smooth NURBS curve. This paper also presented the justification for utilizing the curvatures of constructed NURBS curve instead of the conventional interpolated curve to fair the measured points. Based on the presented algorithms, some qualities of the constructed curves can be improved.

Extraction of Feature Points for Non-Uniform Rational B-Splines(NURBS)-Based Modeling of Human Legs

Methods of digital human modeling have been developed and utilized to reflect human shape features.However,most of published works focused on dynamic visualization or fashion design,instead of high-accuracy modeling,which was strongly demanded by medical or rehabilitation scenarios.Prior to a high-accuracy modeling of human legs based on non-uniform rational B-splines(NURBS),the method of extracting the required quasi-grid network of feature points for human legs is presented in this work.Given the 3 D scanned human body,the leg is firstly segmented and put in standardized position.Then re-sampling of the leg is conducted via a set of equidistant cross sections.Through analysis of leg circumferences and circumferential curvature,the characteristic sections of the leg as well as the characteristic points on the sections are then identified according to the human anatomy and shape features.The obtained collection can be arranged to form a grid of data points for knots calculation and high-accuracy shape reconstruction in future work.

A well test model for stress-sensitive and heterogeneous reservoirs with non-uniform thicknesses

In view of the anisotropy,heterogeneity and stress-sensitive permeability in low permeability reservoirs,an analytical well test model was established by introducing the concept of permeability modulus.This model considered the permeability stress-sensitivity,wellbore storage effect,and the skin effect.The perturbation technique and Laplace transformation were used to solve the mathematical model analytically in Laplace space,and the bottom-hole pressure type curves were plotted and analyzed in real space by using the Stehfest numerical inversion.

AHT Bézier Curves and NUAHT B-Spline Curves

In this paper, we present two new unified mathematics models of conics and polynomial curves, called algebraic hyperbolic trigonometric （ AHT） Bezier curves and non-uniform algebraic hyperbolic trigonometric （ NUAHT） B-spline curves of order n, which are generated over the space span{sin t, cos t, sinh t, cosh t, 1, t,..., t^n-5}, n 7〉 5. The two kinds of curves share most of the properties as those of the Bezier curves and B-spline curves in polynomial space. In particular, they can represent exactly some remarkable transcendental curves such as the helix, the cycloid and the catenary. The subdivision formulae of these new kinds of curves are also given. The generations of the tensor product surfaces are straightforward. Using the new mathematics models, we present the control mesh representations of two classes of minimal surfaces.

Generation of Discrete Bicubic G^1 B-Spline Ship Hullform Surfaces from a Given Curve Notwork Using Virtual Iso-Parametric Curves

We propose a method that automatically generates discrete bicubic G^1 continuous B-spline surfaces that interpolate the curve network of a ship huliform.First,the curves in the network are classified into two types;boundary curves and ＂reference curves＂,The boundary curves correspond to a set of rectangular（or triangular）topological type that can be representes with tensot-product （or degenerate）B-spline surface patches.Next,in the interior of the patches,surface fitting points and cross boundary derivatives are estimated from the reference curves by constructing ＂virtual＂isoparametric curves.Finally,a discrete G^1 continuous B-spline surface is gencrated by a surface fitting algorithm.Several smooth ship hullform surfaces generated from curve networks corresponding to actual ship hullforms demonstrate the quality of the method.

A matrix method for degree-raising of B-spline curves

A new identity is proved that represents the kth order B-splines as linear combinations of the (k + 1) th order B-splines A new method for degree-raising of B-spline curves is presented based on the identity. The new method can be used for all kinds of B-spline curves, that is, both uniform and arbitrarily nonuniform B-spline curves. When used for degree-raising of a segment of a uniform B-spline curve of degree k - 1, it can help obtain a segment of curve of degree k that is still a uniform B-spline curve without raising the multiplicity of any knot. The method for degree-raising of Bezier curves can be regarded as the special case of the new method presented. Moreover, the conventional theory for degree-raising, whose shortcoming has been found, is discussed.

Visual Modeling of Rice Root Growth Based on B-Spline Curve

As a major food production crop in China,the growth and development of rice is an extremely complex systemic process,and the root system is the main organ for rice to obtain nutrients.Therefore,3D modeling and visualization of the rice root system can help to further understand its morphology,structure and function,and provide an aid for scientific cultivation of rice and improving rice yield for decision making.In this paper,a mathematical model of the rice root system is established based on the B spline curve combined with the L-system approach,using mathematical knowledge based on the 3D morphological characteristics of the real rice root system.The B-Spline Curve is chosen to simulate this,and the recursive definition of B-Spline Curve and its formula are used to realize the modeling of the rice root system curve.Based on the mathematical method of rice root system integration,the bending effect of rice root system at different periods and different growth positions is realized.Finally,the L-system combined with B-Spline Curve is used to construct a rice root system model and realize the rice root system visualization simulation.The simulated image is closer to the real rice root system image in terms of morphological structure and has a strong sense of realism.

KNOT PLACEMENT FOR B-SPLINE CURVE APPROXIMATION VIA l_(∞,1)-NORM AND DIFFERENTIAL EVOLUTION ALGORITHM

In this paper,we consider the knot placement problem in B-spline curve approximation.A novel two-stage framework is proposed for addressing this problem.In the first step,the l_(∞,1)-norm model is introduced for the sparse selection of candidate knots from an initial knot vector.By this step,the knot number is determined.In the second step,knot positions are formulated into a nonlinear optimization problem and optimized by a global optimization algorithm—the differential evolution algorithm(DE).The candidate knots selected in the first step are served for initial values of the DE algorithm.Since the candidate knots provide a good guess of knot positions,the DE algorithm can quickly converge.One advantage of the proposed algorithm is that the knot number and knot positions are determined automatically.Compared with the current existing algorithms,the proposed algorithm finds approximations with smaller fitting error when the knot number is fixed in advance.Furthermore,the proposed algorithm is robust to noisy data and can handle with few data points.We illustrate with some examples and applications.

The Location of Singular and Inflection Points for Planar Cubic B-Spline Curve

Using vectors between control points(a_i=P_(i+1)-P_i),parameters λ and μ(such that a_(i+1)=λ_(ai+μ_(a_i+2))are used to study the shape classification of planar parametric cubic B-spline curves. The regiosn of λμ space corresponding to different geometric features on the curves are investigated.These results are useful for curve design.

FREE-FORM SURFACE RECON-STRUCTION BASED ON NURBS TO SERIAL CROSS-SECTIONS

A new method for recovering shape from cross-sectional contours with complexbranching structures is presented. First, each branching problem by providing an intermediatecontour using distance function and image processing technology is solved. Then, all contours aredivided into several groups of simple contours. For each group, a NURBS curve is fitted to contourpoints in each section within a given accuracy on a common knot vector. Finally, the NURBS surfaceskinning of these contours is performed for providing a smooth geometric model. The method issuitable to reproduce the object by NC machining or rapid prototyping. Some results demonstrate itsusefulness and feasibility.

A Class of Spline Curves with Four Local Shape Parameters

A class of spline curves with four local shape parameters, which includes the quartic spline curves with three local shape parameters given in Han [Xuli Han. A class of general quartic spline curves with shape parameters. Comput. Aided Geom. Design, 28：151-163 （2011）], is proposed. Without solving a linear system, the spline curves can be used to interpolate sets of points with C2 continuity partly or entirely. The shape parameters have a predictable adjusting role on the sp[ine curves.