An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes
Subdivision schemes are equipped with some rules that take a polygon as an input and produce smooth curves or surfaces as an output. This presents the issue of how accurately the polygon approximates the limit curve and surface. What number of iterations/levels would be necessary to achieve the requ...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-05-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/11/11/2449 |
| _version_ | 1797597162911039488 |
|---|---|
| author | Samsul Ariffin Abdul Karim Faheem Khan Ghulam Mustafa Aamir Shahzad Muhammad Asghar |
| author_facet | Samsul Ariffin Abdul Karim Faheem Khan Ghulam Mustafa Aamir Shahzad Muhammad Asghar |
| author_sort | Samsul Ariffin Abdul Karim |
| collection | DOAJ |
| description | Subdivision schemes are equipped with some rules that take a polygon as an input and produce smooth curves or surfaces as an output. This presents the issue of how accurately the polygon approximates the limit curve and surface. What number of iterations/levels would be necessary to achieve the required shape at a user-specified error tolerance? In fact, several methods have been introduced in the case of stationary schemes to address the issue in terms of the error bounds (distance between polygon/polyhedron and limiting shape) and subdivision depth (the number of iterations required to obtain the result at a user-specified error tolerance). However, in the case of non-stationary schemes, this topic needs to be further studied to meet the requirements of new practical applications. This paper highlights a new approach based on a convolution technique to estimate error bounds and subdivision depth for non-stationary schemes. The given technique is independent of any condition on the coefficient of the non-stationary subdivision schemes, and it also produces the best results with the least amount of computational effort. In this paper, we first associated constants with the vectors generated by the given non-stationary schemes, then formulated an expression for the convolution product. This expression gives real values, which monotonically decrease with the increase in the order of the convolution in both the curve and surface cases. This convolution feature plays an important role in obtaining the user-defined error tolerance with fewer iterations. It achieves a trade-off between the number of iterations and user-specified errors. In practice, more iterations are needed to achieve a lower error rate, but we achieved this goal by using fewer iterations. |
| first_indexed | 2024-03-11T03:02:53Z |
| format | Article |
| id | doaj.art-b383142a88ee4e1d9bc6945ea4a9042d |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-11T03:02:53Z |
| publishDate | 2023-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-b383142a88ee4e1d9bc6945ea4a9042d2023-11-18T08:12:11ZengMDPI AGMathematics2227-73902023-05-011111244910.3390/math11112449An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision SchemesSamsul Ariffin Abdul Karim0Faheem Khan1Ghulam Mustafa2Aamir Shahzad3Muhammad Asghar4Software Engineering Programme, Faculty of Computing and Informatics, Universiti Malaysia Sabah, Jalan UMS, Kota Kinabalu 88400, MalaysiaDepartment of Mathematics, The Islamia University of Bahawalpur, Bahawalpur 63100, PakistanDepartment of Mathematics, The Islamia University of Bahawalpur, Bahawalpur 63100, PakistanDepartment of Mathematics, University of Sargodha, Sargodha 40100, PakistanDepartment of Mathematics, The Islamia University of Bahawalpur, Bahawalpur 63100, PakistanSubdivision schemes are equipped with some rules that take a polygon as an input and produce smooth curves or surfaces as an output. This presents the issue of how accurately the polygon approximates the limit curve and surface. What number of iterations/levels would be necessary to achieve the required shape at a user-specified error tolerance? In fact, several methods have been introduced in the case of stationary schemes to address the issue in terms of the error bounds (distance between polygon/polyhedron and limiting shape) and subdivision depth (the number of iterations required to obtain the result at a user-specified error tolerance). However, in the case of non-stationary schemes, this topic needs to be further studied to meet the requirements of new practical applications. This paper highlights a new approach based on a convolution technique to estimate error bounds and subdivision depth for non-stationary schemes. The given technique is independent of any condition on the coefficient of the non-stationary subdivision schemes, and it also produces the best results with the least amount of computational effort. In this paper, we first associated constants with the vectors generated by the given non-stationary schemes, then formulated an expression for the convolution product. This expression gives real values, which monotonically decrease with the increase in the order of the convolution in both the curve and surface cases. This convolution feature plays an important role in obtaining the user-defined error tolerance with fewer iterations. It achieves a trade-off between the number of iterations and user-specified errors. In practice, more iterations are needed to achieve a lower error rate, but we achieved this goal by using fewer iterations.https://www.mdpi.com/2227-7390/11/11/2449subdivision depthsubdivision levelsubdivision schemesconvolutionerror bounds |
| spellingShingle | Samsul Ariffin Abdul Karim Faheem Khan Ghulam Mustafa Aamir Shahzad Muhammad Asghar An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes Mathematics subdivision depth subdivision level subdivision schemes convolution error bounds |
| title | An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes |
| title_full | An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes |
| title_fullStr | An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes |
| title_full_unstemmed | An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes |
| title_short | An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes |
| title_sort | efficient computational approach for computing subdivision depth of non stationary binary subdivision schemes |
| topic | subdivision depth subdivision level subdivision schemes convolution error bounds |
| url | https://www.mdpi.com/2227-7390/11/11/2449 |
| work_keys_str_mv | AT samsulariffinabdulkarim anefficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT faheemkhan anefficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT ghulammustafa anefficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT aamirshahzad anefficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT muhammadasghar anefficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT samsulariffinabdulkarim efficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT faheemkhan efficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT ghulammustafa efficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT aamirshahzad efficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes AT muhammadasghar efficientcomputationalapproachforcomputingsubdivisiondepthofnonstationarybinarysubdivisionschemes |