Morphing Linear Features Based on Their Entire Structures
Morphing Linear Features Based on Their Entire Structures
复制标题
DOI：
10.1111/tgis.12111
复制
发表时间：
2015-10-01
影响因子：
2.4
通讯作者：
Peng, Dongliang
中科院分区：
文献类型：
--
作者：
Deng, Min;Peng, Dongliang
本文提出了一种新的基于整体结构的两个线状要素在不同尺度下的变形方法（MLBES）。首先，线性要素的弯曲结构通过使用约束Delaunay三角剖分（CDT在缩写）模型识别和二叉弯曲结构树表示。通过匹配由弯曲结构树表示的独立弯曲，得到对应的独立弯曲。这些对应的独立折弯进一步用于基于分层弯曲结构匹配其子折弯，从而获得对应折弯。在此基础上，通过相应折弯的起点和终点将两个线状要素拆分为相应的子折线对。其次，通过Douglas-Peucker算法识别相应子折线的结构，并用二叉线综合树（BLG-树）表示。通过匹配BLG树的节点，将相应的子多段线拆分为较小的相应子多段线。第三，对每对对应的子折线采用线性插值算法确定对应点。最后，直线轨迹生成一个家庭的中等规模的线性功能。通过与其他方法的比较，发现MLBES是准确和有效的。
In this article, a new morphing method is proposed for two linear features at different scales, based on their entire structures (MLBES in abbreviation). First, the bend structures of the linear features are identified by using a constrained Delaunay triangulation (CDT in abbreviation) model and represented by binary bend-structure trees. By matching the independent bends represented by the bend-structure trees, corresponding independent bends are obtained. These corresponding independent bends are further used to match their child bends based on hierarchical bend structures so that corresponding bends are obtained. On this basis, the two linear features are split into pairs of corresponding subpolylines by the start and end points of the corresponding bends. Second, structures of the corresponding subpolylines are identified by the Douglas-Peucker algorithm and represented by binary line generalization trees (BLG-trees in abbreviation). The corresponding subpolylines are split into smaller corresponding subpolylines by matching the nodes of the BLG-trees. Third, the corresponding points are identified by using the linear interpolation algorithm for every pair of corresponding subpolylines. Finally, straight-line trajectories are employed to generate a family of intermediate-scale linear features. By comparison with other methods, it is found that MLBES is accurate and efficient.