Intelligent restoration method for ground object vector data suspension point

Abstract

The invention relates to the technical field of electric digital data processing, and particularly discloses an intelligent restoration method for ground object vector data suspension points, which comprises the following steps of: importing ground object vector data into an iData platform, checking the suspension points of the current data by a tool of the iData platform, classifying according to scenes formed by the suspension points, and storing the suspension points of the current data into a database; a user autonomously selects a processing method from the repair tools and sets distance parameters according to the quality of the map vector data to solve the suspension points in the map vector data, and the iData platform carries the repair tools for performing connection repair, extension repair and cutting repair on line segments where the suspension points in the map vector data are located. The problem that a traditional suspension point repairing method for vector data in a geographic information system can only carry out single processing on data of a single ground feature type and cannot carry out batch processing on whole drawing data is solved.

Description

Technical Field

[0001] The present application relates to the technical field of electronic digital data processing, and specifically discloses a method for intelligently repairing suspension points of ground feature vector data. Background Art

[0002] Geographic Information System (GIS) is a system that integrates a variety of geographic spatial information. The data in the geographic information system is usually divided into raster data and vector data. Vector data has become the mainstream way to represent objects in geographic space due to its high precision and flexibility.

[0003] Vector data usually uses geometric shapes such as points, lines, and surfaces to represent land features. Points represent specific locations and various land feature points, lines represent linear land features such as roads and rivers, and surfaces represent planar land features such as houses, buildings, and cultivated land.

[0004] In the process of vector data processing, repairing dangling points is a key task. Dangling points refer to incorrect geographic locations in vector data due to topological errors or data inconsistencies. They are usually manifested as line segment endpoints hanging in the air without connecting to other nodes. This node (endpoint) is called a dangling node. It usually manifests itself as overlapping, breaking, intersecting and offsetting line segments. In order to ensure the accuracy and consistency of vector data, vector data needs to be repaired.

[0005] Common methods for repairing hanging points include manual repair and semi-automatic tools. Manual repair requires operators to visually view the image data, identify the existing hanging point area, find the line segment where the hanging point is located, and then repair it one by one;

[0006] Through the semi-automatic repair method introduced by many GIS tools, the errors of hanging points in the image are identified through topological relationship checks, and then manual modifications and troubleshooting are performed based on the corresponding hanging point errors.

[0007] However, whether it is traditional repair or repair combined with semi-automatic tools, it is usually only possible to process data of a single type of land object individually. It is necessary to select the repair method for each data and confirm the operation. In this way, for vector data of multiple types of land objects, the processing process will be very complicated and tedious and prone to errors, and it is impossible to perform batch processing on the entire drawing data.

[0008] Therefore, the present invention provides a method for intelligently repairing suspension points of ground object vector data to solve the above-mentioned problems. Summary of the invention

[0009] The purpose of the present invention is to solve the problem that the traditional method for repairing hanging points of vector data in a geographic information system can only process data of a single type of land object individually, but cannot perform batch processing on the entire map data.

[0010] In order to achieve the above-mentioned object, the basic scheme of the present invention provides a method for intelligently repairing suspension points of ground object vector data, comprising the following steps:

[0011] Step A1: Import the ground feature vector data into the iData platform, use the iData platform tool to check the suspension points of the current data, and classify the scenes according to the suspension points;

[0012] Step A2: The user independently selects a processing method from the repair tool and sets a distance parameter according to the quality of the map vector data to resolve the hanging points in the map vector data;

[0013] In step A1, the iData platform is equipped with a repair tool for repairing the line segment where the hanging point is located in the map vector data. The repair tool includes three repair modes for the line segment where the hanging point is located: connection repair, extension repair and clipping repair.

[0014] Furthermore, the steps for repairing the connection of the line segment where the suspension point is located are as follows:

[0015] Step B101: The user independently sets a distance parameter to represent the range radius of each suspension point to search for other suspension points and nodes around it;

[0016] Step B102: Each suspension point searches for other suspension points and nodes within the search range radius;

[0017] Step B103: After finding other suspension points or nodes within the search range radius, create a line segment from suspension point to suspension point or from suspension point to node.

[0018] Furthermore, in the process of connection repair, when creating a line segment connecting the suspension points, the coordinate sequence of the line segment will be stored in a set. When creating the line segment again, it will be judged whether it intersects and repeats based on the line segments in the set. If it intersects and repeats, the creation of the line segment will be cancelled.

