Abstract
The aim of this attempt was to present an efficient algorithm for the evaluation of error bound of triangular subdivision surfaces. The error estimation technique is based on first order difference and this process is independent of parametrization. This technique can be easily generalized to higher arity triangular surfaces. The estimated error bound is expressed in-terms of initial control point sequence and constants. Here, we efficiently estimate error bound between triangular surface and its control polygon after k-fold subdivision and further extended to evaluate subdivision depth of the scheme.
Sign-in/Register to access full text options 
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.
