共查询到20条相似文献，搜索用时 609 毫秒
1.
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. 相似文献
2.
《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. 相似文献
3.
地图综合中,建筑物群的排列结构是需要重点考虑的因素。当不同排列的子建筑物群之间存在空间图形冲突时,这些建筑物群的综合就显得更为复杂。直线排列建筑物群的综合在大比例尺地形图上以典型化操作为主。本文提出一种相互之间存在潜在空间图形冲突的多个直线排列建筑物子群的渐进式典型化方法,渐进式地处理多个直线排列建筑物子群之间的空间图形冲突,保留建筑物群重要的直线排列结构;以建筑物表达的视觉图形约束为限制条件,自动确定典型化后的建筑物位置、形状、大小和方位。本文还研究了基于建筑物群空间邻近图的直线排列建筑物子群的自动识别方法,分析了这些直线排列之间的邻近关系和相交关系。最后,以1：5000地图上的建筑物群综合为1：25 000为试验对象,验证了所提出算法的可用性和有效性。 相似文献
4.
保持建筑物群的空间分布模式一致是道路与建筑物空间冲突处理问题的难点。按道路对建筑物的包围程度,将道路与建筑物之间的关系类型划分为开放型、半开放型和闭合型。本文提出了基于几何相似性的建筑物移位算法,并以距离、角度和面积作为满足几何相似性的约束条件。以道路网眼为单位,采用最小生成树的方法生成建筑物群的骨架,以骨架的长度和角度特征分别作为建筑物移位的距离和角度约束条件,以建筑物与网眼的面积比作为建筑物移位的面积约束条件。针对可能出现的次生冲突,探讨了次生冲突的处理方法。试验结果表明,本文方法能够消除因道路拓宽导致的道路与建筑物冲突,并能完备地保持建筑物群的空间分布模式。 相似文献
5.
在建筑物群的综合过程中,建筑物群的移位是一个非常重要的任务。在分析已有算法的基础上,探讨了建筑物群移位的一个新的自适应实数编码遗传算法,在该算法中,考虑了建筑物与街道之间的空间关系和建筑物群排列在图形表达上的格式塔原则,在适应度函数的设计上也考虑了多重因素的影响,使得移位结果更符合地图制图规范和地图感受规律。实验结果表明,该算法在移位空间充足时能精确收敛到最优解,移位效果良好。 相似文献
6.
用计算机模拟人类制图员解决地图缩编中的图形冲突 总被引：9，自引：0，他引：9
费立凡 《武汉大学学报(信息科学版)》2004,29(5):426-432
针对地图综合中因道路符号的夸大表示而引起的道路与建筑物的图形冲突,提出了让计算机模拟人类制图员具备视觉及分析功能的具体方法,设计了一种新颖的栅格-矢量混合数据结构,以便通过将移位区内的所有建筑物分类,进行制图移位和受控变形等解决图形冲突。 相似文献
7.
8.
9.
一种利用影像匹配的城区三维景观图生成途径 总被引：1，自引：0，他引：1
提出了一种基于影像匹配的城区三维景观图生成方法,它首先利用神经网络影像匹配得出城区的密集视差表面,再利用基于模板匹配的半自动建筑物提取方法获得建筑物的关量数据和高程,进而得出城区三维数字模型,从而获得真实的城区三维透视景观图。 相似文献
10.
《The Cartographic journal》2013,50(3):221-233
AbstractCartographic generalization aims at simplifying the representation of data to suit the scale and purpose of the map. This paper deals with a method that implements the whole graphic generalization process (roughly defined as the operators simplification, smoothing, exaggeration and displacement) called simultaneous graphic generalization. This method is based on constraints, i.e. requirements that should be fulfilled in the generalization process. The constraints strive to make the map readable while preserving the characteristics of the data, which implies that all constraints cannot be completely satisfied. This study was concentrated on finding the optimal compromise between the constraints in simultaneous graphic generalization by setting weights for the constraints. Four strategies for determining the weights are described and their advantages and disadvantages are discussed. The discussion is based on the following assumptions: the constraints are independent, and the weights are only dependent on constraint type and object type. A comparison of the strategies reveals that the strategy constraint violation is the most promising. One advantage with this strategy is that it is related to the quality requirements of the map, and another advantage is that it provides a numerical measure for quality assessment. The paper concludes with a case study of the constraint violation strategy, in which visualization of the numerical quality measure is used. The case study shows that the constraint violation strategy gives a sound compromise between the constraints. 相似文献
11.
介绍了在地图缩编中因道路符号所对应的实际尺寸加宽而破坏了建筑物与道路符号的正确关系时,针对第二、三、四类建筑物进行移位所涉及的数学方法,并给出了实验结果。最后,介绍了用栅格探测加矢量计算法对移位后可能产生的要素间的后继图形冲突所进行的探测,以及消除后继冲突的方法。 相似文献
12.
在对Snake模型研究的基础上,结合建筑物群在移位中的特点,从2个方面对Snake模型进行改进:首先,在Snake模型中加强对齐排列建筑物群这一重要空间特征的识别,以便保持对齐排列建筑物群在移位前后不变;其次,针对传统Snake模型有时无法解决两个建筑物空间冲突的缺点,对街区中的建筑物群实行分层次移位,先将有冲突的两个建筑物作为整体,与剩余其它建筑物利用Snake模型一起移位,然后再根据文中提出的建筑物间相互冲突的4种受力模型,进行建筑物间空间冲突的移位。最后利用改进的Snake模型进行移位实验和分析。 相似文献
13.
Sandra Loch-Dehbi Lutz Plümer 《ISPRS Journal of Photogrammetry and Remote Sensing》2011,66(2):177-187
This paper presents a novel approach to automated geometric reasoning for 3D building models. Geometric constraints like orthogonality or parallelity play a prominent role in man-made objects such as buildings. Thus, constraint based modelling, that specifies buildings by their individual components and the constraints between them, is a common approach in 3D city models. Since prototyped building models allow one to incorporate a priori knowledge they support the 3D reconstruction of buildings from point clouds and allow the construction of virtual cities. However, high level building models have a high degree of complexity and consequently are not easily manageable. Interactive tools are needed which facilitate the development of consistent models that, for instance, do not entail internal logical contradictions. Furthermore, there is often an interest in a compact, redundancy-free representation. We propose an approach that uses algebraic methods to prove that a constraint is deducible from a set of premises. While automated reasoning in 2D models is practical, a substantial increase in complexity can be observed in the transition to the three-dimensional space. Apart from that, algebraic theorem provers are restricted to crisp constraints so far. Thus, they are unable to handle quality issues, which are, however, an important aspect of GIS data and models. In this article we present an approach to automatic 3D reasoning which explicitly addresses uncertainty. Hereby, our aim is to support the interactive modelling of 3D city models and the automatic reconstruction of buildings. Geometric constraints are represented by multivariate polynomials whereas algebraic reasoning is based on Wu’s method of pseudodivision and characteristic sets. The reasoning process is further supported by logical inference rules. In order to cope with uncertainty and to address quality issues the reasoner integrates uncertain projective geometry and statistical hypothesis tests. Consequently, it allows one to derive uncertain conclusions from uncertain premises. The quality of such conclusions is quantified in a way which is sound both from a logical and a statistical perspective. 相似文献
14.
15.
本文利用智能手机GNSS信噪比观测值在建筑物周围的变化特征,分析其与建筑物对GNSS信号遮挡的关系,提出了一种二维概率地图的概率消减反演算法和建筑高度的邻近边界点体素化反演算法,进而采用大量观测数据反演三维地图,并对反演精度进行分析。试验结果表明,在5m栅格地图上,取高度角为5°以上卫星的GNSS信噪比数据,达9000历元时各项精度趋于稳定,超过12000历元时反演的建筑物中心坐标、建筑面积、角点点位及建筑高度综合效果最佳。其中心点位误差为1.16~1.74m,面积误差为1.12%~2.39%,角点误差绝对均值为5.00~5.30m,均方根误差为5.82~6m,建筑高度误差为0.04~2.1m,基本实现了利用智能移动终端GNSS信噪比数据反演三维地图的目标。 相似文献
16.
17.
本文从空间-语义双重约束角度,提出一种顾及空间邻近和功能语义相似的建筑物空间分布模式识别方法。首先,基于建筑物的空间位置邻近性(即建筑物间的最小距离)约束进行聚类,获得建筑物的空间分布模式和建筑物间的空间邻近关系;然后,根据建筑物的功能语义相似性约束进行分割,获得建筑物的初步聚类结果;最后,考虑簇内相似性与簇间差异性进行整体优化,获得最终聚类结果。试验验证表明,本文方法比现有方法能够更有效地识别空间邻近与功能语义一致的建筑物群,服务于智慧城市建设中对建筑物进行语义层次综合和对城市结构进行深入研究的需求。 相似文献
18.
基于场论分析的建筑物群的移位 总被引：9，自引：2，他引：7
在多边形群目标综合中,移位是一种旨在解决空间邻近冲突的重要操作.以建筑物群在街道拓宽后产生移位操作为例,提出一种基于场论分析的移位方法,认为街区块多边形边界的收缩产生向街区块内部逐步传递并衰减的作用力,从而促使建筑物多边形的空间位置移动,借助于物理学场论中的"等势线"模型来表达这一移位现象.基于Delaunay三角网建立了类似于Voronoi图的建筑物群剖分结构,用于表达移位场模型的"等距离关系曲线".在移位场中目标的运动方向与运动距离由矢量和运算及梯度衰减函数计算完成.算法思想在一地图综合软件系统中已实现. 相似文献
19.
随着三维激光点云数据获取能力的提升，基于三维激光点云进行建筑物模型重建与立面测绘成为工程应用中常用的方法。三维激光点云数据能够体现建筑物丰富和直观的细节信息，然而海量数据处理给建筑物模型构建带来了极大挑战。本文通过对建筑物的三维激光点云数据进行横切得到建筑物轮廓点，并采用基于遗传算法的TSP算法对轮廓点进行处理以获取建筑物各立面的方程系数，最终实现建筑物模型的构建和获取详细的建筑物立面数据。试验结果表明，此方法可以较好地实现LOD1级建筑物模型的构建，进而为更高（LOD3）级别的建筑物模型构建提供依据。 相似文献
20.
基于约束条件的地图目标移位 总被引：4，自引：0，他引：4
地图目标移位是地图综合和空间信息可视化研究中的一个重要问题,其难点是如何在移位过程中满足一定的约束条件以保持目标之间的空间关系。本文以城市道路扩张为例,借助带约束性Delaunay三角网,结合有限元和空间推理方法,重点探讨顾及空间关系的基于约束条件的地图目标移位问题,并给出满足一定约束条件下的节点移位算法和计算实例。 相似文献