Quadric Polynomial Interpolation Based on Minimum Local Stretching Energy

Shanshan Gao, Jing Chi, Caiming Zhang
{"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}
引用次数: 0

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.
基于最小局部拉伸能量的二次多项式插值
本文提出了一种构造具有离散数据点的C1多项式曲面的方法。首先将给定的数据点划分成三角形网络,然后在每个点的相邻区域构造一个C1分段二次插值patch。根据拉伸应变能构造目标函数。通过最小化目标函数来确定未知量,最终得到公平的插值曲面。构造的曲面具有给定数据点所建议的形状。最后通过算例对比验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信