A Computational Method for Subdivision Depth of Ternary Schemes

Clicks: 186
ID: 116209
2020
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #49 of 82 articles by views in Mathematics

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
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

No comments yet. Be the first to comment on this article.