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...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.展开更多
In this paper we propose a construction method of the planar cubic algebraic splinecurve with endpoint interpolation conditions and a specific analysis of its properties. Thepiecewise cubic algebraic curve has G2 cont...In this paper we propose a construction method of the planar cubic algebraic splinecurve with endpoint interpolation conditions and a specific analysis of its properties. Thepiecewise cubic algebraic curve has G2 continuous contact with the control polygon at twoendpoints and is G2 continuous between each segments of itself. The process of this method issimple and clear, and provides a new way of thinking to design implicit curves.展开更多
For accurate prediction of the deformation of cable in the towed system, a new finite element model is presented that provides a representation of both the bending and torsional effects. In this paper, the cubic splin...For accurate prediction of the deformation of cable in the towed system, a new finite element model is presented that provides a representation of both the bending and torsional effects. In this paper, the cubic spline interpolation function is applied as the trial solution. By using a weighted residual approach, the discretized motion equations for the new finite element model are developed. The model is calculated with the computation program complier by Matlab. Several numerical examples are presented to illustrate the numerical schemes. The results of numerical simulation are stable and valid, and consistent with the mechanical properties of the cable. The model can be applied to kinematics analysis and the design of ocean cable, such as mooring lines, towing, and ROV umbilical cables.展开更多
Traditional generating algorithms for B Spline curves and surfaces require approximation methods where how to increment the parameter to get the best approximation is problematic; or they take the pixel-based method n...Traditional generating algorithms for B Spline curves and surfaces require approximation methods where how to increment the parameter to get the best approximation is problematic; or they take the pixel-based method needing matrix trans- formation from B Spline representation to Bézier form. Here, a fast, direct point-by-point generating algorithm for B Spline curves and surfaces is presented. The algorithm does not need matrix transformation, can be used for uniform or nonuniform B Spline curves and surfaces of any degree, and has high generating speed and good rendering accuracy.展开更多
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 curv...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.展开更多
This paper presents a class of Cn- continuous B- type spline curves with some paramet- ric factors.The length of their local support is equal to4.Taking the different values of the parametric factors,the curves can ...This paper presents a class of Cn- continuous B- type spline curves with some paramet- ric factors.The length of their local support is equal to4.Taking the different values of the parametric factors,the curves can become free- type curves or interpolate a set of given points even mix the both cases.When the parametric factors satisfy the certain conditions,the degrees of the curves can be decreased as low as possible.Besides,when all the parametric factors tend to zero,the curves globally approximate to the control polygon.展开更多
In this paper, a G1, C1, C2 PH-spline is employed as an approximation for a given Bzier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bzier curve. The errors...In this paper, a G1, C1, C2 PH-spline is employed as an approximation for a given Bzier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bzier curve. The errors between PH-spline and the Bzier curve, the offset to PH-spline and the offset to the given Bzier curve are also estimated. A new algorithm for constructing offset to the Bzier curve is proposed.展开更多
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:...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.展开更多
In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our me...In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our method is: first, we construct an initial surface which interpolates the four given boundary curves; then, while keeping the boundary control points of the initial surface un- changed, we reposition the inner control points of the surface with energy optimization method. Examples show that our algorithm is practicable and effective.展开更多
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 par...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.展开更多
Immiscible water-alternating-gas(WAG) flooding is an EOR technique that has proven successful for water drive reservoirs due to its ability to improve displacement and sweep efficiency.Nevertheless,considering the c...Immiscible water-alternating-gas(WAG) flooding is an EOR technique that has proven successful for water drive reservoirs due to its ability to improve displacement and sweep efficiency.Nevertheless,considering the complicated phase behavior and various multiphase flow characteristics,gas tends to break through early in production wells in heterogeneous formations because of overriding,fingering,and channeling,which may result in unfavorable recovery performance.On the basis of phase behavior studies,minimum miscibility pressure measurements,and immiscible WAG coreflood experiments,the cubic B-spline model(CBM) was employed to describe the three-phase relative permeability curve.Using the Levenberg-Marquardt algorithm to adjust the vector of unknown model parameters of the CBM sequentially,optimization of production performance including pressure drop,water cut,and the cumulative gas-oil ratio was performed.A novel numerical inversion method was established for estimation of the water-oil-gas relative permeability curve during the immiscible WAG process.Based on the quantitative characterization of major recovery mechanisms,the proposed method was validated by interpreting coreflood data of the immiscible WAG experiment.The proposed method is reliable and can meet engineering requirements.It provides a basic calculation theory for implicit estimation of oil-water-gas relative permeability curve.展开更多
Knot insertion algorithm is one of the most important technologies of B-spline method. By inserting a knot the local prop- erties of B-spline curve and the control flexibility of its shape can be fiu'ther improved, a...Knot insertion algorithm is one of the most important technologies of B-spline method. By inserting a knot the local prop- erties of B-spline curve and the control flexibility of its shape can be fiu'ther improved, also the segmentation of the curve can be rea- lized. ECT spline curve is drew by the multi-knots spline curve with associated matrix in ECT spline space; Muehlbach G and Tang Y and many others have deduced the existence and uniqueness of the ECT spline function and developed many of its important properties .This paper mainly focuses on the knot insertion algorithm of ECT B-spline curve.It is the widest popularization of B-spline Behm algorithm and theory. Inspired by the Behm algorithm, in the ECT spline space, structure of generalized P61ya poly- nomials and generalized de Boor Fix dual functional, expressing new control points which are inserted after the knot by linear com- bination of original control vertex the single knot, and there are two cases, one is the single knot, the other is the double knot. Then finally comes the insertion algorithm of ECT spline curve knot. By application of the knot insertion algorithm, this paper also gives out the knot insertion algorithm of four order geometric continuous piecewise polynomial B-spline and algebraic trigonometric spline B-spline, which is consistent with previous results.展开更多
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 f...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.展开更多
文摘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.
基金Supported by the National Key Basic Research Project of China (No. 2004CB318000)the NSF of China(No. 60533060/60872095)+1 种基金the Specialized Research Fund for the Doctoral Program of Higher Education (No.20060358055)the Subject Foundation in Ningbo University(No. xkl09046)
文摘In this paper we propose a construction method of the planar cubic algebraic splinecurve with endpoint interpolation conditions and a specific analysis of its properties. Thepiecewise cubic algebraic curve has G2 continuous contact with the control polygon at twoendpoints and is G2 continuous between each segments of itself. The process of this method issimple and clear, and provides a new way of thinking to design implicit curves.
基金supported by the Natural Science Foundation of Hubei Province of China(Grant No.2010CDB10804)
文摘For accurate prediction of the deformation of cable in the towed system, a new finite element model is presented that provides a representation of both the bending and torsional effects. In this paper, the cubic spline interpolation function is applied as the trial solution. By using a weighted residual approach, the discretized motion equations for the new finite element model are developed. The model is calculated with the computation program complier by Matlab. Several numerical examples are presented to illustrate the numerical schemes. The results of numerical simulation are stable and valid, and consistent with the mechanical properties of the cable. The model can be applied to kinematics analysis and the design of ocean cable, such as mooring lines, towing, and ROV umbilical cables.
基金Project (No. G1998030401) supported by the National Natural Sci-ence Foundation of China
文摘Traditional generating algorithms for B Spline curves and surfaces require approximation methods where how to increment the parameter to get the best approximation is problematic; or they take the pixel-based method needing matrix trans- formation from B Spline representation to Bézier form. Here, a fast, direct point-by-point generating algorithm for B Spline curves and surfaces is presented. The algorithm does not need matrix transformation, can be used for uniform or nonuniform B Spline curves and surfaces of any degree, and has high generating speed and good rendering accuracy.
基金Supported by the National Natural Science Foundation of China (60873111, 60933007)
文摘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.
文摘This paper presents a class of Cn- continuous B- type spline curves with some paramet- ric factors.The length of their local support is equal to4.Taking the different values of the parametric factors,the curves can become free- type curves or interpolate a set of given points even mix the both cases.When the parametric factors satisfy the certain conditions,the degrees of the curves can be decreased as low as possible.Besides,when all the parametric factors tend to zero,the curves globally approximate to the control polygon.
文摘In this paper, a G1, C1, C2 PH-spline is employed as an approximation for a given Bzier curve within error bound and further renders offset which can be regarded as an approximate offset to the Bzier curve. The errors between PH-spline and the Bzier curve, the offset to PH-spline and the offset to the given Bzier curve are also estimated. A new algorithm for constructing offset to the Bzier curve is proposed.
基金Supported by National Natural Science Foundation of China(No.U1135003 and No.61100126)Ph.D.Programs Foundation of Ministry of Education of China for Young Scholars(No.20100111120023,No.20110111120026)Anhui Provincial Natural Science Foundation(No.11040606Q42)
文摘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.
基金Supported by the Natural Science Foundation of Hebei Province
文摘In this paper, we present an algorithm for reconstruction of B-spline surface such that it interpolates the four given bound- ary curves and simultaneously approximates some given inner points. The main idea of our method is: first, we construct an initial surface which interpolates the four given boundary curves; then, while keeping the boundary control points of the initial surface un- changed, we reposition the inner control points of the surface with energy optimization method. Examples show that our algorithm is practicable and effective.
基金Supported by the National Natural Science Foundation of China (11171316), and the Zhejiang Provincial Natural Science Foundation of China (No. Y6090472).
基金This project is supported by National Natural Science Foundation of China(No.50575098).
文摘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 financial support of the Important National Science and Technology Specific Projects of China (Grant No. 2011ZX05010-002)the Important Science and Technology Specific Projects of Petro China (Grant No. 2014E-3203)
文摘Immiscible water-alternating-gas(WAG) flooding is an EOR technique that has proven successful for water drive reservoirs due to its ability to improve displacement and sweep efficiency.Nevertheless,considering the complicated phase behavior and various multiphase flow characteristics,gas tends to break through early in production wells in heterogeneous formations because of overriding,fingering,and channeling,which may result in unfavorable recovery performance.On the basis of phase behavior studies,minimum miscibility pressure measurements,and immiscible WAG coreflood experiments,the cubic B-spline model(CBM) was employed to describe the three-phase relative permeability curve.Using the Levenberg-Marquardt algorithm to adjust the vector of unknown model parameters of the CBM sequentially,optimization of production performance including pressure drop,water cut,and the cumulative gas-oil ratio was performed.A novel numerical inversion method was established for estimation of the water-oil-gas relative permeability curve during the immiscible WAG process.Based on the quantitative characterization of major recovery mechanisms,the proposed method was validated by interpreting coreflood data of the immiscible WAG experiment.The proposed method is reliable and can meet engineering requirements.It provides a basic calculation theory for implicit estimation of oil-water-gas relative permeability curve.
基金Supported by Financially Supported by the NUAA Fundamental Research Funds(No.NZ2013201)
文摘Knot insertion algorithm is one of the most important technologies of B-spline method. By inserting a knot the local prop- erties of B-spline curve and the control flexibility of its shape can be fiu'ther improved, also the segmentation of the curve can be rea- lized. ECT spline curve is drew by the multi-knots spline curve with associated matrix in ECT spline space; Muehlbach G and Tang Y and many others have deduced the existence and uniqueness of the ECT spline function and developed many of its important properties .This paper mainly focuses on the knot insertion algorithm of ECT B-spline curve.It is the widest popularization of B-spline Behm algorithm and theory. Inspired by the Behm algorithm, in the ECT spline space, structure of generalized P61ya poly- nomials and generalized de Boor Fix dual functional, expressing new control points which are inserted after the knot by linear com- bination of original control vertex the single knot, and there are two cases, one is the single knot, the other is the double knot. Then finally comes the insertion algorithm of ECT spline curve knot. By application of the knot insertion algorithm, this paper also gives out the knot insertion algorithm of four order geometric continuous piecewise polynomial B-spline and algebraic trigonometric spline B-spline, which is consistent with previous results.
文摘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.