[0019] Furthermore, during the connection repair process, when there is no other hanging point within the search range radius of the hanging point, it is necessary to create a line segment from the hanging point to the node and form a connecting line that does not intersect with other line segments.

[0020] Furthermore, the steps for extending and repairing the line segment where the suspension point is located are as follows:

[0021] Step B201: The user independently sets a distance parameter to represent the range radius of each suspension point to search for other suspension points and nodes around it;

[0022] Step B202: Each suspension point searches for other suspension points and nodes within the search range radius;

[0023] Step B203: When no other hanging points and nodes are found within the search range radius, an extension line is made through the line segment where the hanging point is located to obtain the intersection with other line segments within the search range radius, and a line segment from the hanging point to the intersection is created.

[0024] Furthermore, the steps for trimming and repairing the line segment where the hanging point is located are as follows:

[0025] Step B301: The user independently sets a distance parameter to represent the range radius of the intersection of the line segments around each suspension point;

[0026] Step B302: Each suspension point searches for intersections within the search range radius;

[0027] Step B303: When an intersection is found within the search range, the line segments forming the intersection within the search range are re-encoded and reconstructed with the intersection as the endpoint to achieve clipping to eliminate the hanging points.

[0028] Furthermore, when performing step A2, during the process of repairing the hanging points, firstly, the connection repair of the hanging points is performed for the map vector data of the same coding type that has connection gaps and needs to be closed but is not closed.

[0029] The principle and effect of this scheme are:

[0030] 1. Compared with the prior art, the present invention can efficiently repair the hanging points of vector data of different types of objects. Combining iData data classification and data reading and writing, a batch processing algorithm is designed, which significantly improves the processing efficiency when processing large-scale data. Through automated processing, the repair task of a large amount of data can be completed in a short time, significantly reducing the workload of operators.

[0031] 2. Compared with the prior art, the present invention not only supports the repair of vector data of a single feature type, but also can process data of multiple feature types at the same time, and can provide flexible repair solutions according to different data processing requirements. Users can configure algorithm parameters according to actual needs or data quality trade-offs to achieve optimized processing of specific types of data, solving the problem that the traditional hanging point repair method for vector data in geographic information systems can only process data of a single feature type individually, and cannot perform batch processing of the entire map data. BRIEF DESCRIPTION OF THE DRAWINGS

[0032] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without paying any creative work.

[0033] Figure 1 A flow chart of a method for intelligently repairing hanging points of ground feature vector data proposed in an embodiment of the present application is shown;

[0034] Figure 2 A schematic diagram of connection repair of a method for intelligently repairing suspension points of ground feature vector data proposed in an embodiment of the present application is shown;

[0035] Figure 3 A schematic diagram of connection repair of a method for intelligently repairing suspension points of ground feature vector data proposed in an embodiment of the present application is shown;

[0036] Figure 4 A schematic diagram showing an extended repair of a method for intelligently repairing suspension points of ground feature vector data proposed in an embodiment of the present application is shown;

[0037] Figure 5 A schematic diagram of clipping and repairing of a method for intelligently repairing hanging points of ground feature vector data proposed in an embodiment of the present application is shown;

[0038] Figure 6 A schematic diagram showing the cultivated land line of the cultivated land line area proposed in the embodiment of the present application;

[0039] Figure 7 A schematic diagram showing the amount of data selected for repairing the cultivated land line and the time for repairing in the connection mode proposed in the embodiment of the present application;

[0040] Figure 8 A schematic diagram showing a vector map of another region proposed in an embodiment of the present application is shown;

[0041] Fig. 9 A comparison diagram is shown after the vector data of the vector map patch of another region proposed in an embodiment of the present application is repaired. DETAILED DESCRIPTION

[0042] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the specific implementation mode, structure, characteristics and effects of the present invention are described in detail below in combination with the accompanying drawings and preferred embodiments.

[0043] A method for intelligently repairing suspension points of ground feature vector data, for example Figure 1 As shown, the following steps are included:

[0044] Step A1: Import the ground feature vector data into the iData platform, use the iData platform tool to check the suspension points of the current data, and classify the scenes according to the suspension points;

[0045] Step A2: The user independently selects a processing method from the repair tool and sets a distance parameter according to the quality of the map vector data to resolve the hanging points in the map vector data.

[0046] In step A1, the iData platform is equipped with a repair tool for repairing the line segment where the hanging point is located in the map vector data. The repair tool includes three repair modes for the line segment where the hanging point is located: connection repair, extension repair and clipping repair.

