{"title":"An isotropic four-point interpolation based on cubic splines","authors":"Koichi Harada, Eihachiro Nakamae","doi":"10.1016/0146-664X(82)90086-7","DOIUrl":null,"url":null,"abstract":"<div><p>A more efficient algorithm than that of J. E. Midgley (<em>Computer Graphics and Image Processing</em><strong>11</strong>, 1979, 192–196) is given for smooth curve construction; the amount of calculation required is diminished, and the three major conditions (local, isotropic, and applicable to curves in an arbitrary number of dimensions), strongly required for data interpolation, are also satisfied by our method. The new method is based on cubic spline interpolation, while Midgley's is based on circular interpolation.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Pages 283-287"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90086-7","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0146664X82900867","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
A more efficient algorithm than that of J. E. Midgley (Computer Graphics and Image Processing11, 1979, 192–196) is given for smooth curve construction; the amount of calculation required is diminished, and the three major conditions (local, isotropic, and applicable to curves in an arbitrary number of dimensions), strongly required for data interpolation, are also satisfied by our method. The new method is based on cubic spline interpolation, while Midgley's is based on circular interpolation.