To many industrial products such as cell phone, family appliance, vehicle, a pretty shape of nice visual effect is indispensable. To fulfill this target, designers are endeavoring to make the curve and surface of the ...To many industrial products such as cell phone, family appliance, vehicle, a pretty shape of nice visual effect is indispensable. To fulfill this target, designers are endeavoring to make the curve and surface of the products smooth and continuous during the shape design. Through the analysis and generalization of the present smoothing methods, the energy optimization method which combines the merits of energy method and least squares method together is studied, the target function of energy optimization method is derived, the solution to the target function and steps of curve fairing is introduced, the skills and methods building A-class surface which are based on cloud data measured from 3D scanning are studied, the validity of energy optimization method is verified with the example of the shape design ofa mini-EV as well.展开更多
Resorting to cubic spline function instead of parametric spline representation, an explicit fairness indicator and an efficient fairing algorithm for 2D curves are presented. The input point sequence is firstly partit...Resorting to cubic spline function instead of parametric spline representation, an explicit fairness indicator and an efficient fairing algorithm for 2D curves are presented. The input point sequence is firstly partitioned into several overlapped function segments. For each segment, a cubic spline function is used as the representation tool which entails a polyline approximation of curvature plot. Based on the extrinsic relationship between the polyline and the positions of data points, a coarse-to-fine faring method is proposed which efficiently identifies and eliminates the unnecessary inflection points. Our algorithm generates the best results to date, which is validated by numerous practical examples.展开更多
A method of fairing parametric cubic B_spline curves and bicubic B_spline surfaces is presented. The basic idea of the method is to reposition the control points by an optimization process.A new objectijve function pr...A method of fairing parametric cubic B_spline curves and bicubic B_spline surfaces is presented. The basic idea of the method is to reposition the control points by an optimization process.A new objectijve function presented is based on the variation of the third order derivatives of the cubic B_spline curves and bicubic B_spline surfaces at the nodes. The curves and surfaces faired using this method tend to possess curvature continuities. The numerical examples show that the effect of this method is acceptable.展开更多
Kjellander has reported an algorithm for fairing uniform parametric cubic splines. Poliakoff extended Kjellander’s algorithm to non-uniform case. However, they merely changed the bad point’s position, and neglected ...Kjellander has reported an algorithm for fairing uniform parametric cubic splines. Poliakoff extended Kjellander’s algorithm to non-uniform case. However, they merely changed the bad point’s position, and neglected the smoothing of tangent at bad point. In this paper, we present a fairing algorithm that both changed point’s position and its corresponding tangent vector. The new algorithm possesses the minimum property of energy. We also proved Poliakoff’s fairing algorithm is a deduction of our fairing algorithm. Several fairing examples are given in this paper.展开更多
In this paper, we focus on how to use strain energy minimization to obtain the optimal value of the fl＇ee parameter of the planar Cardinal spline curves. The unique solution can be easily obtained by minimizing an ap...In this paper, we focus on how to use strain energy minimization to obtain the optimal value of the fl＇ee parameter of the planar Cardinal spline curves. The unique solution can be easily obtained by minimizing an appropriate approximation of the strain energy. An example is presented to illustrate the effectiveness of our method.展开更多
Curve and surface blending is an important operation in CAD systems, in which a non-uniform rational B-spline （NURBS） has been used as the de facto standard. In local comer blending, two curves intersecting at that ...Curve and surface blending is an important operation in CAD systems, in which a non-uniform rational B-spline （NURBS） has been used as the de facto standard. In local comer blending, two curves intersecting at that comer are first made disjoint, and then the third blending curve is added-in to smoothly join the two curves with G^1- or G^2-continuity. In this paper we present a study to solve the joint problem based on curve extension. The following nice properties of this extension algorithm are exploited in depth： （1） The parameterization of the original shapes does not change; （2） No additional fragments are created. Various examples are presented to demonstrate that our solution is simple and efficient.展开更多
文摘To many industrial products such as cell phone, family appliance, vehicle, a pretty shape of nice visual effect is indispensable. To fulfill this target, designers are endeavoring to make the curve and surface of the products smooth and continuous during the shape design. Through the analysis and generalization of the present smoothing methods, the energy optimization method which combines the merits of energy method and least squares method together is studied, the target function of energy optimization method is derived, the solution to the target function and steps of curve fairing is introduced, the skills and methods building A-class surface which are based on cloud data measured from 3D scanning are studied, the validity of energy optimization method is verified with the example of the shape design ofa mini-EV as well.
基金Supported by the National Natural Science Foundation of China(61222206,11526212)
文摘Resorting to cubic spline function instead of parametric spline representation, an explicit fairness indicator and an efficient fairing algorithm for 2D curves are presented. The input point sequence is firstly partitioned into several overlapped function segments. For each segment, a cubic spline function is used as the representation tool which entails a polyline approximation of curvature plot. Based on the extrinsic relationship between the polyline and the positions of data points, a coarse-to-fine faring method is proposed which efficiently identifies and eliminates the unnecessary inflection points. Our algorithm generates the best results to date, which is validated by numerous practical examples.
文摘A method of fairing parametric cubic B_spline curves and bicubic B_spline surfaces is presented. The basic idea of the method is to reposition the control points by an optimization process.A new objectijve function presented is based on the variation of the third order derivatives of the cubic B_spline curves and bicubic B_spline surfaces at the nodes. The curves and surfaces faired using this method tend to possess curvature continuities. The numerical examples show that the effect of this method is acceptable.
基金Project (No. 10371026) supported by the National Natural Science Foundation of China
文摘Kjellander has reported an algorithm for fairing uniform parametric cubic splines. Poliakoff extended Kjellander’s algorithm to non-uniform case. However, they merely changed the bad point’s position, and neglected the smoothing of tangent at bad point. In this paper, we present a fairing algorithm that both changed point’s position and its corresponding tangent vector. The new algorithm possesses the minimum property of energy. We also proved Poliakoff’s fairing algorithm is a deduction of our fairing algorithm. Several fairing examples are given in this paper.
基金The Hunan Provincial Natural Science Foundation(2017JJ3124)of China
文摘In this paper, we focus on how to use strain energy minimization to obtain the optimal value of the fl＇ee parameter of the planar Cardinal spline curves. The unique solution can be easily obtained by minimizing an appropriate approximation of the strain energy. An example is presented to illustrate the effectiveness of our method.
基金supported by the National Natural Science Foundation of China (Nos. 60603085 and 60736019)the Hi-Tech Research and Development (863) Program of China (No. 2007AA01Z336)Tsinghua Basic Research Foundation, China # Expanded based on "Note on industrial applications of Hu’s surface
文摘Curve and surface blending is an important operation in CAD systems, in which a non-uniform rational B-spline （NURBS） has been used as the de facto standard. In local comer blending, two curves intersecting at that comer are first made disjoint, and then the third blending curve is added-in to smoothly join the two curves with G^1- or G^2-continuity. In this paper we present a study to solve the joint problem based on curve extension. The following nice properties of this extension algorithm are exploited in depth： （1） The parameterization of the original shapes does not change; （2） No additional fragments are created. Various examples are presented to demonstrate that our solution is simple and efficient.
