Abstract
In this paper, an advanced computational technique has been presented to compute the error bounds and subdivision depth of quaternary subdivision schemes. First, the estimation is computed of the error bound between quaternary subdivision limit curves/surfaces and their polygons after kth-level subdivision by using l0 order of convolution. Secondly, by using the error bounds, the subdivision depth of the quaternary schemes has been computed. Moreover, this technique needs fewer iterations (subdivision depth) to get the optimal error bounds of quaternary subdivision schemes as compared to the existing techniques.
Highlights
The remaining part of the work is configured as follows: In Sections 2 and 3, we present general inequalities to compute the error bound and subdivision depth of curve and surface models produced by quaternary subdivision schemes (QSS), respectively
We present the inequalities to compute the error bound and subdivision depth for the curve models produced by QSS
We present the inequalities to compute the error bound and subdivision depth for the surface models produced by QSS
Summary
Aamir Shahzad 1 , Faheem Khan 1 , Abdul Ghaffar 2 , Shao-Wen Yao 3, * , Mustafa Inc 4,5,6, *.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
