A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

Clicks: 250
ID: 111043
2020
Free PDF
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
Emerging

Ranked #76 of 145 articles by views in Symmetry

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 145 in total.

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
Sign in to mint
Abstract
Subdivision schemes are extensively used in scientific and practical applications to produce continuous geometrical shapes in an iterative manner. We construct a numerical algorithm to estimate subdivision depth between the limit curves/surfaces and their control polygons after k-fold subdivisions. In this paper, the proposed numerical algorithm for subdivision depths of binary subdivision curves and surfaces are obtained after some modification of the results given by Mustafa et al in 2006. This algorithm is very useful for implementation of the parametrization.
Reference Key
shahzad2020symmetrya Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Aamir Shahzad;Faheem Khan;Abdul Ghaffar;Ghulam Mustafa;Kottakkaran Sooppy Nisar;Dumitru Baleanu;Shahzad, Aamir;Khan, Faheem;Ghaffar, Abdul;Mustafa, Ghulam;Nisar, Kottakkaran Sooppy;Baleanu, Dumitru;
Journal Symmetry
Year 2020
DOI
10.3390/sym12010066
URL
https://doi.org/10.3390/sym12010066
Keywords
algorithm Numerical Analysis subdivision schemes error bounds subdivision depth

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.