[0047] like Figure 2 As shown, the connection repair of the suspension point is to connect the suspension point to the suspension point or the suspension point to the node when there are other suspension points or nodes around the suspension point, including the following steps:

[0048] Step B101: The user independently sets a distance parameter to represent the range radius of each suspension point to search for other suspension points and nodes around it;

[0049] Step B102: Each suspension point searches for other suspension points and nodes within the search range radius;

[0050] Step B103: after finding other suspension points or nodes within the search range radius, create a line segment from the suspension point to the suspension point or from the suspension point to the node;

[0051] In this embodiment, the connection between multiple suspension points is supported. When creating a line segment connecting suspension points, the coordinate sequence of the line segment will be stored in a set. When creating a line segment again, it will be judged whether it intersects and repeats according to the line segments in the set. If it intersects and repeats, the creation of the line segment will be cancelled. Through this step, the intersection and duplication problems between line segments can be avoided. At the same time, when there are no other suspension points within the search range of the suspension point during connection, the nodes of other nearby line segments will be searched.

[0052] like Figure 3As shown, when there is no other hanging point within the search range radius, it is necessary to create a line segment from the hanging point to the node. The new line segment will determine whether it intersects with other line segments and form a connecting line that does not intersect with other line segments. By reading the type coding fields of map vector data in different layers, the corresponding type data is generated and written into the database, which supports the simultaneous repair of a single feature type or multiple feature types. The connection between hanging points will be prioritized. When there is no hanging point within the range, the connection between the hanging point and the node will be made. The entire drawing data can be batch processed and stored.

[0053] like Figure 4 As shown, the extended repair of the hanging point is a repair method required when there are no other hanging points and nodes within the search radius of the hanging point, and includes the following steps:

[0054] Step B201: The user independently sets a distance parameter to represent the range radius of each suspension point to search for other suspension points and nodes around it;

[0055] Step B202: Each suspension point searches for other suspension points and nodes within the search range radius;

[0056] Step B203: When no other hanging points and nodes are found within the search range radius, an extension line is made through the line segment where the hanging point is located to obtain the intersection with other line segments within the search range radius, and a line segment from the hanging point to the intersection is created.

[0057] When this method is applied, if the hanging point is within the set distance parameter, that is, if there are no other hanging points and nodes within the search range radius, an extension line will be made through the line segment where the hanging point is located to obtain the intersection with other lines within the distance parameter, and then a line segment from the hanging point to the intersection will be created to achieve the purpose of repairing the hanging point.

[0058] like Figure 5 As shown, the clipping repair of the hanging point is a repair method that needs to be performed when the map vector data line segments intersect and are not connected to the same intersection point, including the following steps:

[0059] Step B301: The user independently sets a distance parameter to represent the range radius of the intersection of the line segments around each suspension point;

[0060] Step B302: Each suspension point searches for intersections within the search range radius;

[0061] Step B303: When an intersection is found within the search range, the line segments forming the intersection within the search range are re-encoded and reconstructed with the intersection as the endpoint to achieve clipping to eliminate the hanging points.

[0062] This method uses the intersection between line segments as a basis to determine whether the distance from the hanging point to the intersection is within the parameter range. Line segments that fall within the parameters will be recoded and constructed with the intersection as the endpoint, so that the hanging points can be eliminated by clipping. With the help of iData software, by reading the codes of different types of data, single or batch clipping operations can be performed on data of the same type or different types of features, and the processed data will be rewritten into the layer to achieve data classification.

[0063] In this embodiment, when repairing different types of batch data, it is necessary to select a suitable distance parameter according to the quality of the data, and different repair methods require the selection of different distance parameters.

[0064] When performing step A2, during the process of repairing the hanging points, the connection repair of the hanging points can be performed first, mainly for the hanging problem caused by data of the same encoding type having connection gaps and data that need to be closed but are not closed. Repairing the data with connection gaps can eliminate most of the hanging points caused by the connection gaps.

[0065] Then the extension operation of the suspension points is performed. The extension operation is for some special suspension points. Some of them are gap problems that cannot be solved by the connection operation of the same coding type. The other part is the suspension problem caused by the deviation when the cultivated land line is extended to the road line. Performing the extension operation can repair such suspension problems.

[0066] Finally, some intersecting data in batches are trimmed and repaired, and data of the same or different types are trimmed and stored to solve line segments with some special problems.

