{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T20:39:31Z","timestamp":1772138371713,"version":"3.50.1"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"University of Sargodha"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61673169"],"award-info":[{"award-number":["61673169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["1971142"],"award-info":[{"award-number":["1971142"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3030665","type":"journal-article","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T19:37:21Z","timestamp":1602617841000},"page":"187146-187155","source":"Crossref","is-referenced-by-count":2,"title":["A New Computational Approach to Estimate the Subdivision Depth of <i>n<\/i>-Ary Subdivision Scheme"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0441-8485","authenticated-orcid":false,"given":"Ghulam","family":"Mustafa","sequence":"first","affiliation":[{"name":"Department of Mathematics, The Islamia University of Bahawalpur, Bahawalpur, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0872-0446","authenticated-orcid":false,"given":"Aamir","family":"Shahzad","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Sargodha, Sargodha, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1520-4690","authenticated-orcid":false,"given":"Faheem","family":"Khan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Sargodha, Sargodha, Pakistan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0286-7244","authenticated-orcid":false,"given":"Dumitru","family":"Baleanu","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Cankaya University, Ankara, Turkey"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0944-2134","authenticated-orcid":false,"given":"Yuming","family":"Chu","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Huzhou University, Huzhou, China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2005.06.030"},{"key":"ref11","first-page":"473","article-title":"Estimating error bounds for ternary subdivision curve\/surfaces","volume":"25","author":"mustafa","year":"2007","journal-title":"J Comput Math"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2009.04.050"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-010-0496-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jat.2008.10.012"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2011.06.031"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/sym12010066"},{"key":"ref17","first-page":"1","article-title":"A computational method for subdivision depth of ternary schemes","volume":"817","author":"khan","year":"2020","journal-title":"Mathematics"},{"key":"ref18","first-page":"697","article-title":"Error estimation for Doo-Sabin surfaces","volume":"12","author":"huawei youjiang","year":"2002","journal-title":"Prog Natural Sci"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02945592"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/205863"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-010-0108-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4236\/ojapps.2013.31B1022"},{"key":"ref5","author":"ko","year":"2012","journal-title":"General formula for the mask of ($2n + 4$ )-point symmetric subdivision scheme"},{"key":"ref8","first-page":"176","article-title":"On a-ary subdivision for curve design: II. 3-point and 5-point interpolatory schemes","volume":"3","year":"2008","journal-title":"Applic Appl Math Int J"},{"key":"ref7","first-page":"18","article-title":"On a-ary subdivision for curve design: I. 4-point and 6-point interpolatory schemes","volume":"3","year":"2008","journal-title":"Applic Appl Math Int J"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.263-266.1830"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMM.472.510"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2997557"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2005.05.035"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2013.807917"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/16864360.2006.10738487"},{"key":"ref23","first-page":"11","article-title":"Estimating recursion depth for loop subdivision","volume":"4","author":"wang sun","year":"2004","journal-title":"Int J"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09222132.pdf?arnumber=9222132","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:02:16Z","timestamp":1662667336000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9222132\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3030665","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}