| 离散目标群的边界搜索 |
| |
| 引用本文： | 王延亮,刘登杰.离散目标群的边界搜索[J].测绘科学,2007,32(5):101-102. |
| |
| 作者姓名： | 王延亮 刘登杰 |
| |
| 作者单位： | 黑龙江工程学院,哈尔滨,150050 |
| |
| 基金项目： | 黑龙江省教育厅空间地理信息综合重点实验室开放基金项目 |
| |
| 摘 要： | 搜索离散目标群的边界是地理信息系统(GIS)和地图学中一个重要问题,传统的算法是基于矢量数据的。本文提出了基于栅格数据搜索离散目标群的边界的新方法,并用两个点群算例介绍了用闭运算搜索边界的方法与流程,为数字高程模型生成、地图学等提供一种新的边界搜索方法。
|
| 关 键 词： | 边界搜索 离散目标 膨胀和腐蚀 闭运算 |
| 文章编号： | 1009-2307（2007）05-0101-02 |
| 修稿时间： | 2006-12-29 |
Boundary searching of discrete object group |
| |
| WANG Yan-liang,LIU Deng-jie.Boundary searching of discrete object group[J].Science of Surveying and Mapping,2007,32(5):101-102. |
| |
| Authors: | WANG Yan-liang LIU Deng-jie |
| |
| Abstract: | In GIS and cartology,the boundary searching of discrete object group is an important problem.The traditional algorithm is based on vector data.A new algorithm based on raster data is put forward in this paper.The method and procedure,which are used to search boundary by closing operation,are presented within two examples of calculating point cluster.This new method provides a new boundary searching for DEM generation and cartology. |
| |
| Keywords: | boundary searching discrete object dilation and erosion closing operation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
