Yusuf Fatihu Hamza, M. F. Hamza, A. Rababah, Salisu Ibrahim
{"title":"Geometric Degree Reduction of Wang-Ball Curves","authors":"Yusuf Fatihu Hamza, M. F. Hamza, A. Rababah, Salisu Ibrahim","doi":"10.1155/2023/5483111","DOIUrl":null,"url":null,"abstract":"There are substantial methods of degree reduction in the literature. Existing methods share some common limitations, such as lack of geometric continuity, complex computations, and one-degree reduction at a time. In this paper, an approximate geometric multidegree reduction algorithm of Wang–Ball curves is proposed. \n \n \n \n G\n \n \n 0\n \n \n \n -, \n \n \n \n G\n \n \n 1\n \n \n \n -, and \n \n \n \n G\n \n \n 2\n \n \n \n -continuity conditions are applied in the degree reduction process to preserve the boundary control points. The general equation for high-order (G2 and above) multidegree reduction algorithms is nonlinear, and the solutions of these nonlinear systems are quite expensive. In this paper, \n \n \n \n C\n \n \n 1\n \n \n \n -continuity conditions are imposed besides the \n \n \n \n G\n \n \n 2\n \n \n \n -continuity conditions. While some existing methods only achieve the multidegree reduction by repeating the one-degree reduction method recursively, our proposed method achieves multidegree reduction at once. The distance between the original curve and the degree-reduced curve is measured with the \n \n \n \n L\n \n \n 2\n \n \n \n -norm. Numerical example and figures are presented to state the adequacy of the algorithm. The proposed method not only outperforms the existing method of degree reduction of Wang–Ball curves but also guarantees geometric continuity conditions at the boundary points, which is very important in CAD and geometric modeling.","PeriodicalId":8218,"journal":{"name":"Appl. Comput. Intell. Soft Comput.","volume":"17 7 1","pages":"5483111:1-5483111:10"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Appl. Comput. Intell. Soft Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2023/5483111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
There are substantial methods of degree reduction in the literature. Existing methods share some common limitations, such as lack of geometric continuity, complex computations, and one-degree reduction at a time. In this paper, an approximate geometric multidegree reduction algorithm of Wang–Ball curves is proposed.
G
0
-,
G
1
-, and
G
2
-continuity conditions are applied in the degree reduction process to preserve the boundary control points. The general equation for high-order (G2 and above) multidegree reduction algorithms is nonlinear, and the solutions of these nonlinear systems are quite expensive. In this paper,
C
1
-continuity conditions are imposed besides the
G
2
-continuity conditions. While some existing methods only achieve the multidegree reduction by repeating the one-degree reduction method recursively, our proposed method achieves multidegree reduction at once. The distance between the original curve and the degree-reduced curve is measured with the
L
2
-norm. Numerical example and figures are presented to state the adequacy of the algorithm. The proposed method not only outperforms the existing method of degree reduction of Wang–Ball curves but also guarantees geometric continuity conditions at the boundary points, which is very important in CAD and geometric modeling.