The problem of constructing curve on parametric surface (or surface that canbe parameterized) such that it interpolates a sequence of points with prescribed tangent directionand curvature vector (or geodesic curvature...The problem of constructing curve on parametric surface (or surface that canbe parameterized) such that it interpolates a sequence of points with prescribed tangent directionand curvature vector (or geodesic curvature) at every point and the issue of curve blending on thiskind of surface are researched. The mapping and tangent mapping from the surface to its parametricplane are introduced and thus several conclusions with differential geometry are deduced. Based onthose conclusions, the problem of interpolating (or blending) curve on a parametric surface isconverted to a similar one on its parametric plane. The final solution curve of either interpolationor blending issue is explicit and can still be expressed by parametric form. And so, unlikeexisting methods, the presented method needs not to use any surface/ surface intersectionalgorithms, usually a troublesome process, for displaying such interpolation curve. Experimentresults show the presented methods are feasible and applicable to CAD/CAM and computer graphics展开更多
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.展开更多
基金This project is supported by National Natural Science Foundation of China(No.50475041)Huo Ying-Dong Education Foundation, China (No.03-91053).
文摘The problem of constructing curve on parametric surface (or surface that canbe parameterized) such that it interpolates a sequence of points with prescribed tangent directionand curvature vector (or geodesic curvature) at every point and the issue of curve blending on thiskind of surface are researched. The mapping and tangent mapping from the surface to its parametricplane are introduced and thus several conclusions with differential geometry are deduced. Based onthose conclusions, the problem of interpolating (or blending) curve on a parametric surface isconverted to a similar one on its parametric plane. The final solution curve of either interpolationor blending issue is explicit and can still be expressed by parametric form. And so, unlikeexisting methods, the presented method needs not to use any surface/ surface intersectionalgorithms, usually a troublesome process, for displaying such interpolation curve. Experimentresults show the presented methods are feasible and applicable to CAD/CAM and computer graphics
基金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.
