Minimum spanning trees for valley and ridge characterization in digital elevation maps

S. Bangay, David de Bruyn, Kevin R. Glass
{"title":"Minimum spanning trees for valley and ridge characterization in digital elevation maps","authors":"S. Bangay, David de Bruyn, Kevin R. Glass","doi":"10.1145/1811158.1811171","DOIUrl":null,"url":null,"abstract":"Texture synthesis employs neighbourhood matching to generate appropriate new content. Terrain synthesis has the added constraint that new content must be geographically plausible. The profile recognition and polygon breaking algorithm (PPA) [Chang et al. 1998] provides a robust mechanism for characterizing terrain as systems of valley and ridge lines in digital elevation maps. We exploit this to create a terrain characterization metric that is robust, efficient to compute and is sensitive to terrain properties.\n Terrain regions are characterized as a minimum spanning tree derived from a graph created from the sample points of the elevation map which are encoded as weights in the edges of the graph. This formulation allows us to provide a single consistent feature definition that is sensitive to the pattern of ridges and valleys in the terrain Alternative formulations of these weights provide richer characteristic measures and we provide examples of alternate definitions based on curvature and contour measures.\n We show that the measure is robust, with a significant portion derived directly from information local to the terrain sample. Global terrain characteristics introduce the issue of over- and under-connected valley/ridge lines when working with sub-regions. This is addressed by providing two graph construction strategies, which respectively provide an upper bound on connectivity as a single spanning tree, and a lower bound as a forest of trees.\n Efficient minimum spanning tree algorithms are adapted to the context of terrain data and are shown to provide substantially better performance than previous PPA implementations. In particular, these are able to characterize valley and ridge behaviour at every point even in large elevation maps, providing a measure sensitive to terrain features at all scales.\n The resulting graph based formulation provides an efficient and elegant algorithm for characterizing terrain features. The measure can be calculated efficiently, is robust under changes of neighbourhood position, size and resolution and the hybrid measure is sensitive to terrain features both locally and globally.","PeriodicalId":325699,"journal":{"name":"International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1811158.1811171","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Texture synthesis employs neighbourhood matching to generate appropriate new content. Terrain synthesis has the added constraint that new content must be geographically plausible. The profile recognition and polygon breaking algorithm (PPA) [Chang et al. 1998] provides a robust mechanism for characterizing terrain as systems of valley and ridge lines in digital elevation maps. We exploit this to create a terrain characterization metric that is robust, efficient to compute and is sensitive to terrain properties. Terrain regions are characterized as a minimum spanning tree derived from a graph created from the sample points of the elevation map which are encoded as weights in the edges of the graph. This formulation allows us to provide a single consistent feature definition that is sensitive to the pattern of ridges and valleys in the terrain Alternative formulations of these weights provide richer characteristic measures and we provide examples of alternate definitions based on curvature and contour measures. We show that the measure is robust, with a significant portion derived directly from information local to the terrain sample. Global terrain characteristics introduce the issue of over- and under-connected valley/ridge lines when working with sub-regions. This is addressed by providing two graph construction strategies, which respectively provide an upper bound on connectivity as a single spanning tree, and a lower bound as a forest of trees. Efficient minimum spanning tree algorithms are adapted to the context of terrain data and are shown to provide substantially better performance than previous PPA implementations. In particular, these are able to characterize valley and ridge behaviour at every point even in large elevation maps, providing a measure sensitive to terrain features at all scales. The resulting graph based formulation provides an efficient and elegant algorithm for characterizing terrain features. The measure can be calculated efficiently, is robust under changes of neighbourhood position, size and resolution and the hybrid measure is sensitive to terrain features both locally and globally.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
数字高程图中山谷和山脊特征的最小生成树
纹理合成采用邻域匹配生成合适的新内容。地形合成有附加约束,即新内容必须在地理上合理。轮廓识别和多边形分割算法(PPA) [Chang et al. 1998]为在数字高程地图中将地形表征为山谷和山脊线系统提供了一种强大的机制。我们利用这一点来创建一个地形特征度量,该度量鲁棒,计算效率高,对地形属性敏感。地形区域的特征是由高程图的样本点创建的图派生的最小生成树,这些点在图的边缘被编码为权重。该公式允许我们提供对地形中山脊和山谷的模式敏感的单一一致的特征定义,这些权重的替代公式提供了更丰富的特征度量,我们提供了基于曲率和轮廓度量的替代定义的示例。结果表明,该方法具有鲁棒性,其中很大一部分直接来自地形样本的局部信息。在处理子区域时,全球地形特征引入了过度连接和欠连接的山谷/山脊线问题。通过提供两种图构建策略来解决这个问题,这两种策略分别提供了连接的上界作为单个生成树,下界作为树的森林。有效的最小生成树算法适用于地形数据的上下文,并显示出比以前的PPA实现提供更好的性能。特别是,即使在大型高程图中,它们也能够在每个点上表征山谷和山脊的行为,从而提供对所有尺度的地形特征敏感的测量。由此产生的基于图的公式为地形特征的表征提供了一种高效而优雅的算法。该方法计算效率高,对邻域位置、大小和分辨率变化具有较强的鲁棒性,对局部和全局地形特征都很敏感。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Progressive RBF interpolation Automatic addition of physics components to procedural content Out-of-core real-time visualization of massive 3D point clouds Implementation of the Lucas-Kanade image registration algorithm on a GPU for 3D computational platform stabilisation Adaptive LOD editing of quad 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