{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:32:10Z","timestamp":1762252330069},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The paper proposes a new efficient approach\nto computation of interpolating spline surfaces. The generalization\nof an unexpected property, noticed while approximating\npolynomials of degree four by cubic ones,\nconfirmed that a similar interrelation property exists between\nbiquartic and bicubic polynomial surfaces as well.\nWe prove that a 2\u00d72-component C1 -class bicubic Hermite\nspline will be of class C2 if an equispaced grid is used and\nthe coefficients of the spline components are computed\nfrom a corresponding biquartic polynomial. It implies that\na 2\u00d72 uniform clamped spline surface can be constructed\nwithout solving any equation. The applicability of this biquartic\npolynomials based approach to reducing dimensionalitywhile\ncomputing spline surfaces is demonstrated\non an example.<\/jats:p>","DOI":"10.1515\/comp-2016-0001","type":"journal-article","created":{"date-parts":[[2016,2,24]],"date-time":"2016-02-24T20:59:02Z","timestamp":1456347542000},"page":"1-7","source":"Crossref","is-referenced-by-count":4,"title":["Bicubic splines and biquartic polynomials"],"prefix":"10.1515","volume":"6","author":[{"given":"Luk\u00e1\u0161","family":"Mino","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Faculty of Science , P.J. \u0160af\u00e1rik University in Ko\u0161ice , Jesenn\u00e1 5, 040 01 Ko\u0161ice , Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imrich","family":"Szab\u00f3","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Faculty of Science , P.J. \u0160af\u00e1rik University in Ko\u0161ice , Jesenn\u00e1 5, 040 01 Ko\u0161ice , Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba","family":"T\u00f6r\u00f6k","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Faculty of Science , P.J. \u0160af\u00e1rik University in Ko\u0161ice , Jesenn\u00e1 5, 040 01 Ko\u0161ice , Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2016,2,22]]},"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/comp\/6\/1\/article-p1.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2016-0001\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2016-0001\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T08:57:03Z","timestamp":1651049823000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2016-0001\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,2,22]]},"published-print":{"date-parts":[[2016,1,1]]}},"alternative-id":["10.1515\/comp-2016-0001"],"URL":"https:\/\/doi.org\/10.1515\/comp-2016-0001","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,1]]}}}