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.展开更多
This paper describes a new method for simulation of the cross section shape of log. The self-developed MQK3102 log shape recognizing machine was used to acquire the finite discrete sampling points on the cross section...This paper describes a new method for simulation of the cross section shape of log. The self-developed MQK3102 log shape recognizing machine was used to acquire the finite discrete sampling points on the cross section of log and those points were fitted with the quadratic B-spline parametric curve. This method can clearly stimulate the real shape of the log cross section and is characterized by limited sampling points and high speed computing. The computed result of the previous curve does not affect the next one, which may avoid the graphic distortion caused by the accumulative error. The method can be used to simulate the whole body shape of log approximately by sampling the cross sections along the length direction of log, thus providing a reference model for optimum saw cutting of log.展开更多
Routing algorithms capable of providing quality of service （QoS） will play an important role in future communication networks. For the trajectory-based routing （ TBR）, An effective method of en- coding trajectorie...Routing algorithms capable of providing quality of service （QoS） will play an important role in future communication networks. For the trajectory-based routing （ TBR）, An effective method of en- coding trajectories into packets is proposed. The method uses a B-spline curve, which provides a lot of flexibility. The simulation results show that the performance of the proposed algorithms is im- proved significantly compared with the existing algorithm.展开更多
Multiresolution modeling is becoming a powerful tool for fast display, and geometric data compression and transmission of complex shapes. Most of the existing literatures investigating the multiresolution for B-spline...Multiresolution modeling is becoming a powerful tool for fast display, and geometric data compression and transmission of complex shapes. Most of the existing literatures investigating the multiresolution for B-spline curves and surfaces are concentrated on open ones. In this paper, we focus on the multiresolution representations and editing of closed B-spline curves and surfaces using wavelets. A repetition approach is adopted for the multiresolution analysis of closed B-spline curves and surfaces. Since the closed curve or surface itself is periodic, it can overcome the drawback brought by the repetition method, i.e. introducing the discontinuities at the boundaries. Based on the models at different multiresolution levels, the multiresolution editing methods of closed curves and surfaces are introduced. Users can edit the overall shape of a closed one while preserving its details, or change its details without affecting its overall shape.展开更多
High-performance finite element research has always been a major focus of finite element method studies.This article introduces isogeometric analysis into the finite element method and proposes a new isogeometric fini...High-performance finite element research has always been a major focus of finite element method studies.This article introduces isogeometric analysis into the finite element method and proposes a new isogeometric finite element method.Firstly,the physical field is approximated by uniform B-spline interpolation,while geometry is represented by non-uniform rational B-spline interpolation.By introducing a transformation matrix,elements of types C^(0)and C^(1)are constructed in the isogeometric finite element method.Subsequently,the corresponding calculation formats for one-dimensional bars,beams,and two-dimensional linear elasticity in the isogeometric finite element method are derived through variational principles and parameter mapping.The proposed method combines element construction techniques of the finite element method with geometric construction techniques of isogeometric analysis,eliminating the need for mesh generation and maintaining flexibility in element construction.Two elements with interpolation characteristics are constructed in the method so that boundary conditions and connections between elements can be processed like the finite element method.Finally,the test results of several examples show that:(1)Under the same degree and element node numbers,the constructed elements are almost consistent with the results obtained by traditional finite element method;(2)For bar problems with large local field variations and beam problems with variable cross-sections,high-degree and multi-nodes elements constructed can achieve high computational accuracy with fewer degrees of freedom than finite element method;(3)The computational efficiency of isogeometric finite element method is higher than finite element method under similar degrees of freedom,while as degrees of freedom increase,the computational efficiency between the two is similar.展开更多
为探究溢洪道连续弯段水流特性及糙条消能工水力学特性,通过开展27组正交模型试验,结合消能率和超高变异系数筛选最优工况,采用RNG k-ε紊流模型与体积分数法(volume of fluid,VOF)对布设糙条和不布设糙条的溢洪道进行水流特性数值模拟...为探究溢洪道连续弯段水流特性及糙条消能工水力学特性,通过开展27组正交模型试验,结合消能率和超高变异系数筛选最优工况,采用RNG k-ε紊流模型与体积分数法(volume of fluid,VOF)对布设糙条和不布设糙条的溢洪道进行水流特性数值模拟对比研究。结果表明:糙条的布设使溢洪道沿程水深增加且变化剧烈;糙条能够抑制菱形波和折冲水流的产生,通过改善两弯段流态使水面均匀性提升38.0%和44.7%;布设糙条后,两弯段纵向流速均值被降低了45.16%和44.83%,各断面凹岸纵向流速的最大值沿水深下移;糙条的存在加剧了水流紊动,使两弯段纵向紊动强度均值增加了117.98%和71.05%,纵向紊动强度集中在凹岸衰减、凸岸增强,且各断面凹岸的最大值沿水深上移;糙条增大了床面动水压力,减小了两岸压力差,对压力分布形式有显著改善效果,有助于保护底板和边壁不易被冲蚀。研究成果可为溢洪道连续弯段设计及安全运行提供参考。展开更多
To realize the high precision and real-time interpolation of the NURBS （non-uniform rational B-spline） curve, a kinetic model based on the modified sigmoid function is proposed. The constraints of maximum feed rate,...To realize the high precision and real-time interpolation of the NURBS （non-uniform rational B-spline） curve, a kinetic model based on the modified sigmoid function is proposed. The constraints of maximum feed rate, chord error, curvature radius and interpolator cycle are discussed. This kinetic model reduces the cubic polynomial S-shape model and the trigonometry function S-shape model from 15 sections into 3 sections under the precondition of jerk, acceleration and feedrate continuity. Then an optimized Adams algorithm using the difference quotient to replace the derivative is presented to calculate the interpolator cycle parameters. The higher-order derivation in the Taylor expansion algorithm can be avoided by this algorithm. Finally, the simplified design is analyzed by reducing the times of computing the low-degree zero-value B-spline basis function and the simplified De Boor-Cox recursive algorithm is proposed. The simulation analysis indicates that by these algorithms, the feed rate is effectively controlled according to tool path. The calculated amount is decreased and the calculated speed is increased while the machining precision is ensured. The experimental results show that the target parameter can be correctly calculated and these algorithms can be applied to actual systems.展开更多
基金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.
基金The research is supported by Project of National Natural Science Foundation of China(30571455)and National "948" Project(2005-4-62)
文摘This paper describes a new method for simulation of the cross section shape of log. The self-developed MQK3102 log shape recognizing machine was used to acquire the finite discrete sampling points on the cross section of log and those points were fitted with the quadratic B-spline parametric curve. This method can clearly stimulate the real shape of the log cross section and is characterized by limited sampling points and high speed computing. The computed result of the previous curve does not affect the next one, which may avoid the graphic distortion caused by the accumulative error. The method can be used to simulate the whole body shape of log approximately by sampling the cross sections along the length direction of log, thus providing a reference model for optimum saw cutting of log.
基金Supported by the National Natural Science Foundation of China （11171316）, and the Zhejiang Provincial Natural Science Foundation of China （No. Y6090472）.
文摘Routing algorithms capable of providing quality of service （QoS） will play an important role in future communication networks. For the trajectory-based routing （ TBR）, An effective method of en- coding trajectories into packets is proposed. The method uses a B-spline curve, which provides a lot of flexibility. The simulation results show that the performance of the proposed algorithms is im- proved significantly compared with the existing algorithm.
文摘Multiresolution modeling is becoming a powerful tool for fast display, and geometric data compression and transmission of complex shapes. Most of the existing literatures investigating the multiresolution for B-spline curves and surfaces are concentrated on open ones. In this paper, we focus on the multiresolution representations and editing of closed B-spline curves and surfaces using wavelets. A repetition approach is adopted for the multiresolution analysis of closed B-spline curves and surfaces. Since the closed curve or surface itself is periodic, it can overcome the drawback brought by the repetition method, i.e. introducing the discontinuities at the boundaries. Based on the models at different multiresolution levels, the multiresolution editing methods of closed curves and surfaces are introduced. Users can edit the overall shape of a closed one while preserving its details, or change its details without affecting its overall shape.
基金funded by the Zhejiang Province Science and Technology Plan Project under grant number 2023C01069the Hebei Provincial Program on Key Basic Research Project under grant number 23311808Dthe Wenzhou Major Science and Technology Innovation Project of China under grant number ZG2022004。
文摘High-performance finite element research has always been a major focus of finite element method studies.This article introduces isogeometric analysis into the finite element method and proposes a new isogeometric finite element method.Firstly,the physical field is approximated by uniform B-spline interpolation,while geometry is represented by non-uniform rational B-spline interpolation.By introducing a transformation matrix,elements of types C^(0)and C^(1)are constructed in the isogeometric finite element method.Subsequently,the corresponding calculation formats for one-dimensional bars,beams,and two-dimensional linear elasticity in the isogeometric finite element method are derived through variational principles and parameter mapping.The proposed method combines element construction techniques of the finite element method with geometric construction techniques of isogeometric analysis,eliminating the need for mesh generation and maintaining flexibility in element construction.Two elements with interpolation characteristics are constructed in the method so that boundary conditions and connections between elements can be processed like the finite element method.Finally,the test results of several examples show that:(1)Under the same degree and element node numbers,the constructed elements are almost consistent with the results obtained by traditional finite element method;(2)For bar problems with large local field variations and beam problems with variable cross-sections,high-degree and multi-nodes elements constructed can achieve high computational accuracy with fewer degrees of freedom than finite element method;(3)The computational efficiency of isogeometric finite element method is higher than finite element method under similar degrees of freedom,while as degrees of freedom increase,the computational efficiency between the two is similar.
文摘为探究溢洪道连续弯段水流特性及糙条消能工水力学特性,通过开展27组正交模型试验,结合消能率和超高变异系数筛选最优工况,采用RNG k-ε紊流模型与体积分数法(volume of fluid,VOF)对布设糙条和不布设糙条的溢洪道进行水流特性数值模拟对比研究。结果表明:糙条的布设使溢洪道沿程水深增加且变化剧烈;糙条能够抑制菱形波和折冲水流的产生,通过改善两弯段流态使水面均匀性提升38.0%和44.7%;布设糙条后,两弯段纵向流速均值被降低了45.16%和44.83%,各断面凹岸纵向流速的最大值沿水深下移;糙条的存在加剧了水流紊动,使两弯段纵向紊动强度均值增加了117.98%和71.05%,纵向紊动强度集中在凹岸衰减、凸岸增强,且各断面凹岸的最大值沿水深上移;糙条增大了床面动水压力,减小了两岸压力差,对压力分布形式有显著改善效果,有助于保护底板和边壁不易被冲蚀。研究成果可为溢洪道连续弯段设计及安全运行提供参考。
基金The Doctoral Fund of Ministry of Education of China(No.20090092110052)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province(No.12KJA460002)College Industrialization Project of Jiangsu Province(No.JHB2012-21)
文摘To realize the high precision and real-time interpolation of the NURBS （non-uniform rational B-spline） curve, a kinetic model based on the modified sigmoid function is proposed. The constraints of maximum feed rate, chord error, curvature radius and interpolator cycle are discussed. This kinetic model reduces the cubic polynomial S-shape model and the trigonometry function S-shape model from 15 sections into 3 sections under the precondition of jerk, acceleration and feedrate continuity. Then an optimized Adams algorithm using the difference quotient to replace the derivative is presented to calculate the interpolator cycle parameters. The higher-order derivation in the Taylor expansion algorithm can be avoided by this algorithm. Finally, the simplified design is analyzed by reducing the times of computing the low-degree zero-value B-spline basis function and the simplified De Boor-Cox recursive algorithm is proposed. The simulation analysis indicates that by these algorithms, the feed rate is effectively controlled according to tool path. The calculated amount is decreased and the calculated speed is increased while the machining precision is ensured. The experimental results show that the target parameter can be correctly calculated and these algorithms can be applied to actual systems.
