A Computational Method for Subdivision Depth of Ternary Schemes
Clicks: 153
ID: 116209
2020
Article Quality & Performance Metrics
Overall Quality
Improving Quality
0.0
/100
Combines engagement data with AI-assessed academic quality
Reader Engagement
Popular Article
30.0
/100
115 views
17 readers
Trending
AI Quality Assessment
Not analyzed
Abstract
Subdivision schemes are extensively used in scientific and practical applications to produce continuous shapes in an iterative way. This paper introduces a framework to compute subdivision depths of ternary schemes. We first use subdivision algorithm in terms of convolution to compute the error bounds between two successive polygons produced by refinement procedure of subdivision schemes. Then, a formula for computing bound between the polygon at k-th stage and the limiting polygon is derived. After that, we predict numerically the number of subdivision steps (depths) required for smooth limiting shape based on the demand of user specified error (distance) tolerance. In addition, extensive numerical experiments were carried out to check the numerical outcomes of this new framework. The proposed methods are more efficient than the method proposed by Song et al.
| Reference Key |
khan2020mathematicsa
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Faheem Khan;Ghulam Mustafa;Aamir Shahzad;Dumitru Baleanu;Maysaa M. Al-Qurashi;Khan, Faheem;Mustafa, Ghulam;Shahzad, Aamir;Baleanu, Dumitru;M. Al-Qurashi, Maysaa; |
| Journal | Mathematics |
| Year | 2020 |
| DOI |
10.3390/math8050817
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.