{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T10:25:10Z","timestamp":1772101510097,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:00:00Z","timestamp":1744329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T00:00:00Z","timestamp":1744329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Near East University"},{"name":"Near East University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Subdivision schemes generate smooth surfaces by iteratively refining a coarse initial mesh. However, it is important to determine how many iterations are needed to achieve the desired subdivision surface while adhering to the pre-defined error tolerance, which is known as the subdivision depth. We introduce an advanced technique to compute the subdivision depths of Li\u2019s scheme presented in (Comput. Graph. Forum\n                    <jats:bold>24<\/jats:bold>\n                    (1), 3\u201316, 2005). This technique involves calculating the distance between consecutive levels of meshes, and then calculating the distance between any arbitrary level of mesh and the limiting surface, which is known as error bounds. Then correlate the mask of the scheme with an arbitrary vector and obtain expressions through convolution. As the order of the convolution increases, the values of these expressions monotonically decline. As a result, one can obtain sharper error bounds and fewer values for subdivision depths by increasing the order of convolution. The convolution allows for balancing the number of iterations and the predefined errors, making the process more efficient. The algorithms are introduced to make things easier and more understandable for the readers when using applications. The validity of the algorithms are confirmed by testing it on different parts of the mesh with varying valence numbers. The versatility of the proposed approach is demonstrated through the creation of tables and graphs.\n                  <\/jats:p>","DOI":"10.1007\/s11075-025-02063-3","type":"journal-article","created":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T04:09:37Z","timestamp":1744344577000},"page":"1785-1807","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounding the distance between the kth control mesh and the limit surface of Li\u2019s subdivision"],"prefix":"10.1007","volume":"101","author":[{"given":"Rakib","family":"Mustafa","sequence":"first","affiliation":[]},{"given":"Faheem","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Ghulam","family":"Mustafa","sequence":"additional","affiliation":[]},{"given":"Rimsha","family":"Saleem","sequence":"additional","affiliation":[]},{"given":"Muhammad","family":"Asghar","sequence":"additional","affiliation":[]},{"given":"Hijaz","family":"Ahmad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,11]]},"reference":[{"issue":"2","key":"2063_CR1","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1016\/j.cam.2005.06.030","volume":"193","author":"G Mustafa","year":"2006","unstructured":"Mustafa, G., Chen, F., Deng, J.: Estimating error bounds for binary subdivision curves\/surfaces. J. Comput. Appl. Math. 193(2), 596\u2013613 (2006)","journal-title":"J. Comput. Appl. Math."},{"key":"2063_CR2","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s00371-010-0496-0","volume":"26","author":"G Mustafa","year":"2010","unstructured":"Mustafa, G., Hashmi, S.: Subdivision depth computation for n-ary subdivision curves\/surfaces. Vis. Comput. 26, 841\u2013851 (2010)","journal-title":"Vis. Comput."},{"key":"2063_CR3","first-page":"10","volume":"304","author":"C Deng","year":"2017","unstructured":"Deng, C., Jin, W., Li, Y., Xu, H.: A formula for estimating the deviation of a binary interpolatory subdivision curve from its data polygon. Appl. Math. Comput. 304, 10\u201319 (2017)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2063_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cam.2011.06.031","volume":"236","author":"M Moncayo","year":"2011","unstructured":"Moncayo, M., Amat, S.: Error bounds for a class of subdivision schemes based on the two-scale refinement equation. J. Comput. Appl. Math. 236(2), 265\u2013278 (2011)","journal-title":"J. Comput. Appl. Math."},{"key":"2063_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/sym12010066","volume":"12","author":"A Shahzad","year":"2020","unstructured":"Shahzad, A., Faheem, K., Ghaffar, A., Mustafa, G., Nisar, K.S., Baleanu, D.: A novel numerical algorithm to estimate the subdivision depth of binary subdivision schemes. Symmetry 12, 1\u201313 (2020)","journal-title":"Symmetry"},{"key":"2063_CR6","doi-asserted-by":"publisher","first-page":"187146","DOI":"10.1109\/ACCESS.2020.3030665","volume":"8","author":"G Mustafa","year":"2020","unstructured":"Mustafa, G., Shahzad, A., Khan, F., Baleanu, D., Chu, Y.: A new computational approach to estimate the subdivision depth of n-ary subdivision scheme. IEEE Access 8, 187146\u2013187155 (2020)","journal-title":"IEEE Access"},{"key":"2063_CR7","first-page":"697","volume":"12","author":"H Wang","year":"2002","unstructured":"Wang, H., Guan, Y., Qin, K.: Error estimation for Doo-Sabin surfaces. Prog. Nat. Sci. 12, 697\u2013700 (2002)","journal-title":"Prog. Nat. Sci."},{"key":"2063_CR8","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/BF02945592","volume":"19","author":"HW Wang","year":"2004","unstructured":"Wang, H.W., Qin, K.H.: Estimating subdivision depth of Catmull-Clark surfaces. J. Comput. Sci. Technol. 19, 657\u2013664 (2004)","journal-title":"J. Comput. Sci. Technol."},{"key":"2063_CR9","first-page":"11","volume":"4","author":"HW Wang","year":"2004","unstructured":"Wang, H.W., Sun, H., Qin, K.H.: Estimating recursion depth for Loop subdivision. Int. J. CAD\/CAM 4, 11\u201318 (2004)","journal-title":"Int. J. CAD\/CAM"},{"key":"2063_CR10","volume-title":"A Wavelet Tour of Signal Processing","author":"S Mallat","year":"1999","unstructured":"Mallat, S.: A Wavelet Tour of Signal Processing. Academic Press (1999)"},{"issue":"2","key":"2063_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.jat.2008.10.012","volume":"161","author":"J Peters","year":"2009","unstructured":"Peters, J., Wu, X.: The distance of a subdivision surface to its control polyhedron. J. Approx. Theory 161(2), 491\u2013507 (2009)","journal-title":"J. Approx. Theory"},{"key":"2063_CR12","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1080\/00207160.2013.807917","volume":"91","author":"G Zhou","year":"2014","unstructured":"Zhou, G., Zeng, X.M.: Error bounds for Loop subdivision surfaces. Int. J. Comput. Math. 91, 688\u2013703 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"2063_CR13","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.cam.2005.05.035","volume":"195","author":"XM Zeng","year":"2006","unstructured":"Zeng, X.M., Chen, X.J.: Computational formula of depth for Catmull-Clark subdivision surfaces. J. Comput. Appl. Math. 195, 252\u2013262 (2006)","journal-title":"J. Comput. Appl. Math."},{"key":"2063_CR14","unstructured":"Huang, Z.J.: Estimating error bounds and subdivision depths for Loop subdivision surfaces; Technical Report. Peking University: Beijing, China. Available online http:\/\/staff.ustc.edu.cn\/zhuang\/papers\/tr-loop-2007.pdf (2007). Accessed 15 Oct 2007"},{"key":"2063_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Z.J., Wang, G.P.: Distance between a Catmull-Clark subdivision surface and its limit mesh. In: Proceedings of the 2007 ACM Symposium on Solid and Physical Modeling, Beijing, China, 4\u20136 June 2007, pp. 233\u2013240","DOI":"10.1145\/1236246.1236280"},{"key":"2063_CR16","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1007\/s00371-007-0173-0","volume":"23","author":"ZJ Huang","year":"2007","unstructured":"Huang, Z.J., Wang, G.P.: Improved error estimate for extraordinary Catmull-Clark subdivision surface patches. Vis. Comput. 23, 1005\u20131014 (2007)","journal-title":"Vis. Comput."},{"key":"2063_CR17","doi-asserted-by":"crossref","unstructured":"Huang, Z.J., Wang, G.P. (2008) Bounding the distance between a Loop subdivision surface and its limit mesh. In: Proceedings of the Geometric Modeling and Processing (LNCS 4975), Hangzhou, China, pp. 33\u201346","DOI":"10.1007\/978-3-540-79246-8_3"},{"key":"2063_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.cagd.2008.05.002","volume":"25","author":"ZJ Huang","year":"2008","unstructured":"Huang, Z.J., Deng, J.S., Wang, G.P.: A bound on the approximation of a Catmull-Clark subdivision surface by its limit mesh. Comput. Aided Geom. Des. 25, 457\u2013469 (2008)","journal-title":"Comput. Aided Geom. Des."},{"key":"2063_CR19","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/0010-4485(78)90111-2","volume":"10","author":"D Doo","year":"1978","unstructured":"Doo, D., Sabin, M.A.: Behaviour of recursive subdivision surfaces near extraordinary points. Comput. Aided Des. 10, 356\u2013360 (1978)","journal-title":"Comput. Aided Des."},{"key":"2063_CR20","unstructured":"Loop, C.T.: Smooth subdivision surfaces based on triangles. Master\u2019s Thesis, Department of Mathematics, University of Utah, Salt Lake City, UT, USA (1987)"},{"key":"2063_CR21","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/0010-4485(78)90110-0","volume":"10","author":"E Catmull","year":"1978","unstructured":"Catmull, E., Clark, J.: Recursively generated B-spline surfaces on arbitrary topological meshes. Comput. Aided Des. 10, 350\u2013355 (1978)","journal-title":"Comput. Aided Des."},{"issue":"6","key":"2063_CR22","first-page":"561","volume":"39","author":"G Mustafa","year":"2009","unstructured":"Mustafa, G., Hashmi, S., Khan, F.: Error bounds for $$\\sqrt{3}$$ subdivision surfaces. J. Univ. Sci. Technol. China 39(6), 561\u2013569 (2009)","journal-title":"J. Univ. Sci. Technol. China"},{"issue":"1","key":"2063_CR23","first-page":"29","volume":"26","author":"MS Hashmi","year":"2014","unstructured":"Hashmi, M.S., Mustafa, G., Khan, F.: Estimating error bounds for G. Li et al.\u2019s subdivision scheme. Sci. Int. 26(1), 29\u201334 (2014)","journal-title":"Sci. Int."},{"issue":"2","key":"2063_CR24","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1016\/j.aej.2016.02.013","volume":"55","author":"G Mustafa","year":"2016","unstructured":"Mustafa, G., Hashmi, S., Khan, F.: Subdivision depth for triangular surfaces. Alex. Eng. J. 55(2), 1647\u20131653 (2016)","journal-title":"Alex. Eng. J."},{"issue":"4","key":"2063_CR25","first-page":"1","volume":"2022","author":"F Khan","year":"2022","unstructured":"Khan, F., Shakoor, B., Mustafa, G., Razaq, S.: A convolution-based computational technique for subdivision depth of Doo-Sabin subdivision surface. J. Math. 2022(4), 1\u201312 (2022)","journal-title":"J. Math."},{"issue":"1","key":"2063_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1111\/j.1467-8659.2005.00824.x","volume":"24","author":"G Li","year":"2005","unstructured":"Li, G., Ma, W., Bao, H.: A new interpolatory subdivision for quadrilateral meshes. Comput. Graph. Forum 24(1), 3\u201316 (2005)","journal-title":"Comput. Graph. Forum"},{"issue":"3","key":"2063_CR27","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1111\/1467-8659.1530409","volume":"15","author":"L Kobbelt","year":"1996","unstructured":"Kobbelt, L.: Interpolatory subdivision on open quadrilateral nets with arbitrary topology. Comput. Graph. Forum 15(3), 409\u2013420 (1996)","journal-title":"Comput. Graph. Forum"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02063-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-025-02063-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-025-02063-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T09:33:28Z","timestamp":1772098408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-025-02063-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,11]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2063"],"URL":"https:\/\/doi.org\/10.1007\/s11075-025-02063-3","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,11]]},"assertion":[{"value":"8 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}