一种基于平衡二叉树的相邻深度区相同深度值检查算法  

An algorithm for checking the same depth value in adjacent areas based on balanced binary tree

作　　者：张羿祺 王磊 吴芳华[3,4] ZHANG Yiqi;WANG Lei;WU Fanghua(School of Resource and Environmental Sciences,Wuhan University,Wuhan 430072,China;Xi'an Aerospace Remote Sensing Data Technology Co.,Ltd.,Xi'an 710061,China;Xi'an Research Institute of Surveying and Mapping,Xi'an 710054,China;State Key Laboratory of Geo-Information Engineering,Xi'an 710054,China)

机构地区：[1]武汉大学资源与环境科学学院,湖北武汉430072 [2]西安航天天绘数据技术有限公司,陕西西安710061 [3]西安测绘研究所,陕西西安710054 [4]地理信息工程国家重点实验室,陕西西安710054

出　　处：《测绘科学与工程》2020年第1期46-50,共5页Geomatics Science and Engineering

基　　金：国家973计划资助项目(613317)。

摘　　要：深度区是海图的重要要素,按照相关矢量海图数据产品规范要求,相邻深度区应具有不同的深度值,但在数据采集作业中,容易出现相邻深度区深度值相同的质量问题,因此相邻深度区深度值相同问题检查是矢量海图数据质量检查中必不可少的检查项。在矢量海图数据中,由于深度区数据量大,利用传统的穷举法检查相邻深度区深度值相同问题需要花费较多的计算时间,在实际中并不实用。本文提出了一种基于平衡二叉树的相邻深度区相同深度值问题检查算法,经验证,算法能够高效地检查相邻深度区深度值相同的错误。The depth area is an important element of the vector chart.According to the relevant vector chart data product specifications,adjacent depth areas should have different depth values.However,there is always a quality problem that the depth values in adjacent areas are the same in data collection.Therefore,it is necessary to check the depth values of adjacent depth areas in the quality check of vector chart data.Due to the large amount of data in the depth area,the traditional exhaustive method will be time-consuming and impractical.In this paper,an algorithm based on balanced binary tree is proposed for checking the depth values of adjacent depth areas.It has been verified that this algorithm can effectively detect the error of the same depth value in adjacent depth areas.

关 键 词：矢量地图数据 深度区 质量检查 平衡二叉树 

分 类 号：P208[天文地球—地图制图学与地理信息工程]