{"title":"基于最小局部拉伸能量的二次多项式插值","authors":"Shanshan Gao, Jing Chi, Caiming Zhang","doi":"10.1109/CIT.2008.WORKSHOPS.79","DOIUrl":null,"url":null,"abstract":"This paper presents a method to construct C1 polynomial surface with scattered data points. At first the given data points are divided into triangular networks, and then at the adjacent region of each point a C1 piecewise quadric interpolation patch is constructed. Objective function according to the stretching strain energy is constructed. Minimizing the objective function to determine the unknown quantities, and at last achieves fair interpolating surface. The constructed surface has the shape suggested by the given data points. At last comparison examples are included to prove the efficiency of the new method.","PeriodicalId":155998,"journal":{"name":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quadric Polynomial Interpolation Based on Minimum Local Stretching Energy\",\"authors\":\"Shanshan Gao, Jing Chi, Caiming Zhang\",\"doi\":\"10.1109/CIT.2008.WORKSHOPS.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a method to construct C1 polynomial surface with scattered data points. At first the given data points are divided into triangular networks, and then at the adjacent region of each point a C1 piecewise quadric interpolation patch is constructed. Objective function according to the stretching strain energy is constructed. Minimizing the objective function to determine the unknown quantities, and at last achieves fair interpolating surface. The constructed surface has the shape suggested by the given data points. At last comparison examples are included to prove the efficiency of the new method.\",\"PeriodicalId\":155998,\"journal\":{\"name\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 IEEE 8th International Conference on Computer and Information Technology Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIT.2008.WORKSHOPS.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 8th International Conference on Computer and Information Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIT.2008.WORKSHOPS.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quadric Polynomial Interpolation Based on Minimum Local Stretching Energy
This paper presents a method to construct C1 polynomial surface with scattered data points. At first the given data points are divided into triangular networks, and then at the adjacent region of each point a C1 piecewise quadric interpolation patch is constructed. Objective function according to the stretching strain energy is constructed. Minimizing the objective function to determine the unknown quantities, and at last achieves fair interpolating surface. The constructed surface has the shape suggested by the given data points. At last comparison examples are included to prove the efficiency of the new method.