Interpolatory subdivision algorithms for the generation of curves and surfaces play a veryimportant rule in shape design and modelling in CAD/CAM systems. In this paper, by using the dif-ference and divided difference...Interpolatory subdivision algorithms for the generation of curves and surfaces play a veryimportant rule in shape design and modelling in CAD/CAM systems. In this paper, by using the dif-ference and divided difference analysis, a systematic method to construct Cn (n≥ 0) interpolatorycurves by subdivision from given data is described and the mask (filter) of the algorithm is presentedexplicitly. This algorithm generates a Cn smooth curve which interpolates the initial control points.Control parameters are also provided so that the shape of the final curve can be adjusted according torequirements. An immediate generalisation of the method is the construction of smooth interpolatorysubdivision algorithms over uniform triangular networks (tensor product type data) in Rm. The mainresults of this algorithm for smooth interpolatory surface subdivision algorrthm are also included.AMS(MOS) : 65D05 , 65D15 , 65D17.展开更多
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展开更多
This paper discusses the problem of constructing C2 quartic spline surface interpolation. Decreasing the continuity of the quartic spline to C2 offers additional freedom degrees that can be used to adjust the precisio...This paper discusses the problem of constructing C2 quartic spline surface interpolation. Decreasing the continuity of the quartic spline to C2 offers additional freedom degrees that can be used to adjust the precision and the shape of the interpolation surface. An approach to determining the freedom degrees is given, the continuity equations for constructing C2 quartic spline curve are discussed, and a new method for constructing C2 quartic spline surface is presented. The advantages of the new method are that the equations that the surface has to satisfy are strictly row diagonally dominant, and the discontinuous points of the surface are at the given data points. The constructed surface has the precision of quartic polynomial. The comparison of the interpolation precision of the new method with cubic and quartic spline methods is included.展开更多
The new algorithms for finding B-Spline or Bezier curves and surfaces intersections using recursive subdivision techniques are presented, which use extrapolating acceleration technique, and have convergent precision o...The new algorithms for finding B-Spline or Bezier curves and surfaces intersections using recursive subdivision techniques are presented, which use extrapolating acceleration technique, and have convergent precision of order 2. Matrix method is used to subdivide the curves or surfaces which makes the subdivision more concise and intuitive. Dividing depths of Bezier curves and surfaces are used to subdivide the curves or surfaces adaptively Therefore the convergent precision and the computing efficiency of finding the intersections of curves and surfaces have been improved by the methods proposed in the paper.展开更多
文摘Interpolatory subdivision algorithms for the generation of curves and surfaces play a veryimportant rule in shape design and modelling in CAD/CAM systems. In this paper, by using the dif-ference and divided difference analysis, a systematic method to construct Cn (n≥ 0) interpolatorycurves by subdivision from given data is described and the mask (filter) of the algorithm is presentedexplicitly. This algorithm generates a Cn smooth curve which interpolates the initial control points.Control parameters are also provided so that the shape of the final curve can be adjusted according torequirements. An immediate generalisation of the method is the construction of smooth interpolatorysubdivision algorithms over uniform triangular networks (tensor product type data) in Rm. The mainresults of this algorithm for smooth interpolatory surface subdivision algorrthm are also included.AMS(MOS) : 65D05 , 65D15 , 65D17.
文摘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
基金This work was supported by the National Natural Science Foundation of China (Grant No. 60173052)Shandong Province Key Natural Science Foundation (Grant No. Z2001G01).
文摘This paper discusses the problem of constructing C2 quartic spline surface interpolation. Decreasing the continuity of the quartic spline to C2 offers additional freedom degrees that can be used to adjust the precision and the shape of the interpolation surface. An approach to determining the freedom degrees is given, the continuity equations for constructing C2 quartic spline curve are discussed, and a new method for constructing C2 quartic spline surface is presented. The advantages of the new method are that the equations that the surface has to satisfy are strictly row diagonally dominant, and the discontinuous points of the surface are at the given data points. The constructed surface has the precision of quartic polynomial. The comparison of the interpolation precision of the new method with cubic and quartic spline methods is included.
文摘The new algorithms for finding B-Spline or Bezier curves and surfaces intersections using recursive subdivision techniques are presented, which use extrapolating acceleration technique, and have convergent precision of order 2. Matrix method is used to subdivide the curves or surfaces which makes the subdivision more concise and intuitive. Dividing depths of Bezier curves and surfaces are used to subdivide the curves or surfaces adaptively Therefore the convergent precision and the computing efficiency of finding the intersections of curves and surfaces have been improved by the methods proposed in the paper.
