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-minimizati...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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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 ( NUAH...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.展开更多
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;bo...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 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 ...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.展开更多
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 ...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 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 paramet...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.展开更多
This paper presents a novel algorithm for planar curve offsetting. The basic idea is to regard the locus relative to initial base circle, which is formed by moving the unit normal vectors of the base curve, as a unit ...This paper presents a novel algorithm for planar curve offsetting. The basic idea is to regard the locus relative to initial base circle, which is formed by moving the unit normal vectors of the base curve, as a unit circular arc first, then accurately to represent it as a rational curve, and finally to reparameterize it in a particular way to approximate the offset. Examples illustrated that the algorithm yields fewer curve segments and control points as well as C^1 continuity, and so has much significance in terms of saving computing time, reducing the data storage and smoothing curves entirely.展开更多
In this paper, a unique combination among probabilistic roadmap, modified ant colony optimization, and third order B-spline curve has been proposed to solve path planning problems?in complex and very complex environme...In this paper, a unique combination among probabilistic roadmap, modified ant colony optimization, and third order B-spline curve has been proposed to solve path planning problems?in complex and very complex environments. This proposed approach can be divided into three stages. First stage involves constructing a random roadmap depending on the environment complexity using probabilistic roadmap algorithm. Roadmap can be constructed by distributing N nodes randomly in complex and very complex static environments then pairing these nodes together according to some criteria or conditions. The constructed roadmap contains a huge number of possible random paths that may lead to connecting?the start and the goal points together. Second stage includes finding path within the pre-constructed roadmap. Modified ant colony optimization has been proposed to find or to search the best path between start and goal points, where in addition to the proposed combination, ACO has been modified to increase its ability to find shorter path. Finally, the third stage uses B-spline curve?to smooth and reduce the total length of the found path in the previous stage. The results of the proposed approach ensure?the?feasible?path between start and goal points in complex and very complex environments. Also, the path is guaranteed to be short, smooth, continuous?and safe.展开更多
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 visuali...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.展开更多
In this paper, we estimate the partial derivative bounds for Non-Uniform Rational B-spline(NURBS) surfaces. Firstly, based on the formula of translating the product into sum of B-spline functions, discrete B-spline th...In this paper, we estimate the partial derivative bounds for Non-Uniform Rational B-spline(NURBS) surfaces. Firstly, based on the formula of translating the product into sum of B-spline functions, discrete B-spline theory and Dir function, some derivative bounds on NURBS curves are provided. Then, the derivative bounds on the magnitudes of NURBS surfaces are proposed by regarding a rational surface as the locus of a rational curve. Finally, some numerical examples are provided to elucidate how tight the bounds are.展开更多
This paper presents a flexible method for the representation of welded seam based on spline interpolation. In this method, the tool path of welding robot can be generated automatically from a 3D CAD model. This techni...This paper presents a flexible method for the representation of welded seam based on spline interpolation. In this method, the tool path of welding robot can be generated automatically from a 3D CAD model. This technique has been implemented and demonstrated in the FANUC Arc Welding Robot Workstation. According to the method, a software system is developed using VBA of SolidWorks 2006. It offers an interface between SolidWorks and ROBOGUIDE, the off-line programming software of FANUC robot. It combines the strong modeling function of the former and the simulating function of the latter. It also has the capability of with on-line robot. The result data have shown its high accuracy and strong reliability in experiments. This method will improve the intelligence and the flexibility of the welding robot workstation.展开更多
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 ...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.展开更多
When a pipe is partially filled with a given working liquid,the relationship between the electromotive force(EMF)measured by the sensor(flowmeter)and the average velocity is nonlinear and non-monotonic.This relationsh...When a pipe is partially filled with a given working liquid,the relationship between the electromotive force(EMF)measured by the sensor(flowmeter)and the average velocity is nonlinear and non-monotonic.This relationship varies with the inclination of the pipe,the fluid density,the pipe wall friction coefficient,and other factors.Therefore,existing measurement methods cannot meet the accuracy requirements of many industrial applications.In this study,a new processing method is proposed by which the flow rate can be measured with an ordinary electromagnetic flowmeter even if the pipe is only partially filled.First,a B-spline curve fitting method is applied to a limited set of measurements.Second,matrix inversion required in the B-spline curve method is optimized in order to reduce the number of needed computations.Dedicated experimental tests prove that the proposed method can effectively measure the average flow velocity of the fluid.When the fluid level of the pipeline is between 50%and 100%,the relative error is less than 3.5%.展开更多
基金Thanks for the reviewers’comments to improve the paper.This research was supported by the National Nature Science Foundation of China under Grant Nos.61772163,61761136010,61472111,Zhejiang Provincial Natural Science Foundation of China under Grant Nos.LR16F020003,LQ16F020005.
文摘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.
文摘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 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.
基金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.
基金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.
文摘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.
基金This work is supported by the National Natural Science Foundation of China under Grant Nos.60473130,10371110the National Grand Fundamental Research 973 Program of China under Grant No.2004CB318000.
文摘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.
文摘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.
基金Project supported by the National Natural Science Foundation of China.
文摘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.
文摘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
基金Supported by the National Natural Science Foundation of China(No.10871208,No.60970097)Graduate Students Scientific Research Innovation Project of Hunan Province(No.CX2012B111)+1 种基金the Postdoctoral Science Foundation of China(No.2015M571931)the Fundamental Research Funds for the Central Universities(No.2017MS121)
文摘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.
基金Supported by the National Natural Science Foundation of China (6093300760873111)
文摘This paper presents a novel algorithm for planar curve offsetting. The basic idea is to regard the locus relative to initial base circle, which is formed by moving the unit normal vectors of the base curve, as a unit circular arc first, then accurately to represent it as a rational curve, and finally to reparameterize it in a particular way to approximate the offset. Examples illustrated that the algorithm yields fewer curve segments and control points as well as C^1 continuity, and so has much significance in terms of saving computing time, reducing the data storage and smoothing curves entirely.
文摘In this paper, a unique combination among probabilistic roadmap, modified ant colony optimization, and third order B-spline curve has been proposed to solve path planning problems?in complex and very complex environments. This proposed approach can be divided into three stages. First stage involves constructing a random roadmap depending on the environment complexity using probabilistic roadmap algorithm. Roadmap can be constructed by distributing N nodes randomly in complex and very complex static environments then pairing these nodes together according to some criteria or conditions. The constructed roadmap contains a huge number of possible random paths that may lead to connecting?the start and the goal points together. Second stage includes finding path within the pre-constructed roadmap. Modified ant colony optimization has been proposed to find or to search the best path between start and goal points, where in addition to the proposed combination, ACO has been modified to increase its ability to find shorter path. Finally, the third stage uses B-spline curve?to smooth and reduce the total length of the found path in the previous stage. The results of the proposed approach ensure?the?feasible?path between start and goal points in complex and very complex environments. Also, the path is guaranteed to be short, smooth, continuous?and safe.
基金Supported by the National Natural Science Foundation of China(61862032)the Project of Natural Science Foundation of Jiangxi Province(20202BABL202034)the Special Foundation of Graduate Student Innovation of Jiangxi Province(YC2021-S347)
文摘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.
基金Supported by the National Natural Science Foundation of China(61572430,61303144)the Natural Science Foundation of Zhejiang Province(LY15F020002,LY16F020020)the Ningbo Natural Science Foundation(2016A610223)
文摘In this paper, we estimate the partial derivative bounds for Non-Uniform Rational B-spline(NURBS) surfaces. Firstly, based on the formula of translating the product into sum of B-spline functions, discrete B-spline theory and Dir function, some derivative bounds on NURBS curves are provided. Then, the derivative bounds on the magnitudes of NURBS surfaces are proposed by regarding a rational surface as the locus of a rational curve. Finally, some numerical examples are provided to elucidate how tight the bounds are.
基金This work was supported by Tianjin Natural Science Fund Supporting Project (05YFJZJ)
文摘This paper presents a flexible method for the representation of welded seam based on spline interpolation. In this method, the tool path of welding robot can be generated automatically from a 3D CAD model. This technique has been implemented and demonstrated in the FANUC Arc Welding Robot Workstation. According to the method, a software system is developed using VBA of SolidWorks 2006. It offers an interface between SolidWorks and ROBOGUIDE, the off-line programming software of FANUC robot. It combines the strong modeling function of the former and the simulating function of the latter. It also has the capability of with on-line robot. The result data have shown its high accuracy and strong reliability in experiments. This method will improve the intelligence and the flexibility of the welding robot workstation.
基金supported by the National Natural Science Foundation of China(Nos.11871447,11801393)the Natural Science Foundation of Jiangsu Province(No.BK20180831).
文摘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 Science and Technology Project of Education Department of the Guangdong Province,China(2017GKTSCX079)Science and Technology Project of Zhongshan Polytechnic,China(2018G01).
文摘When a pipe is partially filled with a given working liquid,the relationship between the electromotive force(EMF)measured by the sensor(flowmeter)and the average velocity is nonlinear and non-monotonic.This relationship varies with the inclination of the pipe,the fluid density,the pipe wall friction coefficient,and other factors.Therefore,existing measurement methods cannot meet the accuracy requirements of many industrial applications.In this study,a new processing method is proposed by which the flow rate can be measured with an ordinary electromagnetic flowmeter even if the pipe is only partially filled.First,a B-spline curve fitting method is applied to a limited set of measurements.Second,matrix inversion required in the B-spline curve method is optimized in order to reduce the number of needed computations.Dedicated experimental tests prove that the proposed method can effectively measure the average flow velocity of the fluid.When the fluid level of the pipeline is between 50%and 100%,the relative error is less than 3.5%.