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
synthesized
edges
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 Institute Of Surveying And Mapping Science And Technology Chongqing Map Compilation Center
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

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/50Information retrieval; Database structures therefor; File system structures therefor of still image data
    • G06F16/56Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/24Classification techniques
    • G06F18/241Classification techniques relating to the classification model, e.g. parametric or non-parametric approaches
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • G06T11/001Texturing; Colouring; Generation of texture or colour
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T7/00Image analysis
    • G06T7/60Analysis of geometric attributes
    • G06T7/62Analysis 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 drawing method for residential area
Technical Field
The invention relates to the technical field of drawing synthesis, in particular to a residential area drawing synthesis method.
Background
The expression precision of elements under different scales and the bearing capacity of data are different, and drawing synthesis is needed when data are converted from large-scale data to small-scale data. The residential area element is an important element and is always the key point of comprehensive drawing attention. The basic objective of residential area integration is to identify and process small asperities while keeping the polygonal body of the residential area unchanged, while keeping the area variations as small as possible. In the prior art, a part of typical concave-convex structure templates are generally defined in advance, the concave-convex structure of a comprehensive residential area is identified and compared, comprehensive treatment is carried out according to the identified concave-convex structure templates, and a better treatment effect is achieved on simpler residential areas. However, for a complicated residential area, because the structure of the edge to be synthesized is complicated, the defined concave-convex structure template is difficult to meet the matching of the complicated structure, and the comprehensive effect is poor.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a comprehensive residential area mapping method, which can identify the edges to be synthesized in the vector outline of the residential area through a set comprehensive threshold value, and replace the edges to be synthesized by determining the optimal recombination edges corresponding to the edges to be synthesized, thereby obtaining the comprehensive residential area.
The specific technical scheme is as follows:
in a first implementable manner, 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 determined 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 each edge to be synthesized;
determining the optimal recombination edge of each edge to be synthesized according to the corresponding grouping vector;
and replacing the original edge to be synthesized with the corresponding optimal restructuring edge to obtain the synthesized contour of the residential area.
With reference to the first implementable manner, in a second implementable manner, the threshold to be synthesized is a side length.
With reference to the second implementable manner, in a third implementable manner, the traversing each vector edge in the vector outline, and determining an initial edge to be synthesized according to a threshold to be synthesized includes:
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 synthesized into the initial edge to be synthesized.
With reference to the first implementation manner, in a fourth implementation manner, the classifying the initial edge to be synthesized includes:
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.
With reference to the fourth implementable manner, in a fifth implementable manner, the classification criterion is:
Figure BDA0003064423590000021
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.
With reference to the fifth implementable manner, in a sixth implementable manner, the method for processing the simple side includes: 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.
With reference to the fifth implementation manner, in a seventh implementation manner, the method for processing the complex edge includes:
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.
With reference to the first implementable manner, in an eighth implementable manner, the following method is adopted to perform vector grouping on the edges to be synthesized:
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.
With reference to the eighth implementable manner, in a ninth implementable manner, the grouping rule is: the angle between two vector edges satisfies | alpha 12 < theta or | alpha 12 If-pi | is less than theta, the two vector edges are divided into the same group, wherein alpha is 1 、α 2 The azimuth angles of the two vector edges are respectively, and theta is a preset angle threshold value.
With reference to the first implementable manner, in a tenth implementable manner, the following method is used to determine the optimal restructuring edge corresponding to the edge to be synthesized:
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 replacement 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.
Has the advantages that: by adopting the residential area mapping comprehensive method, the edges to be synthesized in the residential area vector outline are determined through the given comprehensive threshold value, the grouping vectors are obtained by adopting the vector grouping mode for the edges to be synthesized, the grouping vectors are combined into the recombination edges, the optimal recombination edges are obtained under the given optimization rule, and the edges to be synthesized are replaced by the optimal recombination edges to obtain the comprehensive residential area. The synthesis can be carried out without predefining a concave-convex structure template.
Drawings
In order to more clearly illustrate the embodiments of the present invention, the drawings, which are required to be used in the embodiments, will be briefly described below. In all the drawings, the elements or parts are not necessarily drawn to actual scale.
FIG. 1 is a flow chart of an integrated method provided by an embodiment of the present invention;
FIG. 2 is a flowchart illustrating determining edges to be synthesized according to an embodiment of the present invention;
fig. 3 is a flowchart for calculating a grouping vector corresponding to an edge to be synthesized according to an embodiment of the present invention;
fig. 4 is a flowchart of determining an optimal restructuring edge corresponding to an edge to be synthesized according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of an edge to be integrated determined using the integration method of the present invention;
FIG. 6 is a schematic view of the vector edges forming the edge to be synthesized 3 in FIG. 5;
FIG. 7 is a diagram illustrating the vector edge recombination result of the edge 3 to be synthesized;
FIG. 8 is a diagram illustrating a grouping vector corresponding to an edge 3 to be synthesized;
FIG. 9 is a diagram illustrating an alternative polygon resulting from the replacement of the grouping vector in FIG. 8;
fig. 10 is a schematic view of the contour of a residential area after being integrated by the integration method of the present invention.
Detailed Description
Embodiments of the present invention will be described in detail below with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and therefore are only examples, and the protection scope of the present invention is not limited thereby.
A flow chart of a residential map synthesis method as shown in fig. 1, the synthesis method comprising:
step 1, acquiring a vector outline of a residential area and determining a threshold value to be integrated;
step 2, 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 determined initial edge to be synthesized to obtain a corresponding edge to be synthesized;
step 3, respectively carrying out vector recombination on each edge to be synthesized, and carrying out grouping summation on the recombined vectors according to a grouping rule to obtain a grouping vector corresponding to each edge to be synthesized;
step 4, determining the optimal recombination edge of each edge to be synthesized according to the corresponding grouping vector;
and 5, replacing the original edge to be synthesized with the corresponding optimal restructured edge to obtain the comprehensive residential area contour.
Specifically, first, a vector profile of a residential area, such as a remote sensing image, may be obtained by using the existing technology, and the threshold to be integrated may be manually set according to the actual measurement condition of the residential area. Then, each vector edge in the vector outline can be traversed based on the threshold value to be synthesized, so as to determine the edge to be synthesized in the vector outline, which needs to be synthesized. Then, vector grouping can be performed on all the vector edges included in each obtained edge to be synthesized according to a set grouping rule, and a sum vector of the grouped vector edges is calculated to obtain a grouping vector corresponding to each edge to be synthesized. Then, the optimal recombination edge can be selected from all the grouping vectors corresponding to each edge to be synthesized, and finally, the original edge to be synthesized is replaced by the optimal recombination edge, so that the outline of the integrated residential area is obtained. Therefore, the complex contour of the residential area can be integrated without predefining a concave-convex structure template.
In this embodiment, preferably, to determine the edges to be combined, first, each of the vector edges may be compared with the threshold to be combined, and the vector edges smaller than the threshold to be combined are determined to be combined into the initial edge to be combined. In this embodiment, the threshold to be integrated may be a side length of a vector side, and the specific step of determining the initial side to be integrated is shown in fig. 2, and includes:
step 2-1-1, traversing each vector edge in the vector outline, and determining the side length of each vector edge;
step 2-1-2, 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 2-1-3, combining adjacent vector edges to be integrated into the initial edge to be integrated.
Then, the classification processing may be performed on the initial edge to be integrated, which specifically includes:
step 2-2-1, traversing each initial edge to be integrated, and determining the type of the initial edge to be integrated through a classification standard;
and 2-2-2, respectively processing the different types of initial edges to be integrated by adopting corresponding processing methods to obtain corresponding edges to be integrated.
In this embodiment, preferably, the classification criteria are:
Figure BDA0003064423590000051
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. Specifically, the number of vector edges included in each initial edge to be synthesized and the side length after the vector edges are connected can be determined by traversing each edge to be synthesized, and the classification standard is compared with the number of vector edges and the side length of each initial edge to be synthesized, so that each initial edge to be synthesized can be determined to be a simple edge type, a conventional edge type or a complex edge type. Then, the different types of initial edges to be synthesized can be processed respectively, and the initial edges to be synthesized are processed by adopting a proper processing method, so that the corresponding edges to be synthesized are obtained.
In this embodiment, preferably, the method for processing the simple side includes: and acquiring a previous vector edge and a next 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 recombined edge cannot be obtained after vector recombination, and a new edge to be synthesized that is composed of a previous vector edge and a next vector edge of the initial edge to be synthesized can be obtained, and the new initial edge to be synthesized includes three or four vector edges, which are edges to be synthesized for vector recombination to obtain a new recombined edge.
The complex edge has a longer length or a larger number of edges, and after the complex edge is directly processed by adopting a vector recombination mode, the area change after final synthesis is possibly larger, and the synthesis result is unreasonable. In order to solve the problem of large area change, the complex edge to be synthesized can be processed progressively according to a certain rule. In this embodiment, preferably, the method for processing the complex edge includes:
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 an integrated threshold value;
and combining all the vector edges to be integrated added into each vector edge group to be integrated into the edge to be integrated.
Specifically, first, starting from a first to-be-integrated vector side of the complex side, sequentially classifying each to-be-integrated vector side into a corresponding to-be-integrated vector side group according to a grouping rule according to a connection sequence of each to-be-integrated vector in the complex side, calculating a vector sum of each to-be-integrated vector side group after each to-be-integrated vector side is added into the to-be-integrated vector side group, then comparing the vector sum of each to-be-integrated vector side group with a to-be-integrated threshold, and if the vector sum of one to-be-integrated vector side group is greater than 2 times of the to-be-integrated threshold, or if the vector sums of all to-be-integrated vector side groups are greater than the to-be-integrated threshold, stopping grouping the remaining to-be-integrated vector sides of the complex side. And finally, all the edges of the vectors to be synthesized in each edge group of the vectors to be synthesized are extracted and combined into the edge to be synthesized corresponding to the complex edge.
The edges to be integrated obtained by the method are distributed as shown in fig. 5, and 8 groups of edges to be integrated are obtained in total, wherein the edges to be integrated 1, the edges to be integrated 2 and the edges to be integrated 4 are all composed of 1 vector edge, the edges to be integrated 6 are composed of 2 vector edges, the edges to be integrated 5 and the edges to be integrated 7 are all composed of 3 vector edges, and the edges to be integrated 3 and the edges to be integrated 8 are all composed of 7 vector edges.
After determining all edges to be synthesized of the building vector outline, each edge to be synthesized may be processed by the following method, as shown in fig. 3, including:
step 3-1, 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;
step 3-2, grouping all the translated vector edges according to a set grouping rule;
and 3-3, summing the grouped vector edges to obtain a grouping vector corresponding to the edge to be synthesized.
Specifically, when processing the edge to be integrated 3 shown in fig. 6, first, vector translation may be performed on the vector edges that will constitute the edge to be integrated 3, and the starting points of all the vector edges of the edge to be integrated 3 are translated to the same node O, so as to obtain a recombined vector edge, and the recombination result is shown in fig. 7.
Then, the vector edges in fig. 7 are grouped according to a set grouping rule to obtain different vector edge groups. In the present embodiment, the grouping rule is set to: between two vector edges, | alpha is satisfied 12 < theta or alpha 12 If-pi | is less than theta, the two vector edges are divided into the same group, wherein alpha is 1 、α 2 The azimuth angles of the two vector sides are respectively, θ is a preset angle threshold, in this embodiment, the angle threshold θ may be set to pi/24, and the result obtained after grouping the vector sides in the figure is:
Figure BDA0003064423590000071
and finally, summing the grouped vector edge groups by using a vector algorithm to obtain a grouping vector corresponding to the edge to be synthesized. Wherein the first group of packet vectors is
Figure BDA0003064423590000072
The second group of packet vectors is
Figure BDA0003064423590000073
The results obtained are shown in FIG. 8.
In this embodiment, preferably, as shown in fig. 4, the following method is adopted to determine the optimal restructuring edge corresponding to the edge to be synthesized:
step 4-1, combining all the grouping vectors corresponding to the edges to be synthesized according to different combination sequences to obtain different recombined edges;
4-2, respectively replacing the edges to be synthesized by using different recombination edges to obtain corresponding replacement polygons;
4-3, calculating the areas of all the replacement polygons;
and 4-4, comparing the areas of the different replacement polygons with the area of the vector outline before replacement, and selecting the recombination side corresponding to the replacement polygon with the minimum area change as the optimal recombination side.
Specifically, first, a packet vector may be encoded
Figure BDA0003064423590000074
And a packet vector
Figure BDA0003064423590000075
Constructing recombination edges according to the sequence of the starting point and the end point to obtain two recombination edges which are recombination edges respectively
Figure BDA0003064423590000076
And restructuring the edges
Figure BDA0003064423590000077
Then, the recombined edges can be utilized
Figure BDA0003064423590000081
And recombining edges
Figure BDA0003064423590000082
The original edges 3 to be synthesized are respectively replaced to obtain two edges as shown in figure 9Replacing the polygon. Then, the areas of the two replacement polygons can be calculated by adopting the existing calculation method, finally, the areas of the two replacement polygons are compared with the area of the polygon corresponding to the vector outline before replacement, the replacement polygon with the smallest area change after replacement is selected out, and the recombination edge corresponding to the selected replacement polygon is taken as the optimal recombination edge. In this embodiment, edges are reorganized
Figure BDA0003064423590000083
The corresponding replacement polygon has the smallest area change, and therefore, the reconstructed edge is selected
Figure BDA0003064423590000084
The edge 3 to be synthesized is replaced. Thus, by sequentially replacing each edge to be synthesized by the method, the residential area profile as shown in fig. 10 can be obtained, and compared with the original vector profile, the comprehensive residential area profile reduces the nodes of the residential area, has small area change and good comprehensive effect.
The above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the embodiments of the present invention, and they should be construed as being covered by the appended claims and their equivalents.

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 12 |<Theta or | alpha 12 -π|<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 北京工业大学 Mobile robot cascading type map creating method based on mixed characteristics
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 武汉大学 A kind of contour of building automatic Extraction Algorithm based on convolutional Neural metanetwork 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 kind of Settlement Place in Remote Sensing Image extracting method and device
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 中国地质大学(武汉) Quantitative evaluation method for comprehensive quality of planar element map

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 北京工业大学 Mobile robot cascading type map creating method based on mixed characteristics
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 kind of Settlement Place in Remote Sensing Image extracting method and device
CN109903304A (en) * 2019-02-25 2019-06-18 武汉大学 A kind of contour of building automatic Extraction Algorithm based on convolutional Neural metanetwork 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
CN112241997B (en) Three-dimensional model building and repairing method and system based on multi-scale point cloud up-sampling
CN110059768B (en) Semantic segmentation method and system for fusion point and region feature for street view understanding
CN110543906B (en) Automatic skin recognition method based on Mask R-CNN model
CN110363178B (en) Airborne laser point cloud classification method based on local and global depth feature embedding
CN116704137B (en) Reverse modeling method for point cloud deep learning of offshore oil drilling platform
CN112418049A (en) Water body change detection method based on high-resolution remote sensing image
CN116682021A (en) High-resolution remote sensing image building vector outline data extraction method
CN116665053A (en) High-resolution remote sensing image building identification method and system considering shadow information
CN114821299A (en) Remote sensing image change detection method
CN113190639B (en) Comprehensive drawing method for residential area
CN110322222A (en) A kind of heterogeneous software work amount estimation method based on deep learning
CN108074253B (en) Multilevel vector road network matching method based on Delaunay triangulation
CN113643303A (en) Three-dimensional image segmentation method based on two-way attention coding and decoding network
CN116452604B (en) Complex substation scene segmentation method, device and storage medium
CN113421258A (en) Automatic cloud detection method based on high-resolution remote sensing image
CN117349687A (en) Daily load curve clustering method based on variable convolution self-encoder
CN117036373A (en) Large-scale point cloud segmentation method based on round function bilinear regular coding and decoding network
CN116934628A (en) Fragment restoration method based on large-scale collaborative genetic algorithm and storage medium
Liu et al. Point2Building: Reconstructing Buildings from Airborne LiDAR Point Clouds
Furferi et al. Multiple incident splines (MISs) algorithm for topological reconstruction of 2D unordered point clouds
CN114399428A (en) Planar artificial element dimension reduction processing method
Zhang et al. Three-Dimensional Segmentation and Global Clearance Analysis for Free-Bent Pipelines in Point-Cloud Scenarios
CN113807233B (en) Point cloud feature extraction method, classification method and segmentation method based on high-order term reference surface learning
CN118644784B (en) Attention mechanism-fused multi-scale feature aggregation point cloud building extraction method

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
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