{"title":"参数三次样条插值曲线的快速生成算法","authors":"Jian-ao Lian","doi":"10.36227/techrxiv.19154132","DOIUrl":null,"url":null,"abstract":"For any two or three dimensional dataset given as an open or closed piecewise linear function, two algorithms are established for constructing G1 and G2 parametric cubic splines that interpolate the given dataset. These algorithms do not require any additional tangent direction information at each datapoint or any boundary conditions. One algorithm is specif-ically formulated for the unique local least square parametric cubic spline interpolation, so that a given dataset can be best approximated through appropriately defined local least squares approximation. Simple examples will be used to illustrate the algorithms and various datasets will also be demonstrated to show the efficiency of the algorithms.","PeriodicalId":273927,"journal":{"name":"2022 5th International Conference on Information and Computer Technologies (ICICT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast Algorithms for Generating Parametric Cubic Spline Interpolation Curves\",\"authors\":\"Jian-ao Lian\",\"doi\":\"10.36227/techrxiv.19154132\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For any two or three dimensional dataset given as an open or closed piecewise linear function, two algorithms are established for constructing G1 and G2 parametric cubic splines that interpolate the given dataset. These algorithms do not require any additional tangent direction information at each datapoint or any boundary conditions. One algorithm is specif-ically formulated for the unique local least square parametric cubic spline interpolation, so that a given dataset can be best approximated through appropriately defined local least squares approximation. Simple examples will be used to illustrate the algorithms and various datasets will also be demonstrated to show the efficiency of the algorithms.\",\"PeriodicalId\":273927,\"journal\":{\"name\":\"2022 5th International Conference on Information and Computer Technologies (ICICT)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 5th International Conference on Information and Computer Technologies (ICICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.36227/techrxiv.19154132\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th International Conference on Information and Computer Technologies (ICICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36227/techrxiv.19154132","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast Algorithms for Generating Parametric Cubic Spline Interpolation Curves
For any two or three dimensional dataset given as an open or closed piecewise linear function, two algorithms are established for constructing G1 and G2 parametric cubic splines that interpolate the given dataset. These algorithms do not require any additional tangent direction information at each datapoint or any boundary conditions. One algorithm is specif-ically formulated for the unique local least square parametric cubic spline interpolation, so that a given dataset can be best approximated through appropriately defined local least squares approximation. Simple examples will be used to illustrate the algorithms and various datasets will also be demonstrated to show the efficiency of the algorithms.