王球曲线的几何降度

Yusuf Fatihu Hamza, M. F. Hamza, A. Rababah, Salisu Ibrahim
{"title":"王球曲线的几何降度","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":"{\"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}","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

摘要

文献中有大量的度还原方法。现有的方法有一些共同的局限性,如缺乏几何连续性、计算复杂、一次降一级等。本文提出了一种近似几何的Wang-Ball曲线多度约简算法。在降阶过程中采用g0 -、g1 -和g2 -连续条件,以保持边界控制点。高阶(G2及以上)多阶约简算法的一般方程是非线性的,而这些非线性系统的解是相当昂贵的。在本文中,除了g2连续条件外,还附加了c1连续条件。现有的一些方法只能通过递归地重复一度约简方法来实现多度约简,而本文提出的方法可以一次实现多度约简。用l2范数测量原始曲线与降阶曲线之间的距离。通过算例和图形说明了该算法的充分性。该方法不仅优于现有的Wang-Ball曲线降阶方法,而且保证了边界点处的几何连续性条件,这在CAD和几何建模中具有重要意义。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Geometric Degree Reduction of Wang-Ball Curves
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信