[0067] The iData platform used in this embodiment can check and highlight the suspended data on the interface, and can judge the quality of processing the suspended points. For batch data processing, it is necessary to consider the quality of the overall data and the suspension situation, set appropriate parameters and then select the corresponding processing mode for single or batch, partial or full processing. Reasonable combination can achieve better results.

[0068] The present invention combines the interaction and data classification of iData software to repair hanging points, and supports the repair of hanging points for vector data of different types of objects, realizing single and batch data operations. The repaired data can be directly written into the corresponding layer of the database according to the field coding of the data, which not only eliminates the conventional hanging point errors in the topological relationship and improves the accuracy of vector data, but also reduces the intervention of human operations, reduces the error rate and work intensity in the repair process, and ensures the consistency and integrity of the data.

[0069] Compared with the conventional method of repairing hanging points, which manually identifies the line segments with hanging points that need to be repaired and performs corresponding processing, and is unable to repair the entire batch of data and multiple types of data at the same time, the present invention can repair batches of multiple types of ground vector data at the same time, and store the repaired data into the database, ensuring the consistency and integrity of the data.

[0070] The present invention also identifies the hanging points and the line segments they are located in based on the definition of the hanging points by counting the number of times all line segment endpoints appear, and then repairs all existing hanging points one by one without the need for manual repair one by one. It can be configured according to user needs, supports data repair of different scales and writes them into the database, simplifies the process of data updating and maintenance, and allows the repaired data to be immediately used for subsequent analysis and application, shortens the time from data repair to application, and improves work efficiency and data real-time performance.

[0071] At the same time, the present invention adopts a spatial indexing method, using the R-tree efficient spatial index to traverse the hanging points and line segments, effectively processing range queries, adjacent queries and other operations, avoiding searching the data of the entire graph when traversing the hanging points, and searching other nodes or line segments within the buffer range, so that when processing large amounts of data, high efficiency can be maintained and the operation processing time can be reduced.

[0072] The following is an application example of the method for intelligently repairing the suspension points of ground feature vector data of the present invention, as follows:

[0073] like Figure 6 As shown in the figure, it is the cultivated land line area identified and drawn by AI in a certain area. The cultivated land line data in the figure are checked through the iData hanging point check tool, and the cultivated land lines with hanging points are highlighted. It can be seen that most of the cultivated land line vector data in the figure have hanging points. Through the designed connection function, all the data in the drawing are selected for connection to get the effect after processing. It can be obviously seen that most of the vector data segments with hanging points in the drawing are repaired, and only some data still have hanging points. Specifically, they are not repaired successfully because special segments overlap or are not within the parameters. Overall, most of the hanging points in the drawing are repaired successfully.

[0074] like Figure 7 As shown, the amount of data selected for repairing the cultivated land line and the time for repairing the connection mode.

[0075] like Figure 8As shown, it is a vector patch of another area, which contains different types of roads and farmland lines. Since the road is a non-closed data and its two ends are not connected to other data, only the farmland line data in the figure is checked, but the operation is still performed on the full map data, part of which needs to be connected and extended to the road line. It can be seen that the vector data with hanging points in the figure occupies most of it.

[0076] like Fig. 9 As shown in the figure, it is a comparison chart of the vector data of the whole map after connection, extension and cropping. It can be seen that most of the line segments with hanging points in the figure have been repaired, and some data have not been repaired because they are not within the parameters or are special line segments. The overall repair effect is very obvious, and the data quality in the drawing has been improved.

[0077] The present invention can efficiently repair the hanging points of vector data of different types of objects. Combining iData data classification and data reading and writing, a batch processing algorithm is designed, which significantly improves the processing efficiency when processing large-scale data. The traditional repair method needs to process and check each hanging point one by one, confirm the repair method of each hanging point, which is time-consuming and labor-intensive, and is very prone to human errors. The present invention can complete the repair task of a large amount of data in a short time through automated processing, significantly reducing the workload of operators;

[0078] The repair method we rely on can accurately identify and repair errors in hanging points, identify and repair hanging points in the data, and ensure high accuracy and consistency of the repair results. At the same time, the topological relationship in the data is analyzed to perform corresponding repair operations, which can reduce human intervention and make the repair results more reliable. Especially for the connection between hanging points, very small gaps can be accurately repaired, so that closed data can be closed, improving the integrity and accuracy of the data;

