Piecewise-linear surface approximation from noisy scattered samples

M. Margaliot, C. Gotsman
{"title":"Piecewise-linear surface approximation from noisy scattered samples","authors":"M. Margaliot, C. Gotsman","doi":"10.1109/VISUAL.1994.346336","DOIUrl":null,"url":null,"abstract":"We consider the problem of approximating a smooth surface f(x, y), based on n scattered samples {(x/sub i/, y/sub i/, z/sub i/)/sub i=1//sup n/} where the sample values {z/sub i/} are contaminated with noise: z/sub i/=f(x/sub i/, y/sub i/)=/spl epsiv//sub i/. We present an algorithm that generates a PLS (piecewise linear surface) f', defined on a triangulation of the sample locations V={(x/sub i/, y/sub i/)/sub i=1//sup n/}, approximating f well. Constructing the PLS involves specifying both the triangulation of V and the values of f' at the points of V. We demonstrate that even when the sampling process is not noisy, a better approximation for f is obtained using our algorithm, compared to existing methods. This algorithm is useful for DTM (digital terrain map) manipulation by polygon-based graphics engines for visualization applications.<<ETX>>","PeriodicalId":273215,"journal":{"name":"Proceedings Visualization '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Visualization '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VISUAL.1994.346336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

We consider the problem of approximating a smooth surface f(x, y), based on n scattered samples {(x/sub i/, y/sub i/, z/sub i/)/sub i=1//sup n/} where the sample values {z/sub i/} are contaminated with noise: z/sub i/=f(x/sub i/, y/sub i/)=/spl epsiv//sub i/. We present an algorithm that generates a PLS (piecewise linear surface) f', defined on a triangulation of the sample locations V={(x/sub i/, y/sub i/)/sub i=1//sup n/}, approximating f well. Constructing the PLS involves specifying both the triangulation of V and the values of f' at the points of V. We demonstrate that even when the sampling process is not noisy, a better approximation for f is obtained using our algorithm, compared to existing methods. This algorithm is useful for DTM (digital terrain map) manipulation by polygon-based graphics engines for visualization applications.<>
噪声散射样本的分段线性表面逼近
我们考虑基于n个分散样本{(x/下标i/, y/下标i/, z/下标i/)/下标i=1//sup n/}逼近光滑表面f(x, y)的问题,其中样本值{z/下标i/}被噪声污染:z/下标i/=f(x/下标i/, y/下标i/)=/spl epsiv//下标i/。我们提出了一种生成PLS(分段线性曲面)f'的算法,它定义在样本位置V={(x/下标i/, y/下标i/)/下标i=1//sup n/}的三角剖分上,很好地逼近了f。构造PLS涉及指定V的三角剖分和V点处的f'值。我们证明,即使在采样过程没有噪声的情况下,与现有方法相比,使用我们的算法可以获得更好的f近似值。该算法可用于基于多边形的图形引擎在可视化应用中处理DTM(数字地形图)
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信