地球信息科学学报

地球信息科学学报 ›› 2017, Vol. 19 ›› Issue (10): 1306-1314.doi: 10.3724/SP.J.1047.2017.01306

• 地球信息科学与应用技术 • 上一篇    下一篇

邻域扩展法辅助的陆地争议区划界

冯长强1,2(), 华一新2, 张晓楠3, 曹一冰2, 武丽丽2, 崔虎平2   

  1. 1. 西安测绘研究所,西安 710054
    2. 信息工程大学,郑州 450001
    3. 空军航空大学,长春 130022
  • 收稿日期:2017-04-26 修回日期:2017-07-11 出版日期:2017-10-20 发布日期:2017-10-20
  • 作者简介:

    作者简介：冯长强（1988-）,男,博士生,主要从事地理信息系统应用、地缘环境分析与建模研究。E-mail: luckystar1682006@126.com

  • 基金资助:
    国家科技支撑计划项目（2012BAK12B00）;国家自然科学基金面上项目（41471336）;地理信息工程国家重点实验室开放研究基金项目（SKLGIE2015-M-4-4）

Delimitation of Land Disputed Area by Neighborhood Expansion Method

FENG Changqiang1,2,*(), HUA Yixin2, ZHANG Xiaonan3, CAO Yibing2, WU Lili2, CUI Huping2   

  1. 1. Xi′an Research Institute of Surveying and Mapping, Xi’an 710054, China
    2. Information Engineering University, Zhengzhou 450001, China
    3. Air Force Aviation University, Changchun 130022, China
  • Received:2017-04-26 Revised:2017-07-11 Online:2017-10-20 Published:2017-10-20
  • Contact: FENG Changqiang

RichHTML

PDF (PC)

赞

摘要：

已有计算机辅助划界方法难以充分维护单方资源利益且效率不够理想,本文基于利益密度及区域完整性视角提出一种邻域扩展法辅助的陆地争议区划界方法。首先,利用六角格构建争议区环境模型,计算并处理六角格的利益密度;其次,以利益密度及区域完整性为导向,利用邻域扩展法对争议区进行初始划分;再次,通过扩展单源六角格最优路径算法求解通往飞地的最佳路径,并基于一定原则对飞地归属进行再次划分;最后,辅以邻域扩展法对争议区进行精确分割。采用模拟数据、不同格网尺寸及不同面积比例进行实验,结果表明本文方法具有如下特点：① 能够对双方既定的必争区域及不可穿越区域进行正确划分;② 能够依双方约定面积比例对争议区进行快速精确分割;③ 能够充分维护单方资源利益优势,验证了本文方法的有效性及可靠性。

关键词: 谈判划界, 利益密度, 区域完整性, 邻域扩展法, 多源六角格最优路径算法

Abstract:

Now, there are still many land border territory disputes causing local wars or unstableness between countries. Under the current international situation, negotiation is the most effective method of solving territory disputes and it needs lots of demarcation technology. Current demarcation methods cannot fully safeguard unilateral resource interest and it costs lots of time. Thus, we proposed a new solution using neighborhood expansion method (NEM). Firstly, the disputed area was split using hexagon where related information such as resource reserve was mapped, and benefit density (BD), which is the comprehensive evaluation value of related resources in each grid, was calculated and disposed. Secondly, the disputed area was initially divided using NEM under the guide of regional integrity, BD and bilateral agreed area ratio, where most hexagons with higher BD were assigned to the related country. Thirdly, the single-source optimal path algorithm based on hexagon was improved to solve the optimal path from non-enclave to enclave caused during the initial segmentation of disputed area. The ascriptions of all the enclaves were determined once again based on some rules. Finally, the integrity of unilateral region was optimized, the gap between the unilateral area and the agreed area was reduced to the extent smaller than the area of single complete grid using NEM. The disputed zone was split accurately according to the agreed area ratio. Tests were made to compare our method with the other one using genetic algorithm based on simulated data, different hexagon sizes and agreed area ratios. The results indicated that our method owns the following characteristics: (1) it can correctly assign bilateral agreed never-lost regions and impenetrable areas like ethnic settlements; (2) the disputed area can be divided fast and precisely according to agreed area ratio; (3) it can fully safeguard unilateral resource interest. These features indicate that our method is effective and reliable and it can provide important reference and guide for one-side delimitation.

Key words: negotiation delimitation, benefit density, regional integrity, neighborhood expansion method, multi-source optimal path