CN113706604B - Ground pattern spot analysis method based on intersection solving algorithm of two convex polygons - Google Patents
Ground pattern spot analysis method based on intersection solving algorithm of two convex polygons Download PDFInfo
- Publication number
- CN113706604B CN113706604B CN202110959917.4A CN202110959917A CN113706604B CN 113706604 B CN113706604 B CN 113706604B CN 202110959917 A CN202110959917 A CN 202110959917A CN 113706604 B CN113706604 B CN 113706604B
- Authority
- CN
- China
- Prior art keywords
- convex
- intersection
- convex polygon
- ground
- vertex
- 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
Links
- 238000004458 analytical method Methods 0.000 title claims abstract description 23
- 238000000034 method Methods 0.000 claims abstract description 34
- 238000000926 separation method Methods 0.000 claims description 3
- 239000002699 waste material Substances 0.000 description 3
- 238000012216 screening Methods 0.000 description 2
- 230000006978 adaptation Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000001351 cycling effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Classifications
-
- 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/64—Analysis of geometric attributes of convexity or concavity
-
- 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
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Geometry (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Image Analysis (AREA)
Abstract
The invention discloses a ground pattern spot analysis method based on an intersection solving algorithm of two convex polygons, and relates to the technical field of ground pattern spot analysis. According to the ground pattern analysis method, a boundary point is converted into a graph method or a shp file analysis method, so that a convex polygon is obtained, intersection solutions are sequentially carried out on the convex polygons, common intersections of all the convex polygons are obtained, the obtained common intersections are overlapped with the convex polygons in a database, ground pattern spots and linear ground pattern information which are intersected with the common intersections are obtained, and the ground pattern spots and the linear ground pattern information are analyzed, so that pattern spot areas under different ground patterns are obtained. The method for analyzing the ground pattern spots is simple, low in space and time complexity, and high in running speed and robustness, and the ground pattern spots can be analyzed only by establishing one-time connection with the database.
Description
Technical Field
The invention relates to the technical field of ground pattern spot analysis, in particular to a ground pattern spot analysis method based on an intersection solving algorithm of two convex polygons.
Background
At present, the superposition analysis of the ground pattern spots containing a plurality of polygons often needs to repeatedly establish and release database connection by polling the service of a plurality of convex polygon intersection solving algorithms, acquire a ground pattern spot and a linear ground feature result set, and then analyze to obtain the area of the pattern spots occupied under different ground patterns. By repeating the polling process, unnecessary performance overhead and waste are caused, resulting in a slow efficiency of repeatedly acquiring database links, and more instantaneous performance is consumed for computation of complex graphic data.
Disclosure of Invention
Aiming at the problems existing in the prior art, the invention provides a ground pattern spot analysis method based on two convex polygon intersection solving algorithms. The ground pattern spot analysis method is used for carrying out intersection calculation based on two convex polygon intersection solving algorithms to obtain ground pattern analysis of the area of the pattern spots occupied under different ground patterns.
In order to achieve the above purpose, the technical scheme adopted by the invention is as follows: a ground pattern spot analysis method based on two convex polygon intersection solving algorithms specifically comprises the following steps:
(1) Obtaining a convex polygon by converting boundary points into a graphic method or a method for analyzing shp files;
(2) Sequentially carrying out intersection solving on the convex polygons to obtain common intersections of all the convex polygons; the method comprises the following substeps:
(2.1) judging the positional relationship of two convex polygons according to the relationship of edges, wherein the positional relationship of the two convex polygons comprises: containment, separation, intersection, tangency;
(2.2) when the two convex polygons belong to an intersecting or containing relationship, solving an intersection;
(2.3) repeatedly solving the intersection with the next convex polygon according to the methods of the steps (2.1) - (2.2) until the common intersection of all the convex polygons is obtained;
(3) Overlapping the obtained common intersection with a convex polygon in a database to obtain ground pattern spots and linear ground feature information intersected with the common intersection;
(4) And analyzing the ground pattern spots and the linear ground feature information to obtain pattern spot areas under different ground patterns.
Further, the method for converting the boundary point into the graph is specifically as follows: and forming a convex polygon by sequentially connecting points according to the point serial numbers, the point coordinates, the figure numbers of the points and the ring numbers.
Further, the method for analyzing the shp file specifically comprises the following steps: and obtaining graphic data from a shape field or a geom field in the shp file to obtain a convex polygon.
Further, the step (2.1) specifically comprises: solving the number of intersection points of all sides of the two convex polygons A and B, wherein if at least one intersection point exists, the number of the intersection points is limited, and the convex polygons A and B are intersected; if there are countless intersecting points, the convex polygon A is tangent to the convex polygon B; if the number of the intersection points is 0, the A convex polygon is not intersected with the B convex polygon, judging whether all vertexes on the A convex polygon are in the B convex polygon, and if all vertexes on the A convex polygon are in the B convex polygon, the B convex polygon comprises the A convex polygon; otherwise, judging whether all vertexes on the B convex polygon are in the A convex polygon, if so, the A convex polygon comprises the B convex polygon, otherwise, the A convex polygon is separated from the B convex polygon.
Further, in step (2.2), when two convex polygons are inclusion relationships, their intersection is the included convex polygon.
Further, in the step (2.2), when the two convex polygons a and B intersect, the process of calculating the intersection is specifically:
(a) Vertex coordinates in the a-convex polygon and the B-convex polygon are stored as vertex sets a (a 1 ,…A i ,…A n ) And B (B) 1 ,…B i ,…B m ) Wherein n is the number of vertexes of the convex polygon A, and m is the number of vertexes of the convex polygon B;
(b) In vertex set A (A 1 ,…A i ,…A n ) Last addition of A 1 An initialization vertex set A' (A) is obtained 1 ,…A i ,…A n ,A 1 ) In vertex set B (B 1 ,…B i ,…B m ) Last added B 1 An initialization vertex set B' (B) is obtained 1 ,…B i ,…,B 1 )；
(c) For any ith vertex A i Judging the vertex A i Relationship with convex polygon B, if A i Inside the convex polygon B, the vertex A i Stored in the set AB, and judged to have the vertex A i If there is an intersection between the edge of (a) and the B-convex polygon, if there is an apex A i The edges of the (a) and the B convex polygon have intersection points, and the intersection points are stored in a set AB;
(d) For any ith vertex B i Determine vertex B i Relationship with the A convex polygon, if B i Inside the convex polygon A, the vertex B i Save and aggregate BA and determine that there is a vertex B i If there is an intersection between the edge of (a) and the convex polygon with the vertex B i The sides of the polygon (B) and the polygon (A) have intersection points, and the intersection points are stored in a combination BA;
(e) Performing step (h) by looping back the set BA forward or backward until the first element of the set BA coincides with the first element of the set AB, otherwise;
(f) By looping back set AB forward or backward until the last element of set AB and the first element of set BA agree;
(g) Deleting the first element in the set BA, moving the rest elements forward by one bit, judging whether the new first element in the set BA is in the set AB, if not, inserting the first element into the end of the set AB, and executing the step (g) again; if the new first element in the set BA is in the set AB, executing the step (f); until the set BA is an empty set, combining the vertex sequences of which the AB is two convex polygons at the moment;
(h) By looping set AB forward or backward until the first element of set AB is consistent with the first element of set BA;
(i) By looping back the set BA forward or backward until the last element of the set BA is consistent with the first element of the set AB;
(j) Deleting the first element in the set AB, moving the rest element forward by one bit, judging whether the new first element in the set AB is in the set BA, if not, inserting the first element into the end of the set BA, and executing the step (j) again; if the new first element in set AB is in set BA, then executing step (i); until set AB is an empty set, at which point the combined BA is the vertex sequence intersection of two convex polygons.
Further, the step (4) specifically includes the following sub-steps:
(4.1) grouping the intersected patterns according to the ground class codes of the ground class pattern spots, summing the areas of the intersected patterns of the same group, and inquiring the ground class names and the pattern numbers corresponding to the ground class codes of the ground class pattern spots through a dictionary table;
(4.2) polling the result set of the linear ground object, multiplying the width and length fields of the linear ground object to obtain an area, putting the area into the area result set, grouping the area result set according to the ground type coding fields, and summing the same group of area fields; inquiring a ground class name corresponding to the ground class code of the linear ground object through a dictionary table;
and (4.3) comparing the ground pattern spots with the linear ground object, and subtracting the area of the intersecting pattern in the linear ground object from the area of the intersecting pattern in the ground pattern spots with the same ground pattern name to obtain the pattern spot areas under different ground patterns.
Compared with the prior art, the invention has the following beneficial effects: according to the ground pattern spot analysis method based on the intersection solving algorithm of the two convex polygons, intersection solving is sequentially carried out on the convex polygons to obtain common intersections of all the convex polygons, then the common intersections are overlapped with the convex polygons in the database to obtain ground pattern spots and linear ground feature information which are intersected with the common intersections, the method is simple, the space and time complexity is low, the ground pattern spot analysis can be realized only by establishing one-time connection with the database, the operation speed is high, and the robustness is high.
Drawings
FIG. 1 is a flow chart of a ground pattern spot analysis method based on two convex polygon intersection solving algorithms;
FIG. 2 is a flowchart of a set AB of filter vertex construction.
Detailed Description
The technical scheme of the invention is further explained below with reference to the accompanying drawings.
Fig. 1 is a flowchart of a ground pattern spot analysis method based on two convex polygon intersection solving algorithms, which specifically includes the following steps:
(1) And obtaining the convex polygon by converting the boundary point into a graph method or analyzing the shp file. The method for converting the boundary point into the graph in the invention comprises the following steps: and forming a convex polygon by sequentially connecting points according to the point serial numbers, the point coordinates, the figure numbers of the points and the ring numbers. The method for analyzing the shp file in the invention comprises the following steps: and obtaining graphic data from a shape field or a geom field in the shp file to obtain a convex polygon.
(2) In the prior art, when a plurality of convex polygons are subjected to superposition analysis, each convex polygon is respectively subjected to superposition analysis with data in a database, and establishment and release of database connection are repeatedly performed, so that unnecessary performance cost and waste are caused. In the invention, the convex polygons are sequentially subjected to intersection solution, and after the common intersection of all the convex polygons is obtained, the common intersection is subjected to superposition analysis with the data in the database, so that the operation complexity is reduced and the waste is reduced. The method specifically comprises the following substeps:
(2.1) judging the positional relationship of two convex polygons according to the relationship of edges, wherein the positional relationship of the two convex polygons comprises: containment, separation, intersection, tangency; the method comprises the following steps: solving the number of intersection points of all sides of the two convex polygons A and B, wherein if at least one intersection point exists, the number of the intersection points is limited, and the convex polygons A and B are intersected; if there are countless intersecting points, the convex polygon A is tangent to the convex polygon B; if the number of the intersection points is 0, the A convex polygon is not intersected with the B convex polygon, judging whether all vertexes on the A convex polygon are in the B convex polygon, and if all vertexes on the A convex polygon are in the B convex polygon, the B convex polygon comprises the A convex polygon; otherwise, judging whether all vertexes on the B convex polygon are in the A convex polygon, if so, the A convex polygon comprises the B convex polygon, otherwise, the A convex polygon is separated from the B convex polygon.
(2.2) when the two convex polygons belong to an intersecting or containing relationship, solving an intersection; when two convex polygons are inclusion relationships, their intersection is the included convex polygon. When the two convex polygons A and B are intersected, all vertexes of the two convex polygons are screened according to the position relation between the vertexes and the other polygon, the screened vertexes and the intersection points of the two convex polygons are combined according to the anticlockwise sequence, and an intersection vertex sequence of the two convex polygons can be obtained, so that points which do not participate in the next intersection solving step are removed, and the operation process is simplified. The intersection solving process in the invention specifically comprises the following steps:
(a) Vertex coordinates in the a-convex polygon and the B-convex polygon are stored as vertex sets a (a 1 ,…A i ,…A n ) And B (B) 1 ,…B i ,…B m ) Wherein n is the number of vertexes of the convex polygon A, and m is the number of vertexes of the convex polygon B; firstly, screening the vertexes of the convex polygons, judging the position relation between the vertexes and the other convex polygon, and storing for standby, specifically:
(b) In order not to leak the last edge on the convex polygon, the vertex set A (A 1 ,…A i ,…A n ) Last addition of A 1 An initialization vertex set A' (A) is obtained 1 ,…A i ,…A n ,A 1 ) In vertex set B (B 1 ,…B i ,…B m ) Last added B 1 An initialization vertex set B' (B) is obtained 1 ,…B i ,…,B 1 )；
(c) For any ith vertex A i Judging the vertex A i Relationship with convex polygon B, if A i Inside the convex polygon B, the vertex A i Stored in the set AB, and judged to have the vertex A i If there is an intersection between the edge of (a) and the B-convex polygon, if there is an apex A i The edges of the (a) and the B convex polygon have intersection points, and the intersection points are stored in a set AB;
(d) For any ith vertex B i Determine vertex B i Relationship with the A convex polygon, if B i Inside the convex polygon A, the vertex B i Save and aggregate BA and determine that there is a vertex B i If there is an intersection between the edge of (a) and the convex polygon with the vertex B i The sides of the polygon (B) and the polygon (A) have intersection points, and the intersection points are stored in a combination BA;
(e) As shown in fig. 2, a flowchart of constructing a combined AB for screening vertices, by cycling the set BA forward or backward until the first element of the set BA is consistent with the first element of the set AB, searching for the first element common to the set AB and the set BA, so as to facilitate merging the intersection vertex sequences, otherwise, executing step (h);
(f) By looping through set AB forward or backward until the end element of set AB and the first element of set BA are consistent, it is convenient to delete the duplicate elements when merging set AB and set BA.
(g) Deleting the first element in the set BA, moving the rest elements forward by one bit, judging whether the new first element in the set BA is in the set AB, if not, inserting the first element into the end of the set AB, and executing the step (g) again; if the new first element in the set BA is in the set AB, executing the step (f); until the set BA is an empty set, combining the vertex sequence intersection set of which AB is two convex polygons at the moment, and obtaining the vertex sequence intersection set under the condition of ensuring the vertex sequence.
(h) By looping set AB forward or backward until the first element of set AB is consistent with the first element of set BA;
(i) By looping back the set BA forward or backward until the last element of the set BA is consistent with the first element of the set AB;
(j) Deleting the first element in the set AB, moving the rest element forward by one bit, judging whether the new first element in the set AB is in the set BA, if not, inserting the first element into the end of the set BA, and executing the step (j) again; if the new first element in set AB is in set BA, then executing step (i); until set AB is an empty set, at which point the combined BA is the vertex sequence intersection of two convex polygons.
And (2.3) repeatedly solving the intersection of the intersection and the next convex polygon according to the methods of the steps (2.1) - (2.2) until the common intersection of all the convex polygons is obtained, and performing ground pattern spot analysis by only establishing one connection with a database, so that the operation speed is high and the robustness is high.
(3) Overlapping the obtained common intersection with a convex polygon in a database to obtain ground pattern spots and linear ground feature information intersected with the common intersection;
(4) And analyzing the ground pattern spots and the linear ground feature information to obtain pattern spot areas under different ground patterns. The step (4) specifically comprises the following sub-steps:
(4.1) grouping the intersected patterns according to the ground class codes of the ground class pattern spots, summing the areas of the intersected patterns of the same group, and inquiring the ground class names and the pattern numbers corresponding to the ground class codes of the ground class pattern spots through a dictionary table;
(4.2) polling the result set of the linear ground object, multiplying the width and length fields of the linear ground object to obtain an area, putting the area into the area result set, grouping the area result set according to the ground type coding fields, and summing the same group of area fields; inquiring a ground class name corresponding to the ground class code of the linear ground object through a dictionary table;
and (4.3) comparing the ground pattern spots with the linear ground object, and subtracting the area of the intersecting pattern in the linear ground object from the area of the intersecting pattern in the ground pattern spots with the same ground pattern name to obtain the pattern spot areas under different ground patterns.
Compared with the existing polling traversal database method, the ground pattern spot analysis method based on the intersection solving algorithm of the two convex polygons has the advantages that the operation speed is improved by about 50% and the operation speed is improved by about Lu Bangxing% under the condition that 10 convex polygons are input, so that the method is simple, the space and time complexity is low, the operation speed is high, and the robustness is higher.
The above is only a preferred embodiment of the present invention, and the scope of the present invention is not limited to the above embodiment, and all technical solutions belonging to the concept of the present invention are within the scope of the present invention. It should be noted that modifications and adaptations to the invention without departing from the principles thereof are intended to be within the scope of the invention as set forth in the following claims.
Claims (7)
1. A ground pattern spot analysis method based on two convex polygon intersection solving algorithms is characterized by comprising the following steps:
(1) Obtaining a convex polygon by converting boundary points into a graphic method or a method for analyzing shp files;
(2) Sequentially carrying out intersection solving on the convex polygons to obtain common intersections of all the convex polygons; the method comprises the following substeps:
(2.1) judging the positional relationship of two convex polygons according to the relationship of edges, wherein the positional relationship of the two convex polygons comprises: containment, separation, intersection, tangency;
(2.2) when the two convex polygons belong to an intersecting or containing relationship, solving an intersection;
(2.3) repeatedly solving the intersection with the next convex polygon according to the methods of the steps (2.1) - (2.2) until the common intersection of all the convex polygons is obtained;
(3) Overlapping the obtained common intersection with a convex polygon in a database to obtain ground pattern spots and linear ground feature information intersected with the common intersection;
(4) And analyzing the ground pattern spots and the linear ground feature information to obtain pattern spot areas under different ground patterns.
2. The method for analyzing the ground class map spots based on the intersection solving algorithm of two convex polygons according to claim 1, wherein the method for converting the boundary points into the figures is specifically as follows: and forming a convex polygon by sequentially connecting points according to the point serial numbers, the point coordinates, the figure numbers of the points and the ring numbers.
3. The method for analyzing the ground class map spots based on the intersection solving algorithm of two convex polygons according to claim 1, wherein the method for analyzing the shp file is specifically as follows: and obtaining graphic data from a shape field or a geom field in the shp file to obtain a convex polygon.
4. The method for analyzing the ground pattern spots based on the intersection solving algorithm of two convex polygons according to claim 1, wherein the step (2.1) is specifically: solving the number of intersection points of all sides of the two convex polygons A and B, wherein if at least one intersection point exists, the number of the intersection points is limited, and the convex polygons A and B are intersected; if there are countless intersecting points, the convex polygon A is tangent to the convex polygon B; if the number of the intersection points is 0, the A convex polygon is not intersected with the B convex polygon, judging whether all vertexes on the A convex polygon are in the B convex polygon, and if all vertexes on the A convex polygon are in the B convex polygon, the B convex polygon comprises the A convex polygon; otherwise, judging whether all vertexes on the B convex polygon are in the A convex polygon, if so, the A convex polygon comprises the B convex polygon, otherwise, the A convex polygon is separated from the B convex polygon.
5. The method of claim 1, wherein in the step (2.2), when two convex polygons are inclusion relationships, the intersection is an included convex polygon.
6. The method for analyzing the ground pattern spot based on the intersection solving algorithm of two convex polygons according to claim 1, wherein in the step (2.2), when the two convex polygons a and B intersect, the process of solving the intersection is specifically as follows:
(a) Vertex coordinates in the a-convex polygon and the B-convex polygon are stored as vertex sets a (a 1 ,…A i ,…A n ) And B (B) 1 ,…B i ,…B m ) Wherein n is the number of vertexes of the convex polygon A, and m is the number of vertexes of the convex polygon B;
(b) In vertex set A (A 1 ,…A i ,…A n ) Last addition of A 1 An initialization vertex set A' (A) is obtained 1 ,…A i ,…A n ,A 1 ) In vertex set B (B 1 ,…B i ,…B m ) Last added B 1 An initialization vertex set B' (B) is obtained 1 ,…B i ,…,B 1 )；
(c) For any ith vertex A i Judging the vertex A i Relationship with convex polygon B, if A i Inside the convex polygon B, the vertex A i Stored in the set AB, and judged to have the vertex A i If there is an intersection between the edge of (a) and the B-convex polygon, if there is an apex A i The edges of the (a) and the B convex polygon have intersection points, and the intersection points are stored in a set AB;
(d) For any ith vertex B i Determine vertex B i Relationship with the A convex polygon, if B i Inside the convex polygon A, the vertex B i Save and aggregate BA and determine that there is a vertex B i If there is an intersection between the edge of (a) and the convex polygon with the vertex B i The sides of the polygon (B) and the polygon (A) have intersection points, and the intersection points are stored in a combination BA;
(e) Performing step (h) by looping back the set BA forward or backward until the first element of the set BA coincides with the first element of the set AB, otherwise;
(f) By looping back set AB forward or backward until the last element of set AB and the first element of set BA agree;
(g) Deleting the first element in the set BA, moving the rest elements forward by one bit, judging whether the new first element in the set BA is in the set AB, if not, inserting the first element into the end of the set AB, and executing the step (g) again; if the new first element in the set BA is in the set AB, executing the step (f); until the set BA is an empty set, combining the vertex sequences of which the AB is two convex polygons at the moment;
(h) By looping set AB forward or backward until the first element of set AB is consistent with the first element of set BA;
(i) By looping back the set BA forward or backward until the last element of the set BA is consistent with the first element of the set AB;
(j) Deleting the first element in the set AB, moving the rest element forward by one bit, judging whether the new first element in the set AB is in the set BA, if not, inserting the first element into the end of the set BA, and executing the step (j) again; if the new first element in set AB is in set BA, then executing step (i); until set AB is an empty set, at which point the combined BA is the vertex sequence intersection of two convex polygons.
7. The method for analyzing the ground pattern spots based on the intersection solving algorithm of two convex polygons according to claim 1, wherein the step (4) specifically comprises the following sub-steps:
(4.1) grouping the intersected patterns according to the ground class codes of the ground class pattern spots, summing the areas of the intersected patterns of the same group, and inquiring the ground class names and the pattern numbers corresponding to the ground class codes of the ground class pattern spots through a dictionary table;
(4.2) polling the result set of the linear ground object, multiplying the width and length fields of the linear ground object to obtain an area, putting the area into the area result set, grouping the area result set according to the ground type coding fields, and summing the same group of area fields; inquiring a ground class name corresponding to the ground class code of the linear ground object through a dictionary table;
and (4.3) comparing the ground pattern spots with the linear ground object, and subtracting the area of the intersecting pattern in the linear ground object from the area of the intersecting pattern in the ground pattern spots with the same ground pattern name to obtain the pattern spot areas under different ground patterns.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110959917.4A CN113706604B (en) | 2021-08-20 | 2021-08-20 | Ground pattern spot analysis method based on intersection solving algorithm of two convex polygons |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110959917.4A CN113706604B (en) | 2021-08-20 | 2021-08-20 | Ground pattern spot analysis method based on intersection solving algorithm of two convex polygons |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113706604A CN113706604A (en) | 2021-11-26 |
| CN113706604B true CN113706604B (en) | 2024-02-09 |
Family
ID=78654107
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110959917.4A Active CN113706604B (en) | 2021-08-20 | 2021-08-20 | Ground pattern spot analysis method based on intersection solving algorithm of two convex polygons |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113706604B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115731284B (en) * | 2022-11-23 | 2024-06-25 | 中科星图智慧科技安徽有限公司 | Boundary point map spot drawing and area computing algorithm |
| CN115761279B (en) * | 2022-11-29 | 2023-06-23 | 中国国土勘测规划院 | Spatial layout similarity detection method, device, storage medium and apparatus |
| CN117853764B (en) * | 2023-12-25 | 2024-07-23 | 广东国地规划科技股份有限公司 | Pattern spot screening method and system based on regional growth constraint |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101593454A (en) * | 2009-07-09 | 2009-12-02 | 浙江大学 | A method for intelligent output of parcel map |
| CN102542035A (en) * | 2011-12-20 | 2012-07-04 | 南京大学 | Polygonal rasterisation parallel conversion method based on scanning line method |
| CN104298734A (en) * | 2014-09-30 | 2015-01-21 | 东南大学 | Mobile updating method for change pattern spots in land use status change survey |
| CN106897445A (en) * | 2017-03-01 | 2017-06-27 | 武汉科技大学 | It is a kind of that the novel method that operation delimited on border is improved based on ArcGIS |
| CN111858791A (en) * | 2020-05-29 | 2020-10-30 | 广东省土地调查规划院 | Land area acquisition method and device and storage medium |
| CN112562040A (en) * | 2020-12-24 | 2021-03-26 | 杭州中房信息科技有限公司 | Spark-based high-performance calculation method for mass two-tone and three-tone data result flow |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6917877B2 (en) * | 2001-08-14 | 2005-07-12 | Navteq North America, Llc | Method for determining the intersection of polygons used to represent geographic features |
| US7092957B2 (en) * | 2002-01-18 | 2006-08-15 | Boundary Solutions Incorporated | Computerized national online parcel-level map data portal |
-
2021
- 2021-08-20 CN CN202110959917.4A patent/CN113706604B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101593454A (en) * | 2009-07-09 | 2009-12-02 | 浙江大学 | A method for intelligent output of parcel map |
| CN102542035A (en) * | 2011-12-20 | 2012-07-04 | 南京大学 | Polygonal rasterisation parallel conversion method based on scanning line method |
| CN104298734A (en) * | 2014-09-30 | 2015-01-21 | 东南大学 | Mobile updating method for change pattern spots in land use status change survey |
| CN106897445A (en) * | 2017-03-01 | 2017-06-27 | 武汉科技大学 | It is a kind of that the novel method that operation delimited on border is improved based on ArcGIS |
| CN111858791A (en) * | 2020-05-29 | 2020-10-30 | 广东省土地调查规划院 | Land area acquisition method and device and storage medium |
| CN112562040A (en) * | 2020-12-24 | 2021-03-26 | 杭州中房信息科技有限公司 | Spark-based high-performance calculation method for mass two-tone and three-tone data result flow |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113706604A (en) | 2021-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113706604B (en) | Ground pattern spot analysis method based on intersection solving algorithm of two convex polygons | |
| Falcidieno et al. | A new method for the characterization of topographic surfaces | |
| CN102930561B (en) | Delaunay-triangulation-based grid map vectorizing method | |
| CN109190326B (en) | Method and device for generating process flow chart | |
| CN111475559A (en) | Multi-directional conversion method for urban and rural planning result data | |
| CN118350227B (en) | Automatic small watershed division method based on DEM data and model constructor | |
| Lammers et al. | Automating object representation of drainage basins | |
| CN102842104B (en) | Towards the high precision river flood flooding area generation method of magnanimity dem data | |
| CN108629001A (en) | A kind of De-weight method of geography information big data | |
| Attene et al. | Re-meshing techniques for topological analysis | |
| CN110955656A (en) | Vector data topological operation index optimization mechanism and construction method | |
| CN111598769B (en) | Quick grid vector conversion method based on contour tracking and image blocking | |
| CN111199086A (en) | Three-dimensional geometric discretization processing system | |
| Bin et al. | A system for automatic extraction of road network from maps | |
| CN115882867B (en) | Data compression storage method based on big data | |
| CN116431964B (en) | A travel-length stripping method for generating skeleton lines of complex river networks | |
| CN108170989B (en) | Engineering construction model derivation method based on BIM technology | |
| CN102446368A (en) | Rapid slicing method of STL (Stereo Lithography) model based on sorting by triangle adjacency in layers in rapid prototyping manufacturing | |
| CN109710633A (en) | The determination method, apparatus and intelligent terminal of go-between's information | |
| De Floriani et al. | Regular and irregular multi-resolution terrain models: A comparison | |
| CN114372312A (en) | A method for analysis and transformation of building structural steel bar data | |
| CN114944991A (en) | Topological graph editing method, system and tool based on web end | |
| CN107038731A (en) | A kind of complex polygon method of cutting out for solving intersection point degenerate problem | |
| Arge et al. | Computing floods caused by non-uniform sea-level rise | |
| CN110633517A (en) | Efficient slicing method for three-dimensional scene |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 215000 No. 101, Suhong Middle Road, Suzhou Industrial Park, Suzhou City, Jiangsu Province Applicant after: Yuance Information Technology Co.,Ltd. Address before: 215000 No. 101, Suhong Middle Road, Suzhou Industrial Park, Suzhou City, Jiangsu Province Applicant before: SUZHOU INDUSTRIAL PARK SURVEYING MAPPING AND GEOINFORMATION Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |