Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions

B. Morse, T. Yoo, P. Rheingans, David T. Chen, K. Subramanian
{"title":"Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions","authors":"B. Morse, T. Yoo, P. Rheingans, David T. Chen, K. Subramanian","doi":"10.1109/SMA.2001.923379","DOIUrl":null,"url":null,"abstract":"Describes algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sampling. These methods were first applied to implicit surfaces by V.V. Savchenko, et al. (1995) and later developed independently by G. Turk and J.F. O'Brien (1998) as a means of performing shape interpolation. Earlier approaches were limited as a modeling mechanism because of the order of the computational complexity involved. We explore and extend these implicit interpolating methods to make them suitable for systems of large numbers of scattered surface points by using compactly supported radial basis interpolants. The use of compactly supported elements generates a sparse solution space, reducing the computational complexity and making the technique practical for large models. The local nature of compactly supported radial basis functions permits the use of computational techniques and data structures such as k-d trees for spatial subdivision, promoting fast solvers and methods to divide and conquer many of the subproblems associated with these methods. Moreover, the representation of complex models permits the exploration of diverse surface geometry. This reduction in computational complexity enables the application of these methods to the study of the shape properties of large, complex shapes.","PeriodicalId":247602,"journal":{"name":"Proceedings International Conference on Shape Modeling and Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"429","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Conference on Shape Modeling and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SMA.2001.923379","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 429

Abstract

Describes algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sampling. These methods were first applied to implicit surfaces by V.V. Savchenko, et al. (1995) and later developed independently by G. Turk and J.F. O'Brien (1998) as a means of performing shape interpolation. Earlier approaches were limited as a modeling mechanism because of the order of the computational complexity involved. We explore and extend these implicit interpolating methods to make them suitable for systems of large numbers of scattered surface points by using compactly supported radial basis interpolants. The use of compactly supported elements generates a sparse solution space, reducing the computational complexity and making the technique practical for large models. The local nature of compactly supported radial basis functions permits the use of computational techniques and data structures such as k-d trees for spatial subdivision, promoting fast solvers and methods to divide and conquer many of the subproblems associated with these methods. Moreover, the representation of complex models permits the exploration of diverse surface geometry. This reduction in computational complexity enables the application of these methods to the study of the shape properties of large, complex shapes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用紧支持的径向基函数从分散的表面数据插值隐式曲面
描述使用径向基插值的线性组合创建隐式曲面的代数方法,以从分散的曲面点形成复杂模型。具有任意拓扑的形状很容易表示,而没有通常的插值或混叠误差引起的离散采样。这些方法首先由V.V. Savchenko等人(1995)应用于隐式曲面,后来由G. Turk和J.F. O'Brien(1998)独立开发,作为执行形状插值的手段。由于所涉及的计算复杂性的顺序,早期的方法作为一种建模机制受到限制。我们探索并扩展了这些隐式插值方法,利用紧支撑径向基插值使其适用于大量分散曲面点的系统。紧支持元素的使用产生了一个稀疏的解空间,降低了计算复杂度,使该技术适用于大型模型。紧支持径向基函数的局部特性允许使用计算技术和数据结构,如k-d树进行空间细分,促进快速求解器和方法来划分和征服与这些方法相关的许多子问题。此外,复杂模型的表示允许探索不同的表面几何形状。计算复杂度的降低使这些方法能够应用于研究大型复杂形状的形状特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Partition along characteristic edges of a digitized point cloud Automatic knot determination of NURBS for interactive geometric design The 'thermodynamics' of shape Surface representation using second, fourth and mixed order partial differential equations Constant-time neighbor finding in hierarchical tetrahedral meshes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1