{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T11:10:31Z","timestamp":1782385831823,"version":"3.54.5"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2023,3,31]]},"abstract":"<jats:p>\n            For control nets outlining a large class of topological polyhedra, not just tensor-product grids, bi-cubic polyhedral splines form a piecewise polynomial, first-order differentiable space that associates one function with each vertex. Akin to tensor-product splines, the resulting smooth surface approximates the polyhedron. Admissible polyhedral control nets consist of quadrilateral faces in a grid-like layout, star-configuration where\n            <jats:italic>n<\/jats:italic>\n            \u2260 4 quadrilateral faces join around an interior vertex,\n            <jats:italic>n<\/jats:italic>\n            -gon configurations, where\n            <jats:italic>2n<\/jats:italic>\n            quadrilaterals surround an\n            <jats:italic>n<\/jats:italic>\n            -gon, polar configurations where a cone of\n            <jats:italic>n<\/jats:italic>\n            triangles meeting at a vertex is surrounded by a ribbon of\n            <jats:italic>n<\/jats:italic>\n            quadrilaterals, and three types of T-junctions where two quad-strips merge into one.\n          <\/jats:p>\n          <jats:p>The bi-cubic pieces of a polyhedral spline have matching derivatives along their break lines, possibly after a known change of variables. The pieces are represented in Bernstein-B\u00e9zier form with coefficients depending linearly on the polyhedral control net, so that evaluation, differentiation, integration, moments, and so on, are no more costly than for standard tensor-product splines. Bi-cubic polyhedral splines can be used both to model geometry and for computing functions on the geometry. Although polyhedral splines do not offer nested refinement by refinement of the control net, polyhedral splines support engineering analysis of curved smooth objects. Coarse nets typically suffice since the splines efficiently model curved features. Algorithm\u00a01032 is a C++ library with input-output example pairs and an IGES output choice.<\/jats:p>","DOI":"10.1145\/3570158","type":"journal-article","created":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T12:51:25Z","timestamp":1667220685000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Algorithm\u00a01032: Bi-cubic Splines for Polyhedral Control Nets"],"prefix":"10.1145","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2499-1529","authenticated-orcid":false,"given":"J\u00f6rg","family":"Peters","sequence":"first","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0338-6469","authenticated-orcid":false,"given":"Kyle","family":"Lo","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9398-6424","authenticated-orcid":false,"given":"K\u0229stutis","family":"Kar\u010diauskas","sequence":"additional","affiliation":[{"name":"Vilnius University, Lithuania"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,3,21]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7949(93)90455-M"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4485(94)90073-6"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63841-6"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2020.101814"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(84)90132-4"},{"key":"e_1_3_2_7_2","series-title":"Cambridge monographs on applied and computational mathematics","volume-title":"Radial Basis Functions - Theory and Implementations","author":"Buhmann Martin D.","year":"2009","unstructured":"Martin D. Buhmann. 2009. Radial Basis Functions - Theory and Implementations. Cambridge monographs on applied and computational mathematics, Vol. 12. Cambridge University Press. I\u2013X, 1\u2013259 pages. http:\/\/www.cambridge.org\/de\/academic\/subjects\/mathematics\/numerical-analysis\/radial-basis-functions-theory-and-implementations."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4485(78)90110-0"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0207(20000430)47:12<2039::AID-NME872>3.0.CO;2-1"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59721-3"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2016.05.009"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6333-3"},{"key":"e_1_3_2_13_2","volume-title":"B (asic)-Spline Basics.","author":"Boor Carl de","year":"1986","unstructured":"Carl de Boor. 1986. B (asic)-Spline Basics.Technical Report. U. of Wisconsin, Mathematics Research Center."},{"key":"e_1_3_2_14_2","first-page":"131","volume-title":"Geometric Modeling: Algorithms and New Trends","author":"Boor C. de","year":"1987","unstructured":"C. de Boor. 1987. B-form basics. In Geometric Modeling: Algorithms and New Trends, G. Farin (Ed.). SIAM, 131\u2013148."},{"key":"e_1_3_2_15_2","doi-asserted-by":"crossref","unstructured":"Tony DeRose Michael Kass and Tien Truong. 1998. Subdivision surfaces in character animation. ACM Press New York 85\u201394.","DOI":"10.1145\/280814.280826"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.5555\/61954"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2004.10.008"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.gmod.2015.06.011"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2017.12.002"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.5802\/smai-jcm.52"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2019.01.002"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2015.07.014"},{"key":"e_1_3_2_23_2","article-title":"Quad-net obstacle course","author":"Kar\u010diauskas K\u0229stutis","unstructured":"K\u0229stutis Kar\u010diauskas and J\u00f6rg Peters. [n. d.]. Quad-net obstacle course. http:\/\/www.cise.ufl.edu\/research\/SurfLab\/shape_gallery.shtml. Accessed: June 2020.","journal-title":"http:\/\/www.cise.ufl.edu\/research\/SurfLab\/shape_gallery.shtml"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2014.09.004"},{"key":"e_1_3_2_25_2","first-page":"151","volume-title":"Computer Graphics Forum","author":"Kar\u010diauskas K\u0229stutis","year":"2019","unstructured":"K\u0229stutis Kar\u010diauskas and J\u00f6rg Peters. 2019. High quality refinable G-splines for locally quad-dominant meshes with T-gons. In Computer Graphics Forum, Vol. 38. Wiley Online Library, 151\u2013161."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2020.101934"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2020.101908"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2020.102927"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2022.05.019"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2004.04.005"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721588"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-017-9220-9"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2011.08.018"},{"issue":"1","key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.amc.2015.06.103","article-title":"\\({C}^1\\)  finite elements on non-tensor-product 2D and 3D manifolds","volume":"272","author":"Nguyen Thien","year":"2016","unstructured":"Thien Nguyen, K\u0229stutis Kar\u010diauskas, and J\u00f6rg Peters. 2016. \\({C}^1\\) finite elements on non-tensor-product 2D and 3D manifolds. Appl. Math. Comput. 272, 1 (2016), 148\u2013158.","journal-title":"Appl. Math. Comput."},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2016.02.009"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01888155"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1137\/0732029"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.5802\/smai-jcm.57"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76406-9"},{"key":"e_1_3_2_40_2","unstructured":"J. Peters and X. Wu. 2021. BezierView (short bview): A light weight viewer that renders Bezier patches. https:\/\/www.cise.ufl.edu\/research\/SurfLab\/bview."},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s003659900063"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-874X(93)90067-Z"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/0045-7825(88)90097-7"},{"key":"e_1_3_2_44_2","unstructured":"Wavefront Technologies. 2021. Wavefront .obj file. https:\/\/en.wikipedia.org\/wiki\/Wavefront_.obj_file."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cma.2016.11.009"},{"key":"e_1_3_2_46_2","unstructured":"Wikipedia contributors. 2021. De Casteljau\u2019s algorithm \u2014 Wikipedia The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=De_Casteljau%27s_algorithm&oldid=1043959654.[Online; accessed 1-December-2021]."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.4208\/cicp.OA-2016-0030"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570158","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3570158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:37Z","timestamp":1750182577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,21]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3,31]]}},"alternative-id":["10.1145\/3570158"],"URL":"https:\/\/doi.org\/10.1145\/3570158","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,21]]},"assertion":[{"value":"2021-07-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}