摘要
搜索离散目标群的边界是地理信息系统(GIS)和地图学中一个重要问题,传统的算法是基于矢量数据的。本文提出了基于栅格数据搜索离散目标群的边界的新方法,并用两个点群算例介绍了用闭运算搜索边界的方法与流程,为数字高程模型生成、地图学等提供一种新的边界搜索方法。
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.
出处
《测绘科学》
CSCD
北大核心
2007年第5期101-102,共2页
Science of Surveying and Mapping
基金
黑龙江省教育厅空间地理信息综合重点实验室开放基金项目
关键词
边界搜索
离散目标
膨胀和腐蚀
闭运算
boundary searching
discrete object
dilation and erosion
closing operation
