CN115100317A - Grid-based spatial polygon data topology restoration method and system - Google Patents
Grid-based spatial polygon data topology restoration method and system Download PDFInfo
- Publication number
- CN115100317A CN115100317A CN202210725098.1A CN202210725098A CN115100317A CN 115100317 A CN115100317 A CN 115100317A CN 202210725098 A CN202210725098 A CN 202210725098A CN 115100317 A CN115100317 A CN 115100317A
- Authority
- CN
- China
- Prior art keywords
- polygon
- polygons
- grid
- topology
- polygon data
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 238000007781 pre-processing Methods 0.000 claims abstract description 37
- 230000008439 repair process Effects 0.000 claims abstract description 34
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 12
- 238000004364 calculation method Methods 0.000 claims description 11
- 230000001172 regenerating effect Effects 0.000 claims description 11
- 238000001514 detection method Methods 0.000 claims description 6
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 238000011426 transformation method Methods 0.000 abstract description 4
- 230000005856 abnormality Effects 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 10
- 230000004048 modification Effects 0.000 description 8
- 238000012986 modification Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 7
- 238000007689 inspection Methods 0.000 description 6
- 230000000007 visual effect Effects 0.000 description 4
- 230000007547 defect Effects 0.000 description 2
- 238000009877 rendering Methods 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000008451 emotion Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000010200 validation analysis Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/203—Drawing of straight lines or curves
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/80—Creating or modifying a manually drawn or painted image using a manual input device, e.g. mouse, light pen, direction keys on keyboard
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Generation (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a grid-based method and a grid-based system for repairing the topology of spatial polygon data, wherein the method comprises a polygon data preprocessing step, a grid correction and gap filling processing step and a topology result generating step, and the problems of invalidity, repetition, prickling, intersection and the like in a polygon are automatically detected and automatically removed based on a topology method; completing gap filling among polygons by using a rasterization method; simplifying the polygon boundary obtained by initial repair based on a topology transformation method, converting the polygon into a line, and generating an arc segment; and (4) utilizing a Douglas-Peucker algorithm to thin the arc section and carrying out topology reconstruction. The invention can quickly and automatically check and repair the spatial polygon data under the condition that the spatial polygon data has the abnormalities of invalidity, prickling, repetition, intersection, blank gaps and the like, thereby improving the efficiency of data check and effectively improving the quality of the spatial data.
Description
Technical Field
The invention relates to the technical field of image and data processing, and particularly discloses a grid-based method and a grid-based system for repairing spatial polygon data topology.
Background
Polygon rendering and data processing are common functions in graphics software and geographic information systems software. In the process of mouse drawing, due to factors such as lack of professional skills of a drawer, insufficient experience, psychological fatigue and conflicting emotion brought by long-time repeated labor and the like, the polygon data has a great number of quality problems such as: 1) self-intersecting invalid polygons; 2) the polygon has sharp thorns; 3) repeated polygons drawn for multiple times; 4) intersecting the adjacent polygons; 5) gaps should appear between adjacent polygons. Data quality must be checked and repaired. The current feasible checking and repairing mode is performed by using a topological consistency checking module provided by general GIS (Geographic Information System) software, and the mode cannot process spines, repeated gaps, intersected gaps and slightly larger gaps, so that a lot of work needs manual and visual judgment, time and labor are wasted, the efficiency is low, and errors are easy to occur.
Therefore, the above-mentioned defects existing in the repair process of the existing polygon rendering are the technical problems to be solved at present.
Disclosure of Invention
The invention provides a grid-based method and a grid-based system for repairing spatial polygon data topology, and aims to overcome the defects of the conventional polygon drawing in the repairing process.
One aspect of the invention relates to a grid-based method for repairing spatial polygon data topology, which comprises the following steps:
a polygon data preprocessing step, which is to realize the preprocessing of polygon data by detecting invalid polygons and converting the invalid polygons into valid polygons, detecting spikes and removing the detected spikes, deleting repeated polygons and processing overlapped polygons;
grid correction and gap filling processing steps, based on grid thought, filling gaps among polygons by using orthogonal grids, and grouping and combining to obtain an initial repair result;
a topological result generation step, namely generating and simplifying arc sections from the polygon, and regenerating the polygon by using the simplified arc sections to realize the simplification and the sawtooth removal of the initially repaired polygon boundary; and assigning an attribute value to the newly generated polygon based on the comparison of the polygon before and after the repair.
Further, the polygon data preprocessing step includes:
searching invalid polygons in the polygon data, converting the searched invalid polygons into valid polygons, and removing tiny holes and islands in the invalid polygons;
finding spines and repeated parts in the polygon data, and removing the found spines and repeated parts;
classifying and processing the intersection situation of the polygons, classifying the intersection polygon situation into three types of suspected intersection, suspected overlap and tiny intersection, and removing the intersection part according to the rule.
Further, the grid correcting and caulking process step includes:
determining gap filling parameters, wherein the gap filling parameters comprise grid range, clipping region, grid size, gap maximum value and calculation parallel line number;
generating space topology repair grids in parallel, and calculating polygons to which each grid belongs according to a principle that a preselected set person includes who belongs, who accounts for more than who belongs, and who is close to who belongs;
and classifying and combining the grids according to the subordinate polygons to obtain an initial repairing result.
Further, the topology result generating step includes:
converting the polygon into lines, and solving the intersection points between the lines; breaking from the intersection point to generate an arc section, and removing the weight of the arc section;
utilizing a Douglas-Peucker algorithm to thin the arc section to obtain a simplified arc section;
and reconstructing the topology based on the simplified arc segments, and deriving a new polygon repairing result from the topology.
Further, the step of generating topology result further comprises:
preprocessing polygon data, and removing spines, invalid polygons, repeated polygons and intersection parts of the polygons;
based on the grid thought, filling gaps among polygons by using orthogonal grids, and grouping and combining the gaps to obtain an initial repair result;
generating and simplifying arc sections from the polygon, and regenerating the polygon by using the simplified arc sections to realize simplification and sawtooth removal of the initially repaired polygon boundary;
and (4) giving an attribute value to the newly generated polygon based on comparison of the polygon before and after repairing, and finally realizing topology detection and repairing of the polygon data.
Another aspect of the present invention relates to a grid-based spatial polygon data topology repair system, comprising:
the polygon data preprocessing module is used for preprocessing the polygon data by detecting invalid polygons, converting the invalid polygons into valid polygons, detecting spikes, removing the detected spikes, deleting repeated polygons and processing overlapped polygons;
the grid correction and gap filling processing module is used for filling the gaps among the polygons by using orthogonal grids based on the grid thought, grouping and combining the gaps to obtain an initial repairing result;
the topological result generating module is used for generating and simplifying arc segments from the polygon, and regenerating the polygon by using the simplified arc segments to realize simplification and sawtooth removal on the initially repaired polygon boundary; and assigning attribute values to the newly generated polygons based on comparison of the polygons before and after the restoration.
Further, the polygon data preprocessing module comprises:
the first searching unit is used for searching invalid polygons in the polygon data, converting the searched invalid polygons into valid polygons and removing tiny holes and islands in the invalid polygons;
the second searching unit is used for searching the spines and the repeated parts in the polygon data and removing the found spines and repeated parts;
and the intersection processing unit is used for classifying and processing the intersection situation of the polygons, classifying the intersection polygon situation into three types of suspected intersection, suspected overlap and fine intersection, and removing the intersection part according to rules.
Further, the grid correction and caulking process module includes:
the determining unit is used for determining gap filling parameters, and the gap filling parameters comprise grid range, clipping region, grid size, gap maximum value and calculation parallel line number;
the calculation unit is used for generating the spatial topology repairing grids in parallel and calculating the polygon to which each grid belongs according to the pre-selected and set principle that who includes who belongs, who occupies more than who belongs, and who is close to who belongs;
and the merging unit is used for classifying and merging the grids according to the subordinate polygons to obtain an initial restoration result.
Further, the topology result generation module comprises:
the conversion unit is used for converting the polygon into a line and solving an intersection point between the lines; breaking from the intersection point to generate an arc section, and removing the weight of the arc section;
the thinning unit is used for thinning the arc section by using a Douglas-Peucker algorithm to obtain a simplified arc section;
and the reconstruction unit is used for reconstructing the topology based on the simplified arc segment and deriving a new polygon repair result from the topology.
Further, the topology result generation module further comprises:
the preprocessing unit is used for preprocessing the polygon data and removing spines, invalid polygons, repeated polygons and intersection parts of the polygons;
the filling unit is used for filling gaps among polygons by utilizing orthogonal grids based on a grid idea, grouping and combining the gaps to obtain an initial repairing result;
the simplifying unit is used for generating and simplifying arc segments from the polygon, and regenerating the polygon by using the simplified arc segments to realize simplification and sawtooth removal of the initially repaired polygon boundary;
and the assignment unit is used for giving an attribute value to the newly generated polygon based on comparison of the polygon before and after repair, and finally realizing topology detection and repair of the polygon data.
The beneficial effects obtained by the invention are as follows:
the invention provides a grid-based method and a grid-based system for repairing the topology of spatial polygon data, wherein the method comprises a polygon data preprocessing step, a grid correcting and gap filling processing step and a topology result generating step, and the problems of invalidity, repetition, prickling, intersection and the like in a polygon are automatically detected and automatically removed based on a topology method; completing gap filling among polygons by using a rasterization method; simplifying the polygon boundary obtained by initial repair based on a topology transformation method, converting the polygon into a line, and generating an arc segment; and (4) utilizing a Douglas-Peucker algorithm to thin the arc section and carrying out topology reconstruction. The grid-based method and system for repairing the space polygon data topology solve the problems of time and labor consumption, low efficiency and the like caused by manual visual judgment, can quickly and automatically realize the topology modification of the polygon data, and improve the efficiency of data inspection; the method solves the problem of processing invalid, sharp, repeated, intersected and other wrong polygon data which cannot be processed by conventional topology inspection, and effectively improves the quality of spatial data.
Drawings
FIG. 1 is a schematic flowchart of an embodiment of a grid-based method for repairing a topology of spatial polygon data according to the present invention;
FIG. 2 is a functional block diagram of an embodiment of a grid-based polygon data topology repair system provided by the present invention;
FIG. 3 is a functional block diagram of an embodiment of the polygon data pre-processing module shown in FIG. 2;
FIG. 4 is a functional block diagram of one embodiment of the grid calibration and caulking process module shown in FIG. 2;
FIG. 5 is a functional block diagram of a first embodiment of a topology result generation module shown in FIG. 2;
fig. 6 is a functional block diagram of a second embodiment of the topology result generation module shown in fig. 2.
The reference numbers illustrate:
10. a polygon data preprocessing module; 20. a grid correction and gap filling processing module; 30. a topology result generation module; 11. a first search unit; 12. a second search unit; 13. an intersection processing unit; 21. a determination unit; 22. a calculation unit; 23. a merging unit; 31. a conversion unit; 32. a thinning unit; 33. a thinning unit; 34. a pre-processing unit; 35. a filling unit; 36. a simplification unit; 37; and an assignment unit.
Detailed Description
In order to better understand the technical solution, the technical solution will be described in detail with reference to the drawings and the specific embodiments.
As shown in fig. 1, a first embodiment of the present invention provides a grid-based method for repairing a spatial polygon data topology, including the following steps:
and S100, a polygon data preprocessing step, namely preprocessing the polygon data by detecting invalid polygons and converting the invalid polygons into valid polygons, detecting spikes and removing the detected spikes, deleting repeated polygons and processing overlapped polygons.
Specifically, step S100 includes:
and S110, searching invalid polygons in the polygon data, converting the searched invalid polygons into valid polygons, and removing tiny holes and islands in the invalid polygons.
And S120, finding the spines and the repeated parts in the polygon data, and removing the found spines and the repeated parts.
And step S130, classifying and processing the intersection situation of the polygons, classifying the intersection situation of the polygons into three categories of suspected intersection, suspected overlap and fine intersection, and removing the intersection part according to rules.
And S200, grid correction and gap filling processing, namely filling gaps among polygons by using orthogonal grids based on a grid thought, and grouping and combining the gaps to obtain an initial repairing result.
Specifically, the step S200 includes:
step S210, determining gap filling parameters, where the gap filling parameters include a grid range, a clipping region, a grid size, a gap maximum value, and a parallel line number.
And S220, generating the spatial topology repairing grids in parallel, and calculating the polygon to which each grid belongs according to the preset principle that who contains who, who accounts for more than who and who is close to who.
And step S230, classifying and combining the grids according to the subordinate polygons to obtain an initial repairing result.
Step S300, a topological result generation step, namely generating and simplifying arc sections from the polygon, and regenerating the polygon by using the simplified arc sections to realize simplification and sawtooth removal of the initially repaired polygon boundary; and assigning an attribute value to the newly generated polygon based on the comparison of the polygon before and after the repair.
Specifically, step S300 includes:
step S310, converting the polygon into a line, and solving an intersection point between the lines; and breaking from the intersection point to generate an arc segment, and removing the weight of the arc segment.
And S320, utilizing a Douglas-Peucker algorithm to thin the arc section to obtain a simplified arc section.
And S330, reconstructing the topology based on the simplified arc segment, and deriving a new polygon repairing result from the topology.
Step S340, preprocessing the polygon data, and removing spines, invalid polygons, repeated polygons and intersection parts of the polygons;
step S350, based on the grid idea, filling gaps among polygons by using orthogonal grids, and grouping and combining the gaps to obtain an initial repairing result;
s360, generating arc segments from the polygon, simplifying the arc segments, and regenerating the polygon by using the simplified arc segments to realize simplification and sawtooth removal of the initially repaired polygon boundary;
and step S370, attribute values are given to the newly generated polygons based on comparison of the polygons before and after repair, and finally topology detection and repair of the polygon data are achieved.
The method for repairing the space polygon data topology based on the grid comprises a polygon data preprocessing step, a grid correction and gap filling processing step and a topology result generation step, wherein the problems of invalidity, repetition, prickling, intersection and the like in the polygon are automatically detected and automatically removed based on a topology method; completing gap filling among polygons by using a rasterization method; simplifying the polygon boundary obtained by initial repair based on a topology transformation method, converting the polygon into a line, and generating an arc segment; and (4) utilizing a Douglas-Peucker algorithm to thin the arc section and carrying out topology reconstruction. The method solves the problems of time and labor consumption, low efficiency and the like caused by manual and visual judgment, can quickly and automatically realize the topology modification of the polygon data, and improves the efficiency of data inspection; the method solves the problem that the conventional topology inspection cannot process invalid, sharp, repeated, intersected and other wrong polygon data, and effectively improves the quality of spatial data.
Referring to fig. 2 to 6, fig. 2 is a functional block diagram of an embodiment of a grid-based polygon data topology repair system according to the present invention, in the embodiment, the grid-based polygon data topology repair system includes a polygon data preprocessing module 10, a grid correction and gap filling processing module 20, and a topology result generating module 30, where the polygon data preprocessing module 10 is configured to implement preprocessing of polygon data by detecting an invalid polygon and converting it into a valid polygon, detecting a spike and removing the detected spike, deleting a duplicate polygon, and processing an overlapping polygon; the grid correction and gap filling processing module 20 is used for filling, grouping and combining the gaps among the polygons by using orthogonal grids based on the grid idea to obtain an initial repairing result; a topology result generation module 30, configured to generate and simplify an arc segment from a polygon, and regenerate the polygon by using the simplified arc segment, so as to simplify and remove the jaggies of an initially repaired polygon boundary; and assigning an attribute value to the newly generated polygon based on the comparison of the polygon before and after the repair.
Further, please refer to fig. 3, fig. 3 is a schematic diagram of a functional module of an embodiment of the polygon data preprocessing module shown in fig. 2, in this embodiment, the polygon data preprocessing module 10 includes a first searching unit 11, a second searching unit 12 and an intersecting processing unit 13, where the first searching unit 11 is configured to search for an invalid polygon in the polygon data, convert the searched invalid polygon into a valid polygon, and remove a tiny hole and an island in the invalid polygon; a second searching unit 12, configured to search for a spike and a repeated portion in the polygon data, and remove the found spike and repeated portion; the intersection processing unit 13 is configured to classify and process the intersection situation of the polygons, classify the intersection situation of the polygons into three categories, namely suspected intersection, suspected overlap and fine intersection, and remove the intersection part according to the rule.
Preferably, referring to fig. 4, fig. 4 is a functional module schematic diagram of an embodiment of the grid correction and gap filling processing module shown in fig. 2, in this embodiment, the grid correction and gap filling processing module 20 includes a determining unit 21, a calculating unit 22 and a merging unit 23, where the determining unit 21 is configured to determine gap filling parameters, and the gap filling parameters include a grid range, a clipping region, a grid size, a maximum gap value and a number of parallel lines; the calculation unit 22 is used for generating the spatial topology repairing grids in parallel and calculating the polygon to which each grid belongs according to the pre-selected and set principle that who includes who belongs, who occupies more than who belongs, and who is close to who belongs; and the merging unit 23 is configured to classify and merge the grids according to the subordinate polygons to obtain an initial repair result.
Further, referring to fig. 5, fig. 5 is a functional module schematic diagram of a first embodiment of the topology result generating module shown in fig. 2, in this embodiment, the topology result generating module 30 includes a converting unit 31, a thinning unit 32 and a reconstructing unit 33, where the converting unit 31 is configured to convert a polygon into a line and find an intersection point between the line and the line; breaking from the intersection point to generate an arc section, and removing the weight of the arc section; a thinning unit 32, configured to thin the arc segment by using a Douglas-Peucker (Douglas-pocker algorithm) algorithm to obtain a simplified arc segment; and a reconstruction unit 33, configured to reconstruct the topology based on the simplified arc segments, and derive a new polygon repair result from the topology.
Preferably, please refer to fig. 6, where fig. 6 is a schematic diagram of a functional module of the second embodiment of the topology result generating module shown in fig. 2, and based on the first embodiment, the topology result generating module provided in this embodiment further includes a preprocessing unit 34, a filling unit 35, a simplifying unit 36, and an assigning unit 37, where the preprocessing unit 34 is configured to preprocess polygon data and remove spines, invalid polygons, repeated polygons, and intersecting portions of polygons; the filling unit 35 is configured to fill gaps between polygons by using orthogonal meshes based on a grid idea, and group and combine the gaps to obtain an initial repair result; the simplifying unit 36 is used for generating and simplifying arc segments from the polygon, and regenerating the polygon by using the simplified arc segments to realize the simplification and the sawtooth removal of the initially repaired polygon boundary; and the assigning unit 37 is configured to assign an attribute value to the newly generated polygon based on comparison between the polygon before and after the repair, and finally implement topology detection and repair of the polygon data.
The system for repairing the polygon data topology based on the grid provided by the embodiment adopts the polygon data preprocessing module 10, the grid correction and gap filling processing module 20 and the topology result generating module 30, and automatically detects and automatically removes the problems of invalidity, repetition, prick, intersection and the like existing in the polygon based on the topology method; completing gap filling among polygons by using a rasterization method; simplifying the polygon boundary obtained by initial repair based on a topology transformation method, converting the polygon into a line, and generating an arc segment; and (4) utilizing a Douglas-Peucker algorithm to thin the arc section and carrying out topology reconstruction. The method solves the problems of time and labor consumption, low efficiency and the like caused by manual and visual judgment, can quickly and automatically realize the topology modification of the polygon data, and improves the efficiency of data inspection; the method solves the problem of processing invalid, sharp, repeated, intersected and other wrong polygon data which cannot be processed by conventional topology inspection, and effectively improves the quality of spatial data.
The following describes the grid-based spatial polygon data topology repairing method and system provided by the present invention with specific examples:
the invention mainly comprises four links: (1) a polygon data preprocessing link; (2) filling gaps among polygons; (3) simplifying the thinning of the polygon boundary; (4) and (5) performing reassignment of the polygon attributes.
Example 1 polygonal data preprocessing
Firstly, polygonal data with topology errors are loaded, coordinates are converted into length coordinates meeting the calculation requirements according to specific conditions, the polygonal data are judged to be invalid, sharp, repeated, intersected and the like, corresponding processing is carried out, and a polygonal data set only containing gap errors is obtained.
And importing polygon space data into a space database, defining uniqueness constraint for each polygon, carrying out coordinate transformation, and converting the coordinate from an angle value to a length value. By using self-developed database extension and using a structured query statement facing spatial data, the method realizes the condition-based processing of invalid polygon validation, spine removal, repeated polygon removal and intersected polygons.
Example 2 grid-based inter-polygon gap filling
Firstly, counting the minimum surrounding areas of all polygons, generating a correction grid according to preset parameters, judging the polygon to which each grid belongs, and grouping and combining the polygons according to the membership polygons to obtain a primarily corrected repair result without topology errors.
Self-defining a grid generating function in a PostGIS database, generating a grid by utilizing SQL sentences and storing the grid into a table; using a space operation function of a PostGIS (geographic information System), carrying out combined query on the grid table and the polygon table, calculating a polygon to which each grid belongs, and storing the unique number of the polygon as an attribute of the grid; and then, using a space joint aggregation function and a grouping summary statement of the PostGIS to obtain an initial repair result after grouping and merging. The polygon in the initial repairing result is conveniently jagged, and the data volume is large.
Example 3 polygon boundary simplification
Firstly, converting polygons into lines; then, performing intersection calculation on the line, and breaking the line from the intersection point to obtain an arc section; then, utilizing a Douglas-Peucker algorithm to thin the arc section to obtain a simplified arc section; and constructing a topological relation based on the simplified arc segments, and deriving the repaired polygon from the topological relation.
In a PostGIS database, polygon data are converted into line data by using a space data storage function of a PostGIS, then lines are broken by using a space relation judgment function and a linear piecewise function to obtain arc sections, then the arc sections are simplified by using a space rarefaction function, and finally a space topological relation is constructed by using pgRouting and the polygon data with topology errors are derived.
Example 4 polygonal Attribute assignment
Based on the polygon data before and after the restoration, the method determines which polygon before the restoration should correspond to the restored polygon according to the proportion of the overlapping area between the two polygons to the original polygon area, and assigns the attribute of the polygon before the restoration to the restored polygon.
In a PostGIS database, the intersection condition of polygons before and after repairing is calculated by using a structured query statement, the area proportion of an intersection part in an original polygon is obtained by using a space area calculation function, and the attribute of the original polygon is given to the repaired polygon by using an updating statement.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention. It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (10)
1. A grid-based method for repairing the topology of spatial polygon data is characterized by comprising the following steps:
a polygon data preprocessing step, which is to realize the preprocessing of polygon data by detecting invalid polygons and converting the invalid polygons into valid polygons, detecting spikes and removing the detected spikes, deleting repeated polygons and processing overlapped polygons;
grid correction and gap filling processing steps, based on grid thought, filling gaps among polygons by using orthogonal grids, and grouping and combining to obtain an initial repair result;
a topological result generation step, namely generating and simplifying arc sections from the polygon, and regenerating the polygon by using the simplified arc sections to realize the simplification and the sawtooth removal of the initially repaired polygon boundary; and according to the comparison of the polygons before and after the restoration, an attribute value is given to the newly generated polygon.
2. The grid-based spatial polygon data topology restoration method according to claim 1, wherein the spatial polygon data preprocessing step includes:
searching invalid polygons in polygon data, converting the searched invalid polygons into valid polygons, and removing tiny holes and islands in the invalid polygons;
finding spikes and repeated parts in the polygon data, and removing the found spikes and repeated parts;
classifying and processing the intersection situation of the polygons, classifying the intersection polygon situation into three categories of suspected intersection, suspected overlap and tiny intersection, and removing the intersection part according to the rule.
3. The grid-based spatial polygon data topology restoration method of claim 1, wherein the grid correction and caulking process step comprises:
determining gap filling parameters, wherein the gap filling parameters comprise grid range, clipping region, grid size, gap maximum value and calculation parallel line number;
parallelly generating a space topology repairing grid, and calculating a polygon to which each lattice belongs according to a pre-selected set principle that who contains who belongs, who occupies multiple parties, and who is close to who;
and classifying and combining the grids according to the subordinate polygons to obtain an initial repairing result.
4. The grid-based spatial polygon data topology restoration method of claim 1, wherein the topology result generating step comprises:
converting the polygon into lines, and solving the intersection points between the lines; breaking from the intersection point to generate an arc section, and removing the weight of the arc section;
utilizing a Douglas-Peucker algorithm to thin the arc section to obtain a simplified arc section;
and reconstructing the topology based on the simplified arc segments, and deriving a new polygon repairing result from the topology.
5. The grid-based spatial polygon data topology restoration method according to claim 4, wherein the topology result generation step further comprises:
preprocessing polygon data, and removing spines, invalid polygons, repeated polygons and intersection parts of the polygons;
based on the grid thought, filling gaps among polygons by using orthogonal grids, and grouping and combining the gaps to obtain an initial repair result;
generating and simplifying arc sections from the polygon, and regenerating the polygon by using the simplified arc sections to realize simplification and sawtooth removal of the initially repaired polygon boundary;
and (4) giving an attribute value to the newly generated polygon based on comparison of the polygon before and after repairing, and finally realizing topology detection and repairing of the polygon data.
6. A grid-based spatial polygon data topology repair system, comprising:
a polygon data preprocessing module (10) for preprocessing polygon data by detecting invalid polygons and converting them into valid polygons, detecting spikes and removing the detected spikes, deleting duplicate polygons, and processing overlapping polygons;
the grid correction and gap filling processing module (20) is used for filling the gaps among the polygons by using orthogonal grids based on a grid thought, grouping and combining the gaps to obtain an initial repairing result;
the topological result generating module (30) is used for generating and simplifying arc segments from the polygon, and regenerating the polygon by using the simplified arc segments to realize simplification and sawtooth removal on the initially repaired polygon boundary; and assigning attribute values to the newly generated polygons based on comparison of the polygons before and after the restoration.
7. The grid-based spatial polygon data topology restoration system according to claim 6, wherein the polygon data preprocessing module (10) comprises:
the first searching unit (11) is used for searching invalid polygons in the polygon data, converting the searched invalid polygons into valid polygons and removing tiny holes and islands in the invalid polygons;
the second searching unit (12) is used for searching for spines and repeated parts in the polygon data and removing the found spines and repeated parts;
and the intersection processing unit (13) is used for classifying and processing the intersection situation of the polygons, classifying the intersection polygon situation into three types of suspected intersection, suspected overlap and tiny intersection, and removing the intersection part according to rules.
8. The grid-based spatial polygon data topology restoration system according to claim 6, wherein the grid correction and caulking processing module (20) comprises:
the determining unit (21) is used for determining gap filling parameters, and the gap filling parameters comprise a grid range, a clipping region, a grid size, a gap maximum value and a calculation parallel line number;
the calculation unit (22) is used for generating the spatial topology restoration grids in parallel and calculating the polygons to which each grid belongs according to the pre-selected and set principle that who contains who belongs, who accounts for more than who belongs and who is close to who belongs;
and the merging unit (23) is used for classifying and merging the grids according to the subordinate polygons to obtain an initial restoration result.
9. The grid-based spatial polygon data topology restoration system according to claim 6, wherein the topology result generation module (30) comprises:
a conversion unit (31) for converting the polygon into lines and finding intersections between the lines; breaking from the intersection point to generate an arc section, and removing the weight of the arc section;
the thinning unit (32) is used for thinning the arc section by using a Douglas-Peucker algorithm to obtain a simplified arc section;
and the reconstruction unit (33) is used for reconstructing the topology based on the simplified arc segments and deriving a new polygon repair result from the topology.
10. The grid-based spatial polygon data topology restoration system according to claim 9, wherein the topology result generation module (30) further comprises:
the preprocessing unit (34) is used for preprocessing the polygon data and removing spines, invalid polygons, repeated polygons and intersection parts of the polygons;
a filling unit (35) for filling and grouping and combining the gaps among the polygons by using orthogonal meshes based on the grid idea to obtain an initial repairing result;
the simplifying unit (36) is used for generating and simplifying arc segments from the polygon, and regenerating the polygon by using the simplified arc segments to realize the simplification and the sawtooth removal of the initially repaired polygon boundary;
and the assignment unit (37) is used for assigning attribute values to the newly generated polygons based on comparison of the polygons before and after repair, and finally realizing topology detection and repair of the polygon data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210725098.1A CN115100317B (en) | 2022-06-24 | 2022-06-24 | Space polygon data topology restoration method and system based on grids |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210725098.1A CN115100317B (en) | 2022-06-24 | 2022-06-24 | Space polygon data topology restoration method and system based on grids |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115100317A true CN115100317A (en) | 2022-09-23 |
| CN115100317B CN115100317B (en) | 2023-08-01 |
Family
ID=83292358
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210725098.1A Active CN115100317B (en) | 2022-06-24 | 2022-06-24 | Space polygon data topology restoration method and system based on grids |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115100317B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105468693A (en) * | 2015-11-17 | 2016-04-06 | 南京师范大学 | High-efficiency topological relation calculation method |
| CN105931295A (en) * | 2016-07-13 | 2016-09-07 | 中国地质大学（北京） | Geological map thematic information extraction method |
| US20180357797A1 (en) * | 2017-06-13 | 2018-12-13 | Mapbox, Inc. | Generating Valid Polygon Data Based on Input Data with Errors |
| US20200388059A1 (en) * | 2019-06-10 | 2020-12-10 | Mappedin Inc. | System and method for tracing polygons in design files |
-
2022
- 2022-06-24 CN CN202210725098.1A patent/CN115100317B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105468693A (en) * | 2015-11-17 | 2016-04-06 | 南京师范大学 | High-efficiency topological relation calculation method |
| CN105931295A (en) * | 2016-07-13 | 2016-09-07 | 中国地质大学（北京） | Geological map thematic information extraction method |
| US20180357797A1 (en) * | 2017-06-13 | 2018-12-13 | Mapbox, Inc. | Generating Valid Polygon Data Based on Input Data with Errors |
| US20200388059A1 (en) * | 2019-06-10 | 2020-12-10 | Mappedin Inc. | System and method for tracing polygons in design files |
Non-Patent Citations (2)
| Title |
|---|
| 卢照敢,杨天行: "地理信息系统中空间关系自动构建技术研究", 长春工程学院学报(自然科学版), no. 04 * |
| 王杰臣: "多边形拓扑关系构建的栅格算法", 测绘学报, no. 03 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115100317B (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111709092B (en) | Radial tire tread pattern finite element automatic modeling method based on finite element unit nodes | |
| CN110276732B (en) | Mountain area point cloud cavity repairing method considering topographic characteristic line elements | |
| CN115346012B (en) | Intersection face generation method, device, equipment, storage medium and program product | |
| WO2020098315A1 (en) | Information matching method and terminal | |
| CN109461209B (en) | Novel structural grid generation method | |
| CN108629001A (en) | A kind of De-weight method of geography information big data | |
| CN103838907A (en) | Curved surface cutting trajectory obtaining method based on STL model | |
| Lonergan et al. | An iterative displacement method for conflict resolution in map generalization | |
| CN112685942A (en) | Method for rapidly dividing finite element grids of complex tread patterns | |
| CN111428811B (en) | Method for recognizing and processing self-intersection pattern of single-ring polygon | |
| CN111428095A (en) | Graph data quality verification method and graph data quality verification device | |
| CN115100317B (en) | Space polygon data topology restoration method and system based on grids | |
| CN111986324B (en) | Equivalent surface construction method based on meteorological elements | |
| CN111241228B (en) | Comprehensive drawing method based on vector data and graphic processing technology | |
| CN117010666A (en) | Intelligent management method and system for production workstation of automobile repair tool | |
| Son et al. | Automatic 3D reconstruction of as-built pipeline based on curvature computations from laser-scanned data | |
| CN116796400A (en) | BIM digital storage data format exchange method based on webGL | |
| CN115906528A (en) | Automatic preprocessing method, system, equipment and storage medium for welding structure model | |
| CN114089692A (en) | Rapid numerical control programming method suitable for complex and long surface of part | |
| CN108776986A (en) | A kind of method of redundancy triangle on Delete Mesh | |
| CN111914139A (en) | Working face automatic division method, electronic equipment and storage medium | |
| CN111222682A (en) | Second-order optimization simplification method for map boundary data | |
| CN116912395B (en) | Graphics hybrid rendering method and device based on OpenGL and storage medium | |
| CN115828827B (en) | Method, system and storage medium for reconstructing hierarchical structure of integrated circuit design layout | |
| CN115830007B (en) | Pavement void detection method and system based on image recognition |
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 |