2023
DOI: 10.3390/math11112449
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Computational Approach for Computing Subdivision Depth of Non-Stationary Binary Subdivision Schemes

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 46 publications
0
0
0
Order By: Relevance