[0079] It not only supports the repair of vector data of a single feature type, but can also process data of multiple feature types at the same time. This feature overcomes the limitations of traditional methods in processing different types of data, allowing the system to be widely used in various surveying and mapping and geographic information system scenarios. In practical applications, for example in large-scale land resource survey projects, data of different feature types (such as roads, buildings, green spaces, etc.) require hanging point repair. Traditional methods may need to repair each feature type separately, but the present invention can process these data at one time, simplifying the operation process and reducing processing time. This support function for multiple types of data enables the present invention to perform excellently in various complex geographic data processing tasks;

[0080] The present invention can also write the repaired data directly into the database to achieve real-time update. This function solves the problem of delayed data update in traditional methods, so that the repaired data can be reflected in the software system in a timely manner;

[0081] It can also provide flexible repair solutions based on different data processing requirements. Users can configure algorithm parameters based on actual needs or data quality trade-offs to achieve optimized processing of specific types of data. This flexibility enables the system to adapt to different application scenarios and data types to meet diverse repair needs.

[0082] The above description is only a preferred embodiment of the present invention and does not limit the present invention in any form. Although the present invention has been disclosed as a preferred embodiment as above, it is not used to limit the present invention. Any technical personnel in this field can make some changes or modify the technical contents disclosed above into equivalent embodiments without departing from the scope of the technical solution of the present invention. However, any brief modifications, equivalent changes and modifications made to the above embodiments based on the technical essence of the present invention without departing from the content of the technical solution of the present invention are still within the scope of the technical solution of the present invention.

Claims

1. A method for intelligently repairing suspension points of ground feature vector data, characterized in that: The steps include: Step A1: Import the ground feature vector data into the iData platform, use the iData platform tool to check the suspension points of the current data, and classify the scenes according to the suspension points; Step A2: The user independently selects a processing method from the repair tool and sets a distance parameter according to the quality of the map vector data to resolve the hanging points in the map vector data; In step A1, the iData platform is equipped with a repair tool for repairing the line segment where the hanging point is located in the map vector data. The repair tool includes three repair modes for the line segment where the hanging point is located: connection repair, extension repair and clipping repair.

2. The method for intelligently repairing suspension points of ground feature vector data according to claim 1, characterized in that: The steps for repairing the connection of the line segment where the hanging point is located are as follows: Step B101: The user independently sets a distance parameter to represent the range radius of each suspension point to search for other suspension points and nodes around it; Step B102: Each suspension point searches for other suspension points and nodes within the search range radius; Step B103: After finding other suspension points or nodes within the search range radius, create a line segment from suspension point to suspension point or from suspension point to node.

3. The method for intelligently repairing suspension points of ground feature vector data according to claim 2 is characterized in that: During the connection repair process, when creating a line segment connecting the suspension points, the coordinate sequence of the line segment will be stored in a set. When creating the line segment again, it will be judged whether it intersects and repeats based on the line segments in the set. If it intersects and repeats, the creation of the line segment will be cancelled.

4. The method for intelligently repairing suspension points of ground feature vector data according to claim 2 is characterized in that: During the connection repair process, when there is no other hanging point within the search range radius of the hanging point, it is necessary to create a line segment from the hanging point to the node and form a connecting line that does not intersect with other line segments.

5. The method for intelligently repairing suspension points of ground feature vector data according to claim 1 or 2, characterized in that: The steps for extending and repairing the line segment where the hanging point is located are as follows: Step B201: The user independently sets a distance parameter to represent the range radius of each suspension point to search for other suspension points and nodes around it; Step B202: Each suspension point searches for other suspension points and nodes within the search range radius; Step B203: When no other hanging points and nodes are found within the search range radius, an extension line is made through the line segment where the hanging point is located to obtain the intersection with other line segments within the search range radius, and a line segment from the hanging point to the intersection is created.

6. A method for intelligently repairing suspension points of ground feature vector data according to claim 1 or 2, characterized in that: The steps for clipping and repairing the line segment where the hanging point is located are as follows: Step B301: The user independently sets a distance parameter to represent the range radius of the intersection of the line segments around each suspension point; Step B302: each suspension point searches for intersections within the search range radius; Step B303: When an intersection is found within the search range, the line segments forming the intersection within the search range are re-encoded and reconstructed with the intersection as the endpoint to achieve clipping to eliminate the hanging points.

7. The method for intelligently repairing suspension points of ground feature vector data according to claim 1, characterized in that: When performing step A2, during the process of repairing the hanging points, firstly, the connection repair of the hanging points is performed for the map vector data of the same coding type that has connection gaps and needs to be closed but is not closed.

Images