共查询到16条相似文献，搜索用时 112 毫秒
1.
针对地图综合中解决空间冲突最复杂的移位算子,使地图地理要素清晰及其拓扑关系不变,该文以线要素为研究目标,利用Snake算法进行地图综合中的道路网移位,并且进行改进:1在线要素群移位前,引入了线要素的移位空间判断,找出其中可以移位的线目标和无法移位的线目标,将这两种目标分开移位,优先移动可以移位的线目标;2提出一种能确定线要素瓶颈特征的方法,并分析形状参数α、β的设置与曲线瓶颈特征的关系,保护线要素的瓶颈特征在移位中不被破坏;最后给出了道路网移位实例,证明了方法的有效性。 相似文献
2.
在地图自动编制中,有时多类地图要素多个空间目标之间同时发生空间冲突,在移位过程中会影响到邻近区域的地图目标,这就需要对地图要素移位进行协同处理。在自动识别邻近空间冲突区的条件下,提出了一种顾及地图制图规则的解决地图目标群空间冲突的协同处理方法,并用参数表方法形式化表达了地形图上地图要素移位的常用制图规则。首先利用约束性Delaunay三角网识别出可能的空间冲突区域,并建立移位操作区;然后,建立移位传播关联线网,依据制图规则在关联线网上以能量最小化Beam移位模型为基础,对整个空间冲突区的地图目标群进行协同移位;最后,用实验验证了所提方法的有效性和适用性。 相似文献
3.
4.
移位是解决地图制图和GIS中空间冲突的基本算子之一。Morphing变换可以实现源对象到目标对象的连续平滑变换,通过从两个方面拓展Morphing变换,从而实现对线要素进行移位。首先分析了线要素空间冲突的类型。在线要素弯曲识别的基础上,以弯曲作为冲突检查和线要素移位的基本单元;然后,用Delaunay三角网探测冲突区域,将冲突位置定义在局部的线要素弯曲(组);最后拓展Morphing变换实施线要素移位,即先对冲突发生弯曲(组)进行镜像变换,再对冲突发生弯曲(组)和它们的镜像进行Morphing变换,并给出了变换参数与移位距离和方向的定量关系。实验证明了该方法有效、可行。引入图形镜像避免了普通Morphing变换中的特征点识别和匹配等两个难点。将弯曲作为冲突发生的范围和化解冲突的操作单元,可以实现要素局部与全局移位的有机统一。 相似文献
5.
地图自动综合方法的研究进展（续） 总被引：1，自引：0，他引：1
接上期）六、要素冲突的自动移位方法地图要素冲突在ＤＬＭ综合和ＤＣＭ综合及其生成过程中都存在,要素的移位是地图综合必备的算子之一,地图可以看成是文字与点线面的相加,这是一种直观的理解。地图综合中的选取和算法的运用都必须考虑复杂的空间关系,这种空间关系的... 相似文献
6.
基于约束条件的地图目标移位 总被引：4，自引：0，他引：4
地图目标移位是地图综合和空间信息可视化研究中的一个重要问题,其难点是如何在移位过程中满足一定的约束条件以保持目标之间的空间关系。本文以城市道路扩张为例,借助带约束性Delaunay三角网,结合有限元和空间推理方法,重点探讨顾及空间关系的基于约束条件的地图目标移位问题,并给出满足一定约束条件下的节点移位算法和计算实例。 相似文献
7.
《武汉大学学报(信息科学版)》2016,(9)
地图上道路的移位、变形或符号化往往会产生道路与其周边建筑物的空间冲突。为了尽量保持道路旁的建筑物群沿线分布的基本规律,提出了把建筑物群移位转换为线移位问题的一种移位方法,能协同处理好道路与建筑物之间的空间冲突,并利用实验验证了所提出方法的合理性和有效性。该方法首先需要确定潜在的空间冲突区域,并依据空间冲突区内的地图要素类别确定空间冲突类型;然后,判断落入空间冲突区内的建筑物群,用建筑物中心点到道路的垂线表示建筑物与道路的关联关系,并把与这些落入空间冲突区域内的建筑物最邻近的距离小于阈值的建筑物归类到相应的建筑物子群,对每个这样的建筑物子群,建立其中心点的最小生成树(minimum spanning tree,MST);最后,把这些垂线、MST和道路看成一个线状要素网络,利用Snake模型进行协同移位处理。 相似文献
8.
9.
在分析有限元方法处理地图目标移位问题的基本思路和地图目标移位产生的空间关系冲突传播特征的基础上 ,提出了一个利用空间推理和有限元分析相结合的方法维护地图目标空间关系的算法 相似文献
10.
用计算机模拟人类制图员解决地图缩编中的图形冲突 总被引：9，自引：0，他引：9
费立凡 《武汉大学学报(信息科学版)》2004,29(5):426-432
针对地图综合中因道路符号的夸大表示而引起的道路与建筑物的图形冲突,提出了让计算机模拟人类制图员具备视觉及分析功能的具体方法,设计了一种新颖的栅格-矢量混合数据结构,以便通过将移位区内的所有建筑物分类,进行制图移位和受控变形等解决图形冲突。 相似文献
11.
《The Cartographic journal》2013,50(3):230-241
Map data at smaller scales than their source can result in spatial conflict, whereby map symbols become too close, or overlaid. Server map generalisation operators may be applied to solve this problem, including displacement. In this paper, we show how an optimisation algorithm, the snake algorithm, was used to displace multiple objects in order to resolve spatial conflicts and maintain important spatial relationships between objects during displacement. Two principles based on the snake algorithm are proposed in this paper. First, the truss structure mirroring spatial proximity relationships between buildings and between building and road is formed based on the weighted proximity graph derived from constrained Delaunay triangulations (CDT) in each map partition. In the weighted proximity graph, each connecting line is determined as a snake and as an element unit to assemble the global stiffness matrix in snake algorithm. Second, a buffer method that calculates force between a building and a road (or other linear features) or between pair of buildings is adopted in the snake algorithm. This avoids the imbalance phenomenon caused by different force calculation methods during the displacement. The feasibility of the approach is demonstrated in obtaining real geographic data. Finally, the results are cartographically usable and in particular, the spatial relationships between objects are preserved. 相似文献
12.
《制图学和地理信息科学》2013,40(4):317-331
Automation of map generalization requires facilities to monitor the spatial relationships and interactions among multiple map objects. An experimental map generalization system has been developed which addresses this issue by representing spatial objects within a simplicial data structure (SDS) based on constrained Delaunay triangulation of the source data. Geometric generalization operators that have been implemented include object exaggeration, collapse, amalgamation, boundary reduction and displacement. The generalization operators exploit a set of primitive SDS functions to determine topological and proximal relationships, measure map objects, apply transformations, and detect and resolve spatial conflicts. Proximal search functions are used for efficient analysis of the structure and dimensions of the intervening spaces between map objects. Because geometric generalization takes place within a fully triangulated representation of the map surface, the presence of overlap conflicts, resulting from individual operators, can be detected due to the introduction of singularities in the triangulation, the structure of which is used to generate displacement vectors to resolve the conflict. Examples of the application of the implemented operators are described and illustrated using large scale topographic map data. 相似文献
13.
In map generalization, displacement is the most frequently used operator to reduce the proximity conflicts caused by reducing scales or other generalization operations. Building displacement can be formalized as a combinatorial optimization problem, and a heuristic or intelligent search algorithm can be borrowed to obtain the solution. In this way, we can explicitly resolve minimum distance conflicts and control positional accuracy during the displacement. However, maintaining spatial relations and patterns of buildings can be challenging. To address spatial conflicts as well as preserve the significant spatial relations and patterns of buildings, we propose a new spatial contextual displacement algorithm based on an immune genetic algorithm. To preserve important spatial relations and global patterns of map objects and avoid topology errors, displacement safety zones are constructed by overlapping the Voronoi tessellation and buffer areas of the buildings. Additionally, a strategy to shift the buildings in a building group synchronously is used to maintain local building patterns. To demonstrate the effectiveness of our algorithm, two data sets with different building densities were tested. The results indicate that the new algorithm has obvious advantages in preventing topology errors and preserving spatial relations and patterns. 相似文献
14.
地图综合中,建筑物群的排列结构是需要重点考虑的因素。当不同排列的子建筑物群之间存在空间图形冲突时,这些建筑物群的综合就显得更为复杂。直线排列建筑物群的综合在大比例尺地形图上以典型化操作为主。本文提出一种相互之间存在潜在空间图形冲突的多个直线排列建筑物子群的渐进式典型化方法,渐进式地处理多个直线排列建筑物子群之间的空间图形冲突,保留建筑物群重要的直线排列结构;以建筑物表达的视觉图形约束为限制条件,自动确定典型化后的建筑物位置、形状、大小和方位。本文还研究了基于建筑物群空间邻近图的直线排列建筑物子群的自动识别方法,分析了这些直线排列之间的邻近关系和相交关系。最后,以1：5000地图上的建筑物群综合为1：25 000为试验对象,验证了所提出算法的可用性和有效性。 相似文献
15.
郭庆胜 《武汉大学学报(信息科学版)》1999,24(3):83
讨论了面状要素图形轮廓简化的一些规则以及面的空间知识获取方法,结合以直角方式转折的面状要素图形轮廓的特点,重点讨论了其图形渐进式简化方法。 相似文献
16.
Spatial conflicts may occur when map data are displayed at a scale smaller than that of the source map. This study applies the displacement operator in cartographic generalization to resolve such spatial conflicts and to improve the clarity and legibility of map. The immune genetic algorithm (IGA) is used in this study for buildings displacement to solve conflicts. IGA is based on the genetic algorithm (GA) and employs the self‐adjusting mechanism of antibody concentration to enhance population diversity. Meanwhile, the elitism retention strategy is adopted in IGA to guarantee that the best individual (antibody) is not lost and destroyed in the next generation to strengthen convergence efficiency. The compared experiment between IGA and GA shows that the displacement result produced by IGA performs better than GA. Finally, in order to make the displaced map more attractive to cartographers, two constraints – the building alignment constraint and building tangent relation constraint – are applied in IGA to restrict the buildings’ displacement. The same experimental data are adopted to prove that the improved IGA is useful for maintaining the two constraints. 相似文献