{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T10:42:56Z","timestamp":1648896176697},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Aided Geometric Design"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0167-8396(92)90015-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:41:40Z","timestamp":1027654900000},"page":"175-183","source":"Crossref","is-referenced-by-count":4,"title":["Another knot insertion algorithm for B-spline curves"],"prefix":"10.1016","volume":"9","author":[{"given":"Phillip J.","family":"Barry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui-Feng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8396(92)90015-H_BIB1","article-title":"Knot insertion algorithms","author":"Barry","year":"1992"},{"key":"10.1016\/0167-8396(92)90015-H_BIB2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0010-4485(80)90154-2","article-title":"Inserting new knots into B-spline curves","volume":"12","author":"Boehm","year":"1980","journal-title":"Computer-Aided Design"},{"key":"10.1016\/0167-8396(92)90015-H_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0167-8396(85)90017-2","article-title":"On the efficiency of knot insertion algorithms","volume":"2","author":"Boehm","year":"1985","journal-title":"Computer Aided Geometric Design"},{"key":"10.1016\/0167-8396(92)90015-H_BIB4","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0010-4485(85)90246-5","article-title":"The insertion algorithm","volume":"17","author":"Boehm","year":"1985","journal-title":"Computer-Aided Design"},{"key":"10.1016\/0167-8396(92)90015-H_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0146-664X(80)90040-4","article-title":"Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics","volume":"14","author":"Cohen","year":"1980","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/0167-8396(92)90015-H_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0167-8396(90)90022-J","article-title":"Blossoming and knot insertion algorithms for B-spline curves","volume":"7","author":"Goldman","year":"1990","journal-title":"Computer Aided Geometric Design"},{"key":"10.1016\/0167-8396(92)90015-H_BIB7","article-title":"Algorithms for progressive curves: Extending B-spline and blossoming techniques to the monomial, power, and Newton dual bases","author":"Goldman","year":"1992"},{"key":"10.1016\/0167-8396(92)90015-H_BIB8","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/0723042","article-title":"Making the Oslo algorithm more efficient","volume":"23","author":"Lyche","year":"1986","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0167-8396(92)90015-H_BIB9","article-title":"Blossoming: a connect-the-dots approach to splines","author":"Ramshaw","year":"1987","journal-title":"Digital Equipment Systems Research Center Technical Report #19"},{"key":"10.1016\/0167-8396(92)90015-H_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0167-8396(89)90032-0","article-title":"Blossoms are polar forms","volume":"6","author":"Ramshaw","year":"1989","journal-title":"Computer Aided Geometric Design"},{"key":"10.1016\/0167-8396(92)90015-H_BIB11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-8396(89)90004-6","article-title":"A new multiaffine approach to splines","volume":"6","author":"Seidel","year":"1989","journal-title":"Computer Aided Geometric Design"}],"container-title":["Computer Aided Geometric Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016783969290015H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016783969290015H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:20:15Z","timestamp":1555140015000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016783969290015H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["016783969290015H"],"URL":"https:\/\/doi.org\/10.1016\/0167-8396(92)90015-h","relation":{},"ISSN":["0167-8396"],"issn-type":[{"value":"0167-8396","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}