CN113190639B - Comprehensive drawing method for residential area - Google Patents

Comprehensive drawing method for residential area Download PDF

Info

Publication number
CN113190639B
CN113190639B CN202110522060.XA CN202110522060A CN113190639B CN 113190639 B CN113190639 B CN 113190639B CN 202110522060 A CN202110522060 A CN 202110522060A CN 113190639 B CN113190639 B CN 113190639B
Authority
CN
China
Prior art keywords
vector
edge
integrated
edges
synthesized
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110522060.XA
Other languages
Chinese (zh)
Other versions
CN113190639A (en
Inventor
陈翰新
周智勇
刘昌振
陈良超
胡开全
马红
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing Academy of Surveying and Mapping
Original Assignee
Chongqing Survey Institute
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing Survey Institute filed Critical Chongqing Survey Institute
Priority to CN202110522060.XA priority Critical patent/CN113190639B/en
Publication of CN113190639A publication Critical patent/CN113190639A/en
Application granted granted Critical
Publication of CN113190639B publication Critical patent/CN113190639B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
    • G06F16/56—Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00—Pattern recognition
    • G06F18/20—Analysing
    • G06F18/24—Classification techniques
    • G06F18/241—Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/001—Texturing; Colouring; Generation of texture or colour
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00—Image analysis
    • G06T7/60—Analysis of geometric attributes
    • G06T7/62—Analysis of geometric attributes of area, perimeter, diameter or volume

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Evolutionary Computation (AREA)
  • Evolutionary Biology (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Artificial Intelligence (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Remote Sensing (AREA)
  • Geometry (AREA)
  • Image Analysis (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a comprehensive residential area drawing method, which comprises the following steps: first, a vector contour of a residential area is acquired using a conventional technique. Then, based on the threshold value to be integrated, each vector edge in the vector outline is traversed, and the edge to be integrated which needs to be integrated in the vector outline is determined. And then, carrying out vector grouping on all vector edges included by each edge to be synthesized according to a set grouping rule, and calculating the sum vector of the grouped vector edges to obtain a grouping vector corresponding to each edge to be synthesized. And finally, replacing the original edge to be synthesized with the optimal recombination edge to obtain the integrated contour of the residential area. The comprehensive concave-convex structure template is not required to be predefined for synthesis, compared with the original vector outline, the comprehensive residential area outline reduces the nodes of the residential area, the area change is small, and the comprehensive effect is good.

Description

居民地制图综合方法Comprehensive method of residential map

技术领域technical field

本发明涉及制图综合技术领域，具体涉及一种居民地制图综合方法。The invention relates to the technical field of cartography synthesis, in particular to a method for cartography synthesis of residential areas.

背景技术Background technique

不同尺度下要素的表达精度和数据的承载量不同，从大比例尺数据到小比例尺数据转换时需要制图综合。居民地要素作为一种重要的要素，一直是制图综合关注的重点。居民地综合的基本目标是在保持居民地多边形主体不变的情况下，对小的凹凸结构进行识别和处理，同时尽量保持面积变化较小。现有技术中，一般预先定义一部分典型的凹凸结构模板，对待综合居民地凹凸结构识别和对比，根据识别的凹凸结构模板进行综合处理，对于较简单居民地有较好的处理效果。但是，针对复杂的居民地，因待综合边结构较复杂，定义的凹凸结构模版难以满足复杂结构的匹配，造成综合效果不好的情况。The expression accuracy and data carrying capacity of elements at different scales are different. Cartographic synthesis is required when converting from large-scale data to small-scale data. As an important element, the residential element has always been the focus of comprehensive cartography. The basic goal of residential integration is to identify and process small concave-convex structures while keeping the polygonal main body of the residential area unchanged, while keeping the area change as small as possible. In the prior art, some typical concave-convex structure templates are generally defined in advance, and the concave-convex structure identification and comparison of comprehensive residential areas are to be identified and compared, and comprehensive processing is performed according to the identified concave-convex structure templates, which has a better processing effect on simpler residential areas. However, for complex residential areas, due to the complexity of the edge structure to be integrated, the defined concave-convex structure template is difficult to match the complex structure, resulting in a poor overall effect.

发明内容Contents of the invention

针对现有技术存在的不足，本发明提出一种居民地制图综合方法，通过设定的综合阈值可以识别出居民地矢量轮廓中的待综合边，通过确定待综合边对应的最优重组边对待综合边进行替换，从而得到综合后的居民地。Aiming at the deficiencies in the prior art, the present invention proposes a comprehensive method for cartography of residential areas, which can identify the edges to be integrated in the vector outline of residential areas through the set integrated threshold, and treat The comprehensive edge is replaced to obtain the integrated residential area.

具体技术方案如下：The specific technical scheme is as follows:

一种居民地制图综合方法，在第一种可实现方式中，包括：A comprehensive method for cartography of residential areas, in a first practicable manner, comprising:

获取居民地的矢量轮廓并确定待综合阈值；Obtain the vector outline of the residential area and determine the threshold to be integrated;

遍历所述矢量轮廓中的每条矢量边，根据待综合阈值确定待综合初始边，并对确定待综合初始边进行分类处理，得到相应的待综合边；Traverse each vector edge in the vector outline, determine the initial edge to be integrated according to the threshold to be integrated, and classify the determined initial edge to be integrated to obtain the corresponding edge to be integrated;

对每条所述待综合边分别进行向量重组，并按照分组规则对重组后的向量进行分组求和，得到每条待综合边对应的分组向量；Carrying out vector reorganization respectively for each described edge to be synthesized, and grouping and summing the reorganized vectors according to grouping rules, to obtain a grouping vector corresponding to each edge to be synthesized;

根据相应的所述分组向量确定每条待综合边的最优重组边；Determine the optimal reorganization edge of each edge to be integrated according to the corresponding grouping vector;

利用相应的最优重组边替换原来的待综合边，得到综合后的居民地轮廓。The original edge to be integrated is replaced by the corresponding optimal recombined edge, and the integrated residential outline is obtained.

结合第一种可实现方式，在第二种可实现方式中，所述待综合阈值为边长。With reference to the first possible implementation manner, in the second implementation manner, the threshold to be integrated is the side length.

结合第二种可实现方式，在第三种可实现方式中，所述遍历所述矢量轮廓中的每条矢量边，根据待综合阈值确定待综合初始边，包括：In combination with the second achievable manner, in the third achievable manner, the traversing each vector edge in the vector outline, and determining the initial edge to be integrated according to the threshold to be integrated includes:

遍历所述矢量轮廓中的每条矢量边，确定每条矢量边的边长；Traversing each vector edge in the vector outline to determine the length of each vector edge;

确定边长小于待综合阈值的矢量边，得到待综合矢量边；Determine the vector edge whose edge length is less than the threshold to be integrated, and obtain the vector edge to be integrated;

将相邻的待综合矢量边组合成所述待综合初始边。Combine adjacent vector edges to be integrated into the initial edge to be integrated.

结合第一种可实现方式，在第四种可实现方式中，所述对待综合初始边进行分类处理包括：In combination with the first possible way, in the fourth possible way, the classification of the initial edges to be synthesized includes:

遍历每条所述待综合初始边，通过分类标准确定所述待综合初始边的类型；Traverse each initial edge to be integrated, and determine the type of the initial edge to be integrated by classification criteria;

采用相应的处理方法分别对不同类型的所述待综合初始边进行处理，得到相应的待综合边。Corresponding processing methods are used to process different types of the initial edges to be integrated to obtain corresponding edges to be integrated.

结合第四种可实现方式，在第五种可实现方式中，所述分类标准为：Combined with the fourth possible way, in the fifth possible way, the classification standard is:

Figure BDA0003064423590000021
其中，a为组成待综合初始边的矢量边数量，L为待综合初始边的边长，b为待综合阈值。
Figure BDA0003064423590000021
Among them, a is the number of vector edges forming the initial edge to be integrated, L is the length of the initial edge to be integrated, and b is the threshold to be integrated.

结合第五种可实现方式，在第六种可实现方式中，所述简单边的处理方法包括：获取待综合初始边的前一条矢量边和后一条矢量边组成所述待综合边。With reference to the fifth implementable manner, in the sixth implementable manner, the processing method of the simple edge includes: obtaining the previous vector edge and the subsequent vector edge of the initial edge to be integrated to form the edge to be integrated.

结合第五种可实现方式，在第七种可实现方式中，所述复杂边的处理方法包括：In combination with the fifth implementable manner, in the seventh implementable manner, the processing method of the complex edge includes:

按照边的顺序，逐一将所述复杂边中待综合矢量边加入到相应的待综合矢量边组中，直至其中一个待综合矢量边组的向量和边长大于2倍待综合阈值或者所有待综合矢量边组的向量和边长大于综合阈值；According to the order of the edges, add the vector edges to be synthesized in the complex edges to the corresponding vector edge groups to be synthesized one by one, until the vector and edge length of one of the vector edge groups to be synthesized is greater than 2 times the threshold to be synthesized or all the vector edges to be synthesized The vector and edge length of the vector edge group are greater than the comprehensive threshold;

将加入各个待综合矢量边组中的所有待综合矢量边组合成所述待综合边。All the vector edges to be integrated added to each vector edge group to be integrated are combined into the edge to be integrated.

结合第一种可实现方式，在第八种可实现方式中，采用以下方法对所述待综合边进行向量分组：In combination with the first possible way, in the eighth possible way, the following method is used to perform vector grouping of the edges to be synthesized:

对待综合边的矢量边进行向量平移，以将组成待综合边的所有矢量边的起点平移到同一节点；Carry out vector translation on the vector edge of the edge to be integrated, so as to translate the starting point of all the vector edges that make up the edge to be integrated to the same node;

根据设定的分组规则对平移后的所有矢量边进行分组。All vector edges after translation are grouped according to the set grouping rules.

结合第八种可实现方式，在第九种可实现方式中，所述分组规则为：两条矢量边之间满足|α1-α2|＜θ或|α1-α2-π|＜θ，则两条矢量边分为同一组，其中，α1、α2分别为所述两条矢量边的方位角，θ为预设的角度阈值。In combination with the eighth possible way, in the ninth possible way, the grouping rule is: between two vector edges satisfying |α 1 -α 2 |<θ or |α 1 -α 2 -π|< θ, the two vector sides are classified into the same group, where α 1 and α 2 are the azimuth angles of the two vector sides respectively, and θ is a preset angle threshold.

结合第一种可实现方式，在第十种可实现方式中，采用以下方法确定所述待综合边对应的最优重组边：In combination with the first possible way, in the tenth kind of possible way, the following method is used to determine the optimal recombination side corresponding to the side to be synthesized:

将所述待综合边对应的所有分组向量按照不同的组合顺序进行组合，得到不同的重组边；Combining all the grouping vectors corresponding to the edges to be synthesized according to different combination sequences to obtain different reorganized edges;

利用不同的重组边分别替换所述待综合边，得到相应的替换多边形；Using different recombined sides to replace the sides to be synthesized respectively to obtain corresponding replacement polygons;

计算所有替换多边形的面积；Calculate the area of all replaced polygons;

将不同替换多边形的面积与替换前矢量轮廓的面积进行比较，选取面积变化最小的替换多边形对应的重组边作为最优重组边。The area of different replacement polygons is compared with the area of the vector contour before replacement, and the reorganized edge corresponding to the replaced polygon with the smallest area change is selected as the optimal reorganized edge.

有益效果：采用本发明的居民地制图综合方法，通过给定的综合阈值，确定居民地矢量轮廓中的待综合边，对待综合边采用向量分组的方式获得分组向量，通过分组向量组合为重组边，在给定的优化规则下获得最优重组边，使用最优重组边替换待综合边，得到综合后的居民地。无需预定义凹凸结构模板，即可进行综合。Beneficial effect: adopt the integrated method of residential area mapping of the present invention, determine the edge to be integrated in the vector outline of the residential area through the given integrated threshold value, obtain grouping vectors by vector grouping for the edge to be integrated, and combine the grouping vectors into recombined edges , under the given optimization rules, the optimal reorganization edge is obtained, and the optimal reorganization edge is used to replace the edge to be integrated, and the integrated residential area is obtained. Synthesis can be performed without predefined bump structure templates.

附图说明Description of drawings

为了更清楚地说明本发明具体实施方式，下面将对具体实施方式中所需要使用的附图作简单地介绍。在所有附图中，各元件或部分并不一定按照实际的比例绘制。In order to describe the specific implementation manner of the present invention more clearly, the following will briefly introduce the accompanying drawings used in the specific implementation manner. In all drawings, elements or parts are not necessarily drawn to scale.

图1为本发明一实施例提供的综合方法的流程图；Fig. 1 is the flowchart of the integrated method provided by an embodiment of the present invention;

图2为本发明一实施例提供的确定待综合边的流程图；Fig. 2 is the flowchart of determining the edge to be integrated provided by an embodiment of the present invention;

图3为本发明一实施例提供的计算待综合边对应的分组向量的流程图；Fig. 3 is a flow chart of calculating the grouping vector corresponding to the edge to be integrated provided by an embodiment of the present invention;

图4为本发明一实施例提供的确定待综合边对应的最优重组边的流程图；Fig. 4 is a flow chart of determining the optimal recombination edge corresponding to the edge to be integrated provided by an embodiment of the present invention;

图5为采用本发明的综合方法确定的待综合边的示意图；Fig. 5 is the schematic diagram of the edge to be integrated determined by the integrated method of the present invention;

图6为图5中组成待综合边3的矢量边示意图；Fig. 6 is the schematic diagram of the vector edge forming side 3 to be synthesized in Fig. 5;

图7为待综合边3的矢量边重组结果示意图；Fig. 7 is a schematic diagram of the vector edge reorganization result of the edge 3 to be integrated;

图8为待综合边3对应的分组向量的示意图；Fig. 8 is a schematic diagram of a grouping vector corresponding to side 3 to be synthesized;

图9为图8中的分组向量进行替换得到替换多边形的示意图；Fig. 9 is a schematic diagram of replacing the grouping vector in Fig. 8 to obtain a replacement polygon;

图10为采用本发明的综合方法综合后的居民地轮廓示意图。Fig. 10 is a schematic diagram of the outline of residential areas synthesized by the comprehensive method of the present invention.

具体实施方式detailed description

下面将结合附图对本发明技术方案的实施例进行详细的描述。以下实施例仅用于更加清楚地说明本发明的技术方案，因此只作为示例，而不能以此来限制本发明的保护范围。Embodiments of the technical solutions of the present invention will be described in detail below in conjunction with the accompanying drawings. The following examples are only used to illustrate the technical solutions of the present invention more clearly, and therefore are only examples, rather than limiting the protection scope of the present invention.

如图1所示的居民地制图综合方法的流程图，该综合方法包括：The flow chart of the comprehensive method of residential area mapping as shown in Figure 1, the comprehensive method includes:

步骤1、获取居民地的矢量轮廓并确定待综合阈值；Step 1. Obtain the vector outline of the residential area and determine the threshold to be integrated;

步骤2、遍历所述矢量轮廓中的每条矢量边，根据待综合阈值确定待综合初始边，并对确定待综合初始边进行分类处理，得到相应的待综合边；Step 2, traversing each vector edge in the vector outline, determining the initial edge to be integrated according to the threshold to be integrated, and classifying the determined initial edge to be integrated to obtain the corresponding edge to be integrated;

步骤3、对每条所述待综合边分别进行向量重组，并按照分组规则对重组后的向量进行分组求和，得到每条待综合边对应的分组向量；Step 3. Carry out vector reorganization for each of the edges to be integrated, and perform group summation on the reorganized vectors according to the grouping rules, to obtain the grouping vector corresponding to each edge to be integrated;

步骤4、根据相应的所述分组向量确定每条待综合边的最优重组边；Step 4. Determine the optimal recombination edge of each edge to be synthesized according to the corresponding grouping vector;

步骤5、利用相应的最优重组边替换原来的待综合边，得到综合后的居民地轮廓。Step 5. Replace the original edge to be integrated with the corresponding optimal recombined edge to obtain the integrated residential outline.

具体而言，首先，可以采用现有的技术获取居民地的矢量轮廓，如遥感影像，待综合阈值可以根据居民地的实际测量情况人工进行设定。然后，可以基于待综合阈值，遍历所述矢量轮廓中的每条矢量边，从而确定矢量轮廓中需要进行综合的待综合边。之后，可以按照设定的分组规则对得到的每条待综合边包括的所有矢量边进行向量分组，并计算分组后的矢量边的和向量，得到每条待综合边对应的分组向量。然后，可以分别从每条待综合边对应的所有分组向量中选取出最优重组边，最后，用最优重组边替换掉原来的待综合边，从而得到综合后的居民地轮廓。如此，无需预定义凹凸结构模板，即可实现复杂居民地轮廓的综合。Specifically, firstly, existing technology can be used to obtain the vector outline of the residential area, such as remote sensing images, and the threshold to be integrated can be manually set according to the actual measurement of the residential area. Then, each vector edge in the vector outline may be traversed based on the threshold to be integrated, so as to determine the edge to be integrated that needs to be integrated in the vector outline. Afterwards, according to the set grouping rules, all the vector edges included in each edge to be integrated can be vector grouped, and the sum vector of the grouped vector edges can be calculated to obtain the grouping vector corresponding to each edge to be integrated. Then, the optimal recombination edge can be selected from all the grouping vectors corresponding to each edge to be integrated, and finally, the original edge to be integrated is replaced with the optimal reorganization edge, so as to obtain the integrated settlement outline. In this way, the synthesis of complex residential contours can be realized without pre-defining the concave-convex structure template.

在本实施例中，优选的，为确定待综合边，首先，可以将每条所述矢量边与待综合阈值进行比较，确定小于待综合阈值的矢量边组合成待综合初始边。在本实施例中，待综合阈值可以为矢量边的边长，确定待综合初始边的具体步骤如图2所示，包括：In this embodiment, preferably, in order to determine the edges to be integrated, firstly, each vector edge may be compared with a threshold to be integrated, and it is determined that vector edges smaller than the threshold to be integrated are combined into initial edges to be integrated. In this embodiment, the threshold to be integrated can be the side length of the vector side, and the specific steps for determining the initial side to be integrated are shown in Figure 2, including:

步骤2-1-1、遍历所述矢量轮廓中的每条矢量边，确定每条矢量边的边长；Step 2-1-1, traversing each vector edge in the vector outline, and determining the length of each vector edge;

步骤2-1-2、确定边长小于待综合阈值的矢量边，得到待综合矢量边；Step 2-1-2, determine the vector edge whose edge length is less than the threshold to be integrated, and obtain the vector edge to be integrated;

步骤2-1-3、将相邻的待综合矢量边组合成所述待综合初始边。Step 2-1-3: Combine adjacent vector edges to be integrated into the initial edge to be integrated.

然后，可以对所述对待综合初始边进行分类处理，具体包括：Then, the initial edges to be synthesized can be classified and processed, specifically including:

步骤2-2-1、遍历每条所述待综合初始边，通过分类标准确定所述待综合初始边的类型；Step 2-2-1, traversing each of the initial edges to be synthesized, and determining the type of the initial edges to be synthesized according to classification criteria;

步骤2-2-2、采用相应的处理方法分别对不同类型的所述待综合初始边进行处理，得到相应的待综合边。Step 2-2-2: Using corresponding processing methods to process different types of the initial edges to be integrated respectively to obtain corresponding edges to be integrated.

在本实施例中，优选的，所述分类标准为：In this embodiment, preferably, the classification criteria are:

Figure BDA0003064423590000051
其中，a为组成待综合初始边的矢量边数量，L为待综合初始边的边长，b为待综合阈值。具体而言，可以通过遍历每条待综合边，确定每条待综合初始边包括的矢量边数量，以及这些矢量边相连后的边长，将分类标准与每条待综合初始边的矢量边数量和边长进行比较，即可确定每条待综合初始边是属于简单边类型、常规边类型或者复杂边类型。之后即可针对不同类型的待综合初始边分别进行处理，采用合适的处理方法对待综合初始边进行处理，从而得到相应的待综合边。
Figure BDA0003064423590000051
Among them, a is the number of vector edges forming the initial edge to be integrated, L is the length of the initial edge to be integrated, and b is the threshold to be integrated. Specifically, it is possible to determine the number of vector edges included in each initial edge to be integrated by traversing each edge to be integrated, and the length of the connected side of these vector edges. By comparing with the edge length, it can be determined whether each initial edge to be synthesized belongs to the simple edge type, the regular edge type or the complex edge type. After that, different types of initial edges to be integrated can be processed separately, and an appropriate processing method can be used to process the initial edges to be integrated, so as to obtain corresponding edges to be integrated.

在本实施例中，优选的，所述简单边的处理方法包括：获取待综合初始边的前一条矢量边和后一条矢量边组成所述待综合边。具体而言，当待综合初始边只有一条矢量边或两条矢量边时，向量重组后无法获得新的重组边，可以取待综合初始边的前一条矢量边和后一条矢量边组成的新的待综合边，新的待综合初始边包含三条或四条矢量边，是可进行向量重组获得新重组边的待综合边。In this embodiment, preferably, the method for processing the simple edge includes: acquiring a previous vector edge and a subsequent vector edge of the initial edge to be integrated to form the edge to be integrated. Specifically, when the initial edge to be synthesized has only one vector edge or two vector edges, a new reorganized edge cannot be obtained after vector reorganization, and a new vector edge composed of the previous vector edge and the next vector edge of the initial edge to be integrated can be taken The edge to be integrated, the new initial edge to be integrated includes three or four vector edges, which can be reorganized to obtain a new edge to be integrated.

复杂边的长度较长或边数较多，直接采用向量重组的方式对复杂边处理后，可能导致最终综合后的面积变化较大，综合结果不合理。为解决面积变化较大的问题，可以按照一定的规则，对复杂待综合边渐进式处理。在本实施例中，优选的，所述复杂边的处理方法包括：The length of the complex edge is longer or the number of edges is large. After the complex edge is processed directly by vector reorganization, the area after the final synthesis may change greatly, and the synthesis result is unreasonable. In order to solve the problem of large area changes, complex edges to be synthesized can be processed gradually according to certain rules. In this embodiment, preferably, the complex edge processing method includes:

按照边的顺序，逐一将所述复杂边中待综合矢量边加入到相应的待综合矢量边组中，直至其中一个待综合矢量边组的向量和边长大于2倍待综合阈值或者所有待综合矢量边组的向量和边长大于综合阈值；According to the order of the edges, add the vector edges to be synthesized in the complex edges to the corresponding vector edge groups to be synthesized one by one, until the vector and edge length of one of the vector edge groups to be synthesized is greater than 2 times the threshold to be synthesized or all the vector edges to be synthesized The vector and edge length of the vector edge group are greater than the comprehensive threshold;

将加入各个待综合矢量边组中的所有待综合矢量边组合成所述待综合边。All the vector edges to be integrated added to each vector edge group to be integrated are combined into the edge to be integrated.

具体而言，首先，可以从复杂边的第一条待综合矢量边开始，按照复杂边中每条待综合矢量的连接顺序，依次将每条待综合矢量边按照分组规则归入相应的待综合矢量边组中，并计算每次待综合矢量边加入待综合矢量边组后，每组待综合矢量边组的向量和，然后，将各组待综合矢量边组的向量和与待综合阈值进行比较，如果其中一个待综合矢量边组的向量和大于2倍待综合阈值，或者，所有的待综合矢量边组的向量和均大于待综合阈值，则停止对复杂边剩余的待综合矢量边进行分组。最后，就将各个待综合矢量边组中的待综合矢量边全部提取出来组合成复杂边对应的待综合边。Specifically, firstly, starting from the first vector edge to be integrated in the complex edge, according to the connection sequence of each vector to be integrated in the complex edge, each vector edge to be integrated can be classified into the corresponding vector edge to be integrated according to the grouping rules. In the vector edge group, calculate the vector sum of each group of vector edge groups to be integrated after each vector edge to be integrated is added to the vector edge group to be integrated, and then compare the vector sum of each group of vector edge groups to be integrated with the threshold to be integrated Compare, if the vector sum of one of the vector edge groups to be integrated is greater than 2 times the threshold to be integrated, or the vector sum of all the vector edge groups to be integrated is greater than the threshold to be integrated, stop processing the remaining vector edges to be integrated in the complex edge grouping. Finally, all the vector edges to be integrated in each vector edge group to be integrated are extracted and combined into the edges to be integrated corresponding to the complex edges.

采用上述的方法得到的待综合边分布如图5所示，总共得到8组待综合边，其中待综合边1、待综合边2和待综合边4均由1条矢量边组成，待综合边6由2条矢量边组成，待综合边5和待综合边7均由3条矢量边组成，待综合边3和待综合边8均由7条矢量边组成。The distribution of edges to be integrated obtained by the above method is shown in Figure 5. A total of 8 groups of edges to be integrated are obtained, among which edge 1 to be integrated, edge 2 to be integrated and edge 4 to be integrated are all composed of one vector edge. 6 is composed of 2 vector edges, the side 5 to be synthesized and the side 7 to be synthesized are both composed of 3 vector edges, and the side 3 to be synthesized and the side 8 to be synthesized are both composed of 7 vector edges.

在确定建筑物矢量轮廓所有的待综合边后，可以采用以下方法对每条待综合边进行处理，如图3所示，包括：After determining all the edges to be integrated of the building vector outline, the following methods can be used to process each edge to be integrated, as shown in Figure 3, including:

步骤3-1、对待综合边的矢量边进行向量平移，以将组成待综合边的所有矢量边的起点平移到同一节点；Step 3-1. Perform vector translation on the vector edges of the edges to be integrated, so as to translate the starting points of all the vector edges forming the edges to be integrated to the same node;

步骤3-2、根据设定的分组规则对平移后的所有矢量边进行分组；Step 3-2, grouping all the vector edges after translation according to the set grouping rules;

步骤3-3、对分组后的矢量边求和，得到待综合边对应的分组向量。Step 3-3, summing the grouped vector sides to obtain the grouping vectors corresponding to the sides to be synthesized.

具体而言，对如图6所示的待综合边3进行处理时，首先，可以向将组成待综合边3的矢量边进行向量平移，将待综合边3的所有矢量边的起点平移到同一节点O，得到重组后的矢量边，重组结果如图7所示。Specifically, when processing the edge 3 to be integrated as shown in Figure 6, first, vector translation can be performed to the vector edges that will form the edge 3 to be integrated, and the starting points of all the vector edges of the edge 3 to be integrated can be translated to the same Node O obtains the reorganized vector edge, and the reorganized result is shown in Figure 7.

然后，按照设定的分组规则对图7中的矢量边进行分组，得到不同的矢量边组。在本实施例中，分组规则设定为：两条矢量边之间满足|α1-α2|＜θ或α1-α2-π|＜θ，则两条矢量边分为同一组，其中，α1、α2分别为所述两条矢量边的方位角，θ为预设的角度阈值，在本实施例中，角度阈值θ可以设定为π/24，图中的矢量边进行分组后得到的结果是：

Figure BDA0003064423590000071
Then, according to the set grouping rules, the vector edges in Fig. 7 are grouped to obtain different vector edge groups. In this embodiment, the grouping rule is set as follows: two vector edges satisfy |α 1 -α 2 |<θ or α 1 -α 2 -π|<θ, then the two vector edges are classified into the same group, Wherein, α 1 and α 2 are the azimuth angles of the two vector sides respectively, and θ is a preset angle threshold. In this embodiment, the angle threshold θ can be set to π/24, and the vector sides in the figure are The result after grouping is:
Figure BDA0003064423590000071

最后，对分组后的矢量边组运用向量运算法则求和，得到待综合边对应的分组向量。其中，第一组的分组向量为

Figure BDA0003064423590000072
第二组的分组向量为
Figure BDA0003064423590000073
得到的结果如图8所示。Finally, the vector algorithm is used to sum the grouped vector edge groups to obtain the grouping vector corresponding to the edge to be synthesized. Among them, the grouping vector of the first group is
Figure BDA0003064423590000072
The grouping vector for the second group is
Figure BDA0003064423590000073
The obtained results are shown in Figure 8.

在本实施例中，优选的，如图4所示，采用以下方法确定所述待综合边对应的最优重组边：In this embodiment, preferably, as shown in FIG. 4, the following method is used to determine the optimal recombination edge corresponding to the edge to be integrated:

步骤4-1、将所述待综合边对应的所有分组向量按照不同的组合顺序进行组合，得到不同的重组边；Step 4-1, combining all the grouping vectors corresponding to the edges to be synthesized according to different combination sequences to obtain different reorganized edges;

步骤4-2、利用不同的重组边分别替换所述待综合边，得到相应的替换多边形；Step 4-2, using different recombined sides to replace the sides to be synthesized respectively to obtain corresponding replacement polygons;

步骤4-3、计算所有替换多边形的面积；Step 4-3, calculating the area of all replacement polygons;

步骤4-4、将不同替换多边形的面积与替换前矢量轮廓的面积进行比较，选取面积变化最小的替换多边形对应的重组边作为最优重组边。Step 4-4: Comparing the areas of different replacement polygons with the area of the vector contour before replacement, and selecting the reorganization edge corresponding to the replacement polygon with the smallest area change as the optimal recombination edge.

具体而言，首先，可以对分组向量

Figure BDA0003064423590000074
和分组向量
Figure BDA0003064423590000075
按照起点、终点的顺序构建重组边，可获得两个重组边，分别为重组边
Figure BDA0003064423590000076
和重组边
Figure BDA0003064423590000077
Specifically, first, the grouping vector can be
Figure BDA0003064423590000074
and the grouping vector
Figure BDA0003064423590000075
Construct reorganization edges according to the order of starting point and end point, and get two recombination edges, which are reorganization edges
Figure BDA0003064423590000076
and rearranged edges
Figure BDA0003064423590000077

然后，可以利用重组边

Figure BDA0003064423590000081
和重组边
Figure BDA0003064423590000082
分别替换原来的待综合边3，得到如图9所示的两个替换多边形。之后，可以采用现有的计算方法计算这两个替换多边形的面积，最后，将两个替换多边形的面积与替换前的矢量轮廓对应的多边形的面积进行比较，从中选取出替换后面积变化最小的替换多边形，并将选取出的替换多边形对应的重组边作为最优重组边。在本实施例中，重组边
Figure BDA0003064423590000083
对应的替换多边形的面积变化最小，因此，选取重组边
Figure BDA0003064423590000084
对待综合边3进行替换。如此，采用上述的方法依次对每条待综合边进行替换，即可得到如图10所示的居民地轮廓，综合后的居民地轮廓与原来的矢量轮廓相比，减少了居民地的节点，并且面积变化小，综合效果良好。Then, the reorganized edges can be utilized
Figure BDA0003064423590000081
and rearranged edges
Figure BDA0003064423590000082
The original side 3 to be synthesized is respectively replaced to obtain two replacement polygons as shown in FIG. 9 . Afterwards, the area of the two replacement polygons can be calculated using existing calculation methods, and finally, the area of the two replacement polygons is compared with the area of the polygon corresponding to the vector outline before replacement, and the one with the smallest area change after replacement is selected. The polygon is replaced, and the reorganized edge corresponding to the selected replaced polygon is used as the optimal reorganized edge. In this example, the reorganized edge
Figure BDA0003064423590000083
The area of the corresponding replacement polygon has the smallest change, therefore, select the recombined edge
Figure BDA0003064423590000084
Replace side 3 to be synthesized. In this way, by using the above method to replace each edge to be integrated in turn, the residential area outline shown in Figure 10 can be obtained. Compared with the original vector outline, the integrated residential area outline has fewer nodes in the residential area. And the change of the area is small, and the comprehensive effect is good.

以上实施例仅用以说明本发明的技术方案，而非对其限制；尽管参照前述各实施例对本发明进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分或者全部技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本发明各实施例技术方案的范围，其均应涵盖在本发明的权利要求和说明书的范围当中。The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still be applied to the foregoing embodiments Modifications are made to the technical solutions described, or equivalent replacements are made to some or all of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the various embodiments of the present invention, and all of them shall be included in Within the scope of the claims and description of the present invention.

Claims (9)

1. A residential map synthesis method, comprising:
acquiring a vector outline of a residential area and determining a threshold value to be integrated;
traversing each vector edge in the vector outline, determining an initial edge to be synthesized according to a threshold value to be synthesized, and classifying the initial edge to be synthesized to obtain a corresponding edge to be synthesized;
vector recombination is carried out on each edge to be synthesized, and the recombined vectors are subjected to grouping summation according to a grouping rule to obtain a grouping vector corresponding to the edge to be synthesized;
determining the optimal recombination edge of each edge to be synthesized according to the corresponding grouping vector;
replacing the original edge to be synthesized with the corresponding optimal restructured edge to obtain a synthesized residential area outline;
determining the optimal recombination edge corresponding to the edge to be synthesized by adopting the following method:
combining all the grouping vectors corresponding to the edges to be synthesized according to different combination sequences to obtain different recombined edges;
respectively replacing the edges to be synthesized by using different recombination edges to obtain corresponding replacement polygons;
calculating the areas of all the replacing polygons;
and comparing the areas of the different replacement polygons with the area of the vector outline before replacement, and selecting the recombination edge corresponding to the replacement polygon with the smallest area change as the optimal recombination edge.
2. The residential map synthesis method according to claim 1, wherein the threshold to be synthesized is a side length.
3. The method according to claim 2, wherein traversing each vector edge in the vector outline, determining an initial edge to be integrated according to a threshold to be integrated, comprises:
traversing each vector edge in the vector outline, and determining the side length of each vector edge;
determining a vector edge with the side length smaller than a threshold value to be integrated to obtain a vector edge to be integrated;
and combining adjacent vector edges to be integrated into the initial edge to be integrated.
4. The residential mapping comprehensive method according to claim 1, wherein said classifying process of the initial edge to be synthesized comprises:
traversing each initial edge to be integrated, and determining the type of the initial edge to be integrated through a classification standard;
and respectively processing the different types of initial edges to be integrated by adopting corresponding processing methods to obtain corresponding edges to be integrated.
5. The residential mapping integration method according to claim 4, wherein said classification criteria are:
Figure FDA0003917495830000021
wherein, a is the vector edge number of the initial edge to be integrated, L is the edge length of the initial edge to be integrated, and b is the threshold value to be integrated.
6. The residential map comprehensive method according to claim 5, wherein said simple side processing method comprises: and obtaining a previous vector edge and a next vector edge of the initial edge to be synthesized to form the edge to be synthesized.
7. The residential map comprehensive method according to claim 5, wherein said complex edge processing method comprises:
adding the vector sides to be integrated in the complex sides into corresponding vector side groups to be integrated one by one according to the order of the sides until the vector sum side length of one vector side group to be integrated is more than 2 times of a threshold value to be integrated or the vector sum side lengths of all the vector side groups to be integrated are more than the threshold value to be integrated;
and combining all the vector edges to be integrated added into each vector edge group to be integrated into the edge to be integrated.
8. The residential map synthesis method according to claim 1, wherein the edges to be synthesized are grouped by:
carrying out vector translation on the vector edges of the edges to be synthesized so as to translate starting points of all the vector edges forming the edges to be synthesized to the same node;
and grouping all the translated vector edges according to a set grouping rule.
9. The residential map comprehensive method according to claim 8, wherein said grouping rule is: between two vector edges, | alpha is satisfied 1 -α 2 |<Theta or | alpha 1 -α 2 -π|<Theta, then the two vector edges are divided into the same group, where alpha is 1 、α 2 The azimuth angles of the two vector edges are respectively, and theta is a preset angle threshold value.
CN202110522060.XA 2021-05-13 2021-05-13 Comprehensive drawing method for residential area Active CN113190639B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110522060.XA CN113190639B (en) 2021-05-13 2021-05-13 Comprehensive drawing method for residential area

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110522060.XA CN113190639B (en) 2021-05-13 2021-05-13 Comprehensive drawing method for residential area

Publications (2)

Publication Number Publication Date
CN113190639A CN113190639A (en) 2021-07-30
CN113190639B true CN113190639B (en) 2022-12-13

Family

ID=76981412

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110522060.XA Active CN113190639B (en) 2021-05-13 2021-05-13 Comprehensive drawing method for residential area

Country Status (1)

Country Link
CN (1) CN113190639B (en)

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103268729A (en) * 2013-05-22 2013-08-28 北京工业大学 A method for creating cascaded maps for mobile robots based on hybrid features
CN105787977A (en) * 2016-02-26 2016-07-20 民政部国家减灾中心 Building vector boundary simplification method
CN106649776A (en) * 2016-12-27 2017-05-10 中科宇图科技股份有限公司 Method of semi-automating comprehensive vector polygon
CN106710437A (en) * 2016-12-26 2017-05-24 中国矿业大学(北京) Compilation method and system for electronic map
CN107818338A (en) * 2017-10-16 2018-03-20 辛秦川 A kind of method and system of building group pattern-recognition towards Map Generalization
CN108830876A (en) * 2018-05-28 2018-11-16 河海大学 A kind of waters contours extract and area detecting method
CN109903304A (en) * 2019-02-25 2019-06-18 武汉大学 An Algorithm for Automatically Extracting Building Outlines Based on Convolutional Neural Network and Polygon Regularization
CN109991636A (en) * 2019-03-25 2019-07-09 启明信息技术股份有限公司 Map constructing method and system based on GPS, IMU and binocular vision
CN110363053A (en) * 2018-08-09 2019-10-22 中国人民解放军战略支援部队信息工程大学 A method and device for extracting residential areas from remote sensing images
CN111241228A (en) * 2020-01-15 2020-06-05 合肥慧图软件有限公司 Comprehensive drawing method based on vector data and graphical processing technology
CN112581468A (en) * 2020-12-29 2021-03-30 二十一世纪空间技术应用股份有限公司 Processing method and device for extracting information facing remote sensing image

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6853386B1 (en) * 2002-02-27 2005-02-08 At&T Corp. Method for generating contiguous cartograms
GB2457215A (en) * 2007-03-07 2009-08-12 Nikolaos Kokkas Automatic 3D Modelling
CN101930483B (en) * 2009-11-25 2012-07-04 中国人民解放军信息工程大学 Method for simplifying numerical map settlement place polygon by utilizing parametric design model
CN102902837B (en) * 2012-07-25 2015-02-11 南京大学 Graphic space superposition analysis drafting method of complex vector polygon
CN103559506B (en) * 2013-11-19 2015-04-15 中国科学院地理科学与资源研究所 Sub-pixel drawing method based on vector boundaries
EP3133510A1 (en) * 2015-08-17 2017-02-22 Palantir Technologies, Inc. Interactive geospatial map
CN107220481B (en) * 2017-05-09 2019-12-17 中国地质大学（武汉） A Quantitative Evaluation Method for the Comprehensive Quality of Area Feature Maps

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103268729A (en) * 2013-05-22 2013-08-28 北京工业大学 A method for creating cascaded maps for mobile robots based on hybrid features
CN105787977A (en) * 2016-02-26 2016-07-20 民政部国家减灾中心 Building vector boundary simplification method
CN106710437A (en) * 2016-12-26 2017-05-24 中国矿业大学(北京) Compilation method and system for electronic map
CN106649776A (en) * 2016-12-27 2017-05-10 中科宇图科技股份有限公司 Method of semi-automating comprehensive vector polygon
CN107818338A (en) * 2017-10-16 2018-03-20 辛秦川 A kind of method and system of building group pattern-recognition towards Map Generalization
CN108830876A (en) * 2018-05-28 2018-11-16 河海大学 A kind of waters contours extract and area detecting method
CN110363053A (en) * 2018-08-09 2019-10-22 中国人民解放军战略支援部队信息工程大学 A method and device for extracting residential areas from remote sensing images
CN109903304A (en) * 2019-02-25 2019-06-18 武汉大学 An Algorithm for Automatically Extracting Building Outlines Based on Convolutional Neural Network and Polygon Regularization
CN109991636A (en) * 2019-03-25 2019-07-09 启明信息技术股份有限公司 Map constructing method and system based on GPS, IMU and binocular vision
CN111241228A (en) * 2020-01-15 2020-06-05 合肥慧图软件有限公司 Comprehensive drawing method based on vector data and graphical processing technology
CN112581468A (en) * 2020-12-29 2021-03-30 二十一世纪空间技术应用股份有限公司 Processing method and device for extracting information facing remote sensing image

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
基于邻近四点法的建筑物多边形化简;许文帅等;《测绘学报》;20131215(第06期);第143-150页 *
计算机制图综合在土地详查中的应用研究;蒋新华等;《测绘通报》;19981225(第12期);第28-31页 *
遥感影像矢量化图形的多层次优化方法;吴宁等;《浙江大学学报(工学版)》;20130415(第04期);第23-29页 *

Also Published As

Publication number Publication date
CN113190639A (en) 2021-07-30

Similar Documents

Publication Publication Date Title
CN109993825B (en) Three-dimensional reconstruction method based on deep learning
CN110322453B (en) 3D point cloud semantic segmentation method based on position attention and auxiliary network
CN106023298B (en) Point cloud Rigid Registration method based on local Poisson curve reestablishing
CN109615581B (en) Splicing recovery method of three-dimensional fragments fusing expanded Gaussian balls and color geometric features
CN110543906B (en) Automatic skin recognition method based on Mask R-CNN model
CN101707026A (en) Combined optimization method for simplifying digital map linear factors
CN106934455B (en) Method and system for selecting optical adaptation structure of remote sensing images based on CNN
WO2020098449A1 (en) Hadamard transform-based single image super-resolution method
CN111539432B (en) Method for extracting urban road by using multi-source data to assist remote sensing image
CN118644784B (en) Attention mechanism-fused multi-scale feature aggregation point cloud building extraction method
CN112767429B (en) Ground-snow surface point cloud rapid segmentation method
CN116682021A (en) A Method for Extracting Building Vector Outline Data from High Resolution Remote Sensing Image
CN106530247A (en) Multi-scale image restoring algorithm based on structure information
CN104317886A (en) Method for retrieving and selecting neighbor conditional data points in grid node interpolation under fault constraint
CN117036939A (en) Urban functional area identification method based on multi-source data collaboration of graph rolling network
CN108537263B (en) Grid map fusion method based on maximum public subgraph
CN110415280A (en) Method and system for remote sensing image and building vector registration under multi-task CNN model
CN109741358A (en) A Superpixel Segmentation Method Based on Adaptive Hypergraph Learning
CN109948720A (en) A Density-Based Hierarchical Clustering Method
CN109918542A (en) A convolution classification method and system for relational graph data
CN113190639B (en) Comprehensive drawing method for residential area
CN106682237B (en) A method for automatic extraction of mountain boundaries
CN109345571A (en) A Point Cloud Registration Method Based on Extended Gaussian Image
CN102542565B (en) Method for removing mismatching points of remote sensing image including complex terrains
CN116431964B (en) A travel-length stripping method for generating skeleton lines of complex river networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20240318

Address after: No. 6 Qingzhu East Road, Dazhulin Street, Yubei District, Chongqing, 400000

Patentee after: Chongqing Institute of Surveying and Mapping Science and Technology (Chongqing Map Compilation Center)

Country or region after: China

Address before: 401121 No. 6, Qingzhu East Road, Yubei District, Chongqing

Patentee before: CHONGQING SURVEY INSTITUTE

Country or region before: China

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20240320

Address after: No. 6 Qingzhu East Road, Dazhulin Street, Yubei District, Chongqing, 400000

Patentee after: Chongqing Institute of Surveying and Mapping Science and Technology (Chongqing Map Compilation Center)

Country or region after: China

Address before: 401121 No. 6, Qingzhu East Road, Yubei District, Chongqing

Patentee before: CHONGQING SURVEY INSTITUTE

Country or region before: China

TR01 Transfer of patent right