首页> 外文期刊>Computers & geosciences >A Voronoi interior adjacency-based approach for generating a contour tree
【24h】

A Voronoi interior adjacency-based approach for generating a contour tree

机译:基于Voronoi内部邻接的生成轮廓树的方法

获取原文
获取原文并翻译 | 示例

摘要

A contour tree is a good graphical tool for representing the spatial relations of contour lines and has found many applications in map generalization, map annotation, terrain analysis, etc. A new approach for generating contour trees by introducing a Voronoi-based interior adjacency set concept is proposed in this paper. The immediate interior adjacency set is employed to identify all of the children contours of each contour without contour elevations. It has advantages over existing methods such as the point-in-polygon method and the region growing-based method. This new approach can be used for spatial data mining and knowledge discovering, such as the automatic extraction of terrain features and construction of multi-resolution digital elevation model. (C) 2004 Elsevier Ltd. All rights reserved.
机译:轮廓树是表示轮廓线空间关系的良好图形工具,并且在地图概图,地图标注,地形分析等方面发现了许多应用。通过引入基于Voronoi的内部邻接集概念生成轮廓树的新方法本文提出。立即内部邻接集用于识别每个轮廓的所有子轮廓,而没有轮廓高程。它比现有方法(例如,多边形点方法和基于区域增长的方法)具有优势。这种新方法可用于空间数据挖掘和知识发现,例如自动提取地形特征和构建多分辨率数字高程模型。 (C)2004 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号