A Hierarchical Model for Multiresolution Surface Reconstruction

Andreas Voigtmann , Ludger Becker, Klaus Hinrichs
{"title":"A Hierarchical Model for Multiresolution Surface Reconstruction","authors":"Andreas Voigtmann ,&nbsp;Ludger Becker,&nbsp;Klaus Hinrichs","doi":"10.1006/gmip.1997.0436","DOIUrl":null,"url":null,"abstract":"<div><p>The approximation of topographical surfaces is required in a variety of disciplines, for example, computer graphics and geographic information systems (GIS). The constrained Delaunay pyramid is a hierarchical model for approximating 2<span><math><mtext>1</mtext><mtext>2</mtext></math></span>-dimensional surfaces at a variety of predefined resolutions. Basically, the topographical data are given by a set of three-dimensional points, but an additional set of nonintersecting line segments describing linear surface features like valleys, ridges, and coast lines is required to constrain the representation. The approximation is obtained by computing a constrained Delaunay triangulation for each resolution. The model generalizes the constraints at coarse resolutions. Due to its structure, the constrained Delaunay pyramid efficiently supports browsing and zooming in large data sets stored in database systems underlying the GIS. For very large data sets, a divide-and-conquer approach allows the computation of the constrained Delaunay pyramid on secondary storage.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"59 5","pages":"Pages 333-348"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1997.0436","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphical Models and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1077316997904366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

The approximation of topographical surfaces is required in a variety of disciplines, for example, computer graphics and geographic information systems (GIS). The constrained Delaunay pyramid is a hierarchical model for approximating 212-dimensional surfaces at a variety of predefined resolutions. Basically, the topographical data are given by a set of three-dimensional points, but an additional set of nonintersecting line segments describing linear surface features like valleys, ridges, and coast lines is required to constrain the representation. The approximation is obtained by computing a constrained Delaunay triangulation for each resolution. The model generalizes the constraints at coarse resolutions. Due to its structure, the constrained Delaunay pyramid efficiently supports browsing and zooming in large data sets stored in database systems underlying the GIS. For very large data sets, a divide-and-conquer approach allows the computation of the constrained Delaunay pyramid on secondary storage.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多分辨率曲面重建的层次模型
地形表面的近似在许多学科中都需要,例如,计算机图形学和地理信息系统(GIS)。约束德劳内金字塔是一种以各种预定义分辨率近似212维曲面的分层模型。基本上,地形数据是由一组三维点给出的,但需要额外的一组不相交的线段来描述线性表面特征,如山谷、山脊和海岸线,以约束表示。近似是通过计算每个分辨率的约束Delaunay三角剖分得到的。该模型在粗分辨率下推广约束。由于其结构,受约束的Delaunay金字塔有效地支持浏览和缩放存储在GIS底层数据库系统中的大型数据集。对于非常大的数据集,分而治之的方法允许在二级存储上计算受约束的Delaunay金字塔。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ERRATUM Two-Dimensional Direction-Based Interpolation with Local Centered Moments On Computing Contact Configurations of a Curved Chain Unification of Distance and Volume Optimization in Surface Simplification REVIEWER ACKNOWLEDGMENT
×
引用
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