Improved urban intersection connection relation and intersection information rapid extraction method and system
By performing broken-end screening and segmentation processing of urban road network data, center line data and intersection data are extracted, the problems of simplification and extraction efficiency of existing middle road network data are solved, and efficient and accurate acquisition of intersection information is achieved.
Patent Information
- Application Number
- CN202411694357.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-11-25
- Publication Date
- 2025-04-04
AI Technical Summary
The prior art is difficult to efficiently simplify and accurately extract urban road network data, resulting in cumbersome acquisition of intersection information and errors or redundant calculations.
By obtaining the basic data of the road network, extracting the original road center line data, and performing the first processing to screen out the broken-head road data, then performing segmentation processing on the initial screening road center line data, extracting the center line data and center line intersection data, and finally obtaining the road network topological connection relationship diagram based on these data.
It realizes accurate extraction and simplification of existing road network data, improves the efficiency and accuracy of intersection information acquisition, and reduces data redundancy and errors.
Smart Images

Figure FT_1 
Figure FT_2 
Figure FT_3
Abstract
Description
Technical Field
[0001] The invention relates to an improved urban intersection connection relationship and an intersection information rapid extraction method, and also relates to an improved urban intersection connection relationship and an intersection information rapid extraction system, belonging to the field of computer graphics and geographic information science and technology. Background Art
[0002] The extraction of urban intersection information and topological connection relationships is a field that integrates multiple technologies, involving multiple aspects such as traffic engineering, computer vision, and data analysis. It has broad application scenarios in logistics delivery, traffic optimization, congestion management, emergency analysis, and other fields, and is a prerequisite for analyzing and solving path problems.
[0003] Common intersection information extraction methods have their own characteristics, and most of them are obtained by third-party perception analysis outside the road network. The invention patent with application number CN202111367458.7 proposes to use topological sorting and other means to process and extract intersection information, but it does not achieve the simplification of road network topological connections, and the extraction of intersection information is also relatively cumbersome. The invention patent with application number CN202211486838.7 proposes to use the urban road network topology map to correct and track trajectories with the help of distance analysis. The shape of the road network remains unchanged. It belongs to the primary urban road network topology map, and the urban road network topology map is not extracted or simplified. The primary urban road network topology map that has not been simplified has errors or redundant calculations in traffic analysis, intersection information acquisition, etc., and it is necessary to scientifically simplify and extract it. The invention patent with application number "CN202411526851.X-Urban Road Network Topological Connection Relationship and Intersection Information Extraction Method and System" proposes to simplify the road network through suction thinking to obtain connection relationships, but it requires multiple calculations and the amount of calculation is uncertain. When it is actually implemented, in terms of the utilization of server computing resources, redundancy or insufficiency often occurs. Specifically, the above-mentioned method of extracting the center line of the line segment by resampling requires gradually increasing the initial sampling value. After multiple samplings, all road center lines can be sampled. The high operation calculation frequency affects the system processing speed. When processing different urban road networks, due to different development levels, different road network data consume different computing resources during the re-sampling process, which affects the stability of the system operation.
[0004] Therefore, how to provide an improved method for quickly extracting urban intersection connection relations and intersection information, which can extract existing road network data with high accuracy and simplify road network data, is a technical problem that needs to be solved urgently by technical personnel in this field. Summary of the invention
[0005] In view of the deficiencies of the above-mentioned prior art, the purpose of the present invention is to be able to extract the existing road network data with high accuracy and simplify the road network data. The present invention provides an improved method for quickly extracting urban intersection connection relations and intersection information, which includes the following steps: obtaining basic road network data; extracting original road centerline data from the basic road network data; performing a first processing on the original road centerline data, wherein the first processing is to extract dead-end road data from the original road centerline data to obtain preliminary screening road centerline data, wherein the dead-end road data includes dead-end intersection endpoint data; performing segmentation processing on the preliminary screening road centerline data to extract centerline data and centerline intersection data; based on the centerline intersection data and the dead-end intersection endpoint data, combining the centerline data and the dead-end road data to obtain a road network topology connection relationship diagram.
[0006] According to the first embodiment of the present invention, the present application provides a technical solution for an improved method for quickly extracting urban intersection connection relations and intersection information.
[0007] In this technical solution, the method includes the following steps: acquiring basic road network data; extracting original road centerline data from the basic road network data; performing a first processing on the original road centerline data, wherein the first processing is to extract dead-end road data from the original road centerline data to obtain preliminary screening road centerline data, wherein the dead-end road data includes dead-end intersection endpoint data; performing segmentation processing on the preliminary screening road centerline data to extract centerline data and centerline intersection data; based on the centerline intersection data and the dead-end intersection endpoint data, combining the centerline data and the dead-end road data to obtain a road network topological connection relationship diagram.
[0008] Furthermore, as a more preferred implementation scheme of the present invention, the "segmenting the initially screened road centerline data to extract the centerline data and the centerline intersection data" specifically includes the following steps: identifying the two endpoint positions of the original centerline of the initially screened road centerline data; newly obtaining a first segmented centerline based on the two endpoint positions; checking the quantity of the first segmented centerlines, and outputting them as qualified segmented centerlines if the quantity meets the standards; and outputting the centerline data and the centerline intersection data based on the qualified segmented centerline.
[0009] Further, as a more preferred implementation scheme of the present invention, the "newly creating a first segmented centerline based on the two endpoint positions" includes the following steps: obtaining the coordinates of the two endpoint positions of all the original centerlines, and newly creating an initial segmented centerline based on the endpoint connection relationship of all the original centerlines; traversing all the initial segmented centerlines, performing a first judgment, and outputting the initial segmented centerlines that meet the first judgment condition as the first segmented centerline; marking the initial segmented centerlines that do not meet the first judgment condition, outputting the judgment result and prompting the position of the initial segmented centerline that does not meet the first judgment condition, and manually processing; first judgment: judging whether it is a qualified segmented centerline, the first judgment condition is that the initial segmented centerline is a standard centerline structure.
[0010] Further, as a more preferred implementation scheme of the present invention, the "marking of the initial segmented centerline that does not meet the first judgment condition" specifically includes the following steps: the centerline of the standard centerline structure is connected to other centerlines at both ends, and there is no intersection between any centerline and other centerlines; if it is identified that one end of the initial segmented centerline is not connected to other centerlines, it is determined that there is a broken centerline, and the initial segmented centerline is marked as a suspected dead-end road, and included in the judgment result; if it is identified that the initial segmented centerline intersects with other centerlines, it is determined that there is an intersection, and the initial segmented centerline is marked as an intersection road condition, and included in the judgment result.
[0011] Furthermore, as a more preferred implementation scheme of the present invention, the "newly creating a first segmented centerline based on the two endpoint positions" also includes the following steps: deleting the original centerline of the initially screened road centerline data.
[0012] Further, as a more preferred implementation scheme of the present invention, the "checking the quantity of the first segmented centerlines, and outputting them as qualified segmented centerlines if the quantity meets the standards" specifically includes the following steps: performing a second judgment on the first segmented centerline, and outputting them as qualified segmented centerlines if the second judgment condition is met; the second judgment is: breaking up the first segmented centerline, and judging whether the number of centerlines before and after the breaking up is consistent; if they are consistent, identifying the first segmented centerline as a qualified segmented centerline; if they are inconsistent, returning to the step of "creating a new first segmented centerline based on the two endpoint positions".
[0013] Further, as a more preferred implementation scheme of the present invention, the "based on the centerline intersection data and the dead-end intersection endpoint data, combining the centerline data and the dead-end road data to obtain a road network topology connection relationship diagram" specifically includes the following steps: extracting all redundant intersection endpoints of the segmented centerlines; merging the redundant intersection endpoints that are clustered together to obtain centerline intersection data; combining the centerline intersection data with the dead-end intersection endpoint data to obtain a road network range intersection data diagram; combining the centerline data and the dead-end road data, and road-processing the road network range intersection data diagram to obtain a road network topology connection relationship diagram.
[0014] Further, as a more preferred implementation scheme of the present invention, the "merging the redundant intersection endpoints that are clustered together to obtain centerline intersection data" specifically includes the following steps: at the same intersection, multiple redundant intersection endpoints are generated from the endpoints of the connected centerlines; a buffer analysis is performed on the multiple redundant intersection endpoints of all intersections: a buffer radius value is set, and a point buffer is set for the redundant intersection endpoints based on the buffer radius value; the point buffers of the redundant intersection endpoints of the same intersection are merged to obtain buffer surfaces that map each intersection respectively, and the midpoint of the buffer surface is selected as the intersection of the connected centerlines to obtain centerline intersection data.
[0015] Furthermore, as a more preferred implementation scheme of the present invention, the first processing includes the following steps: performing topological processing on the original road centerline data; identifying dead-end roads based on topological errors; extracting and eliminating dead-end road data from the original road centerline data to obtain preliminary screened road centerline data.
[0016] Furthermore, as a more preferred implementation scheme of the present invention, the first processing also includes the following steps: performing topological processing on the original road centerline data from which the dead-end road data is eliminated, and if no new topological error is generated, generating preliminary screening road centerline data; if a new topological error is generated, identifying and eliminating the dead-end road data based on the new topological error.
[0017] The present application also provides a technical solution for an improved system for quickly extracting urban intersection connection relations and intersection information. The system is used to execute the technical solution of the improved method for quickly extracting urban intersection connection relations and intersection information. In the technical solution, the system includes: a first acquisition module, the first acquisition module is used to acquire basic road network data; a first extraction module, the first extraction module is used to extract original road centerline data from the basic road network data; a first processing module, the first processing module is used to perform a first processing on the original road centerline data; a second processing module, the second processing module is used to perform sampling processing on the initially screened road centerline data; a first generation module, the first generation module is used to obtain a road network topology connection relationship diagram based on the centerline intersection data and the dead-end intersection endpoint data, combined with the centerline data and the dead-end road data.
[0018] Compared with the prior art, in the technical solution provided by the present application, the dead-end roads are firstly screened out to obtain the centerline data, and then the centerline is segmented to simplify the roads (centerlines) in the road network into straight line segments, thereby reducing the data information of the road network; further, the intersections where the centerlines intersect are simplified and merged to further simplify the data volume; finally, a simplified road network topology connection relationship diagram is obtained. The technical solution provided by the present application can extract the existing road network data with high accuracy and simplify the road network data.
[0019] The specific beneficial effects are as follows:
[0020] (1) The improved method for quickly extracting urban intersection connection relations and intersection information of the present invention removes duplicate intersection information through buffer merging and decomposition operations, which is highly efficient and error-prone.
[0021] (2) The improved method for quickly extracting urban intersection connection relations and intersection information of the present invention extracts road network connection relations while keeping topological connection information unchanged. The principle is simple and the efficiency is high.
[0022] (3) The improved urban intersection connection relationship and intersection information rapid extraction method of the present invention is that the intersection topological connection is a direct line segment connection between points, without any intermediate points. Therefore, the topological connection network is broken up, and the number of front and back segments remains unchanged. If there is an inconsistency, there must be an intermediate point. With the help of this feature, the correctness constraint and judgment of the problem solution are realized, which is simple and efficient.
[0023] (4) The improved method for quickly extracting urban intersection connection relations and intersection information of the present invention can quickly extract intersection information and its topological connection relations, which is convenient for performing optimal path analysis under weighted conditions and is particularly suitable for traffic optimization in urban restricted and speed-limited environments. BRIEF DESCRIPTION OF THE DRAWINGS
[0024] Figure 1 This is a schematic diagram of extracting the road centerline of a city in an embodiment of the present invention;
[0025] Figure 2 In the embodiment of the present invention, a certain road section (in bold) is artificially set as a dead-end road schematic diagram;
[0026] Figure 3 This is a schematic diagram of extracting the road centerline in a certain city after setting a dead-end road in an embodiment of the present invention;
[0027] Figure 4 In the embodiment of the present invention, Figure 3 Schematic diagram of the setup for topological processing;
[0028] Figure 5 A road network diagram after topological processing in an embodiment of the present invention;
[0029] Figure 6 This is a schematic diagram of performing segment processing on a center line in an embodiment of the present invention;
[0030] Figure 7 It is a schematic diagram of the topology of the center line after segmentation processing in an embodiment of the present invention;
[0031] Figure 8 This is a schematic diagram of recording the total number of center lines after topological processing and breaking them up in an embodiment of the present invention;
[0032] Fig. 9 This is a schematic diagram of an embodiment of the present invention, in which the number of center lines before and after breaking up is inconsistent;
[0033] Figure 10-12 This is a schematic diagram showing that the number of center lines before and after doubling and breaking up the sampling values is the same in an embodiment of the present invention;
[0034] Figure 13-14 A schematic diagram of converting a resampled center line into points (preliminary extraction of intersection information) in an embodiment of the present invention;
[0035] Figure 15-16 A schematic diagram of performing buffer zone analysis on a point in an embodiment of the present invention;
[0036] Figure 17-19 A schematic diagram of an overlapping and merging operation of a point buffer range in an embodiment of the present invention, merging all buffers, and the overlapping parts are automatically merged, and after the decomposition operation disperses the complex polygon into simple polygons, the repeated intersection polygons are removed;
[0037] Fig. 20 A schematic diagram of extracting the center point of a non-repetitive buffer zone in an embodiment of the present invention;
[0038] Fig.21 In an embodiment of the present invention, a schematic diagram of intersections within the road network range to be sought includes non-repeated intersection points to be sought;
[0039] Fig. 22 A simplified road network topology link diagram in an embodiment of the present invention;
[0040] Fig.23 A simplified road network topology link and intersection overlay diagram in an embodiment of the present invention;
[0041] Fig.24 Schematic diagram of the operation steps of the improved method for quickly extracting urban intersection connection relations and intersection information in an embodiment of the present invention;
[0042] Fig.25 Schematic diagram of the main conceptual steps of an improved method for quickly extracting urban intersection connection relations and intersection information in an embodiment of the present invention. DETAILED DESCRIPTION
[0043] In order to enable those skilled in the art to better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in the field without creative work are within the scope of protection of this application.
[0044] It should be noted that when an element is referred to as being "fixed on" or "set on" another element, it can be directly on the other element or indirectly set on the other element; when an element is referred to as being "connected to" another element, it can be directly connected to the other element or indirectly connected to the other element.
[0045] It should be understood that the terms "length", "width", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", etc., indicating the orientation or position relationship, are based on the orientation or position relationship shown in the drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.
[0046] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of this application, "multiple" and "several" mean two or more, unless otherwise clearly and specifically defined.
[0047] It should be noted that the structures, proportions, sizes, etc. illustrated in the drawings of this specification are only used to match the contents disclosed in the specification for people familiar with this technology to understand and read, and are not used to limit the conditions under which this application can be implemented. Therefore, they have no substantive technical significance. Any structural modification, change in proportional relationship or adjustment of size should still fall within the scope of the technical content disclosed in this application without affecting the effects and purposes that can be achieved by this application.
[0048] According to the first implementation scheme of the present invention, the present application provides a technical solution for an improved method for quickly extracting urban intersection connection relations and intersection information. In the technical solution, the method includes the following steps: obtaining basic road network data; extracting original road centerline data from the basic road network data; performing a first processing on the original road centerline data, wherein the first processing is to extract dead-end road data from the original road centerline data to obtain preliminary screening road centerline data, wherein the dead-end road data includes dead-end intersection endpoint data; performing segmentation processing on the preliminary screening road centerline data to extract centerline data and centerline intersection data; based on the centerline intersection data and the dead-end intersection endpoint data, combining the centerline data and the dead-end road data to obtain a road network topology connection relationship diagram.
[0049] In the technical solution provided by the present application, the dead-end roads are firstly screened out to obtain the centerline data, and then the centerlines are segmented to simplify the roads (centerlines) in the road network into straight line segments, thereby reducing the data information of the road network; further, the intersections where the centerlines intersect are simplified and merged to further simplify the data volume; finally, a simplified road network topology connection relationship diagram is obtained. The technical solution provided by the present application can extract the existing road network data with high accuracy and simplify the road network data.
[0050] It should be noted that the center line refers to the center line of the road reflected in the map data.
[0051] Specifically explained, in an embodiment of the present invention, the "segmenting the initially screened road centerline data to extract the centerline data and the centerline intersection data" specifically includes the following steps: identifying the two endpoint positions of the original centerline of the initially screened road centerline data; newly obtaining a first segmented centerline based on the two endpoint positions; checking the quantity of the first segmented centerlines, and outputting them as qualified segmented centerlines if the quantity meets the standards; and outputting the centerline data and the centerline intersection data based on the qualified segmented centerline.
[0052] It should be noted that directly reconstructing a new "first segmented centerline" based on the positions of the two end points of the original centerline is simpler than the "resampling" processing method, and the simplified "first segmented centerline" can be obtained more quickly.
[0053] In the prior art, the resampling method is used to extract the center line of the line segment, which requires gradually increasing the initial sampling value. After multiple samplings, all the road center lines can be sampled. The high operation calculation frequency affects the system processing speed.
[0054] It should be noted that the center line that originally reflects the actual road condition is simplified to a segmented center line / a first segmented center line, thereby reducing the amount of center line data.
[0055] Specifically, in an embodiment of the present invention, the "newly-created first segmented centerline based on the two endpoint positions" includes the following steps: obtaining the coordinates of the two endpoint positions of all the original center lines, and newly-creating an initial segmented centerline according to the endpoint connection relationship of all the original center lines; traversing all the initial segmented centerlines, performing a first judgment, and outputting the initial segmented centerlines that meet the first judgment condition as the first segmented centerline; marking the initial segmented centerlines that do not meet the first judgment condition, outputting the judgment result and prompting the position of the initial segmented centerline that does not meet the first judgment condition, and manually processing; first judgment: judging whether it is a qualified segmented centerline, and the first judgment condition is that the initial segmented centerline is a standard centerline structure.
[0056] It should be noted that after obtaining the position coordinates of the two endpoints of the original center line, the "initial segmented center line" is output first, and then all the "initial segmented center lines" are screened for the first judgment. Through the judgment screening, the problematic center lines are marked and handed over to manual processing; the machine completes most of the work, and the process is simple because of the "segmentation processing" process, making the actual processing effect faster. Only in very rare cases does manual intervention exist. Therefore, through this solution, the efficiency of urban road intersection information extraction can be greatly improved. Because the segmentation processing is directly performed, the segmented center line output can be intuitive and fast.
[0057] The center line reduces the amount of calculation and improves the efficiency of the transformation of the entire road network topology relationship.
[0058] To elaborate specifically, in an embodiment of the present invention, the "marking of the initial segmented centerline that does not meet the first judgment condition" specifically includes the following steps: the centerline of the standard centerline structure is connected to other centerlines at both ends, and there is no intersection between any centerline and other centerlines; if it is identified that one end of the initial segmented centerline is not connected to other centerlines, it is determined that there is a broken centerline, and the initial segmented centerline is marked as a suspected dead-end road, and included in the judgment result; if it is identified that the initial segmented centerline intersects with other centerlines, it is determined that there is an intersection, and the initial segmented centerline is marked as an intersection road condition, and included in the judgment result.
[0059] It should be noted that by judging whether the beginning and end of the initial segmented center line are connected to other center lines, it is judged whether it is a dead-end road center line; if so, an error is reported; by judging whether there is an intersection between the center lines, it is judged whether there is a new creation error in the "initial segmented center line"; if there is, the judgment result is directly output and a reminder is given for manual processing.
[0060] Specifically, in an embodiment of the present invention, the "newly-created segmented centerline based on the two endpoint positions" further includes the following steps: deleting the original centerline of the initially screened road centerline data.
[0061] To elaborate specifically, in an embodiment of the present invention, the "checking the quantity of the first segmented center lines, and outputting them as qualified segmented center lines if the quantity meets the standard" specifically includes the following steps: performing a second judgment on the first segmented center line, and outputting them as qualified segmented center lines if the second judgment condition is met; the second judgment is: breaking up the first segmented center line, and judging whether the number of center lines before and after the breaking up is consistent; if they are consistent, identifying the first segmented center line as a qualified segmented center line; if they are inconsistent, returning to the step of "creating a new first segmented center line based on the two endpoint positions".
[0062] It should be noted that by comparing the first segmented center lines before and after interruption, the center lines that meet the conditions can be intuitively and quickly determined, reducing the amount of calculation and improving the efficiency of the entire road network topology relationship conversion.
[0063] Specifically explained, in an embodiment of the present invention, the "based on the centerline intersection data and the dead-end intersection endpoint data, combining the centerline data and the dead-end road data to obtain a road network topology connection relationship diagram" specifically includes the following steps: extracting all redundant intersection endpoints of the segmented centerlines; merging the redundant intersection endpoints that are clustered together to obtain centerline intersection data; combining the centerline intersection data with the dead-end intersection endpoint data to obtain a road network range intersection data diagram; combining the centerline data and the dead-end road data, and roading the road network range intersection data diagram to obtain a road network topology connection relationship diagram.
[0064] It should be noted that after the center direction is segmented, the endpoints of the intersecting center lines do not actually overlap, which takes up data storage capacity and affects the use of road topology network data by the procedure; in this step, the redundant endpoints of each intersection are merged, which reduces the amount of data while reducing the difficulty of subsequent data utilization and improving the stability of data utilization.
[0065] Specifically explained, in an embodiment of the present invention, the "merging the redundant intersection endpoints that are clustered together to obtain centerline intersection data" specifically includes the following steps: at the same intersection, multiple redundant intersection endpoints are generated from the endpoints of the connected centerlines; a buffer analysis is performed on the multiple redundant intersection endpoints of all intersections: a buffer radius value is set, and a point buffer is set for the redundant intersection endpoints based on the buffer radius value; the point buffers of the redundant intersection endpoints of the same intersection are merged to obtain buffer surfaces that respectively map each intersection, and the midpoint of the buffer surface is selected as the intersection of the connected centerlines to obtain centerline intersection data.
[0066] It should be noted that by setting the buffer radius value, after expanding the point buffer of the redundant intersection endpoints, the overlapping redundant intersection endpoints are merged to achieve rapid fusion of multiple redundant intersection endpoints, with a small amount of data processing and little difficulty.
[0067] Specifically, in an embodiment of the present invention, the first processing includes the following steps: performing topological processing on the original road centerline data; identifying dead-end roads based on topological errors; extracting and eliminating dead-end road data from the original road centerline data to obtain preliminary screened road centerline data.
[0068] To explain specifically, in an embodiment of the present invention, the first processing also includes the following steps: performing topological processing on the original road centerline data from which the dead-end road data is eliminated, and if no new topological error is generated, generating preliminary screening road centerline data; if a new topological error is generated, identifying and eliminating the dead-end road data based on the new topological error.
[0069] It should be noted that the dead-end road data and the dead-end road intersection data are extracted in advance through topology processing to facilitate subsequent merging.
[0070] According to the second embodiment of the present invention, the present application also provides a technical solution for an improved system for quickly extracting urban intersection connection relations and intersection information. The system is used to execute the technical solution of the improved method for quickly extracting urban intersection connection relations and intersection information. In the technical solution, the system includes: a first acquisition module, the first acquisition module is used to acquire basic road network data; a first extraction module, the first extraction module is used to extract original road centerline data from the basic road network data; a first processing module, the first processing module is used to perform a first processing on the original road centerline data; a second processing module, the second processing module is used to perform sampling processing on the initially screened road centerline data; a first generation module, the first generation module is used to obtain a road network topology connection relationship diagram based on the centerline intersection data and the end point data of the dead-end intersection, combined with the centerline data and the dead-end road data. The technical solution of the improved system for quickly extracting urban intersection connection relations and intersection information provided by the present application also has the technical effect of the above-mentioned technical solution.
[0071] It should be added that, refer to the attached Figure 1-23 The present invention provides an improved method for quickly extracting the connection relationship and intersection information of urban intersections, taking the case of simultaneously distributing emergency materials to epidemic areas across the river as an analysis, including the following steps:
[0072] like Figure 1-3 :
[0073] S1, extract the road centerline;
[0074] like Figure 4-5 :
[0075] S2, centerline topology processing and recording topology errors;
[0076] S3, filtering out dead-end roads and extracting dead-end intersection points according to topological errors;
[0077] S4, extract the dead-end roads and perform topological processing on the center lines of the remaining road network;
[0078] S5. If a topological error exists, return to the previous step until no topological error exists;
[0079] like Figure 6-12 :
[0080] S6. Convert the center line into a polyline segment and remove the middle nodes of the polyline;
[0081] S7. Topology the resampled centerline again and ensure that there is no topological error;
[0082] S8. record the total number of center lines after topological processing, and then break them all up;
[0083] S9. Determine the number of center lines before and after the breaking up, if they are consistent, proceed to step 11, if they are inconsistent, proceed to the next step;
[0084] S10. Return to step 6 and repeat the above steps until the number of center lines before and after the beating is the same;
[0085] like Figure 13-21 :
[0086] S11, converting the resampled center line into a point;
[0087] S12, perform buffer analysis on the points, with a buffer range of 5 meters;
[0088] S13, merging the point buffers and then decomposing the buffers to obtain a buffer surface without overlap;
[0089] S14, extracting the center point of the non-repetitive buffer zone;
[0090] like Fig. 22 :
[0091] S15, merging the center point and the dead-end intersection point to obtain the desired intersection within the road network range;
[0092] like Fig.23 :
[0093] S16. The processed center line and the dead-end road are merged to obtain a simple topological connection relationship diagram of the road network.
[0094] It should be noted that, in general, the existing road network information is already basically available and does not change much in a short period of time. Based on this, the static road network analysis thinking can be used to extract the road network geometry information to obtain the intersection information and the intersection connection topology network information between the road networks. To this end, this application proposes an improved method for quickly extracting the connection relationship of urban intersections and intersection information.
[0095] It should be noted that the present invention relies on the existing software graphics processing function implementation principle. By exploring necessary constraints, it can quickly extract intersection information and its topological connection relationship, facilitate optimal path analysis under weighted conditions, and is particularly suitable for traffic optimization in urban restricted and speed-limited environments.
[0096] The improved urban intersection connection relationship and intersection information rapid extraction method of the present invention is used to process the road network of a city to extract the road centerline. The schematic diagram of each step is shown in the attached figure. Figure 1-23,Removing duplicate intersection information through buffer merging and decomposition operations is efficient and error-prone.,By extracting connection relationships while keeping topological connection information unchanged, the principle is simple and efficient.
[0097] In addition, the topological connection of the intersection is a direct connection between points with line segments, and there is no intermediate point. Therefore, the topological connection network is broken up, and the number of front and back segments remains unchanged. If there is an inconsistency, there must be an intermediate point. The method of the present invention uses this feature to realize the correctness constraint and judgment of problem solving, which is simple and efficient.
[0098] The above description of the disclosed embodiments enables those skilled in the art to implement or use the present invention. Various modifications to these embodiments will be apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the present invention. Therefore, the present invention will not be limited to the embodiments shown herein, but rather to the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. An improved method for quickly extracting urban intersection connection relations and intersection information, characterized in that: The method comprises the following steps: Obtain basic road network data; Extracting original road centerline data from the road network basic data; Performing a first processing on the original road centerline data, wherein the first processing is to extract dead-end road data from the original road centerline data to obtain preliminary screening road centerline data, wherein the dead-end road data includes dead-end road intersection endpoint data; Performing segment processing on the initially screened road centerline data to extract centerline data and centerline intersection data; Based on the centerline intersection data and the dead-end intersection endpoint data, a road network topology connection relationship diagram is obtained by combining the centerline data and the dead-end road data.
2. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 1 is characterized in that: The "processing the initially screened road centerline data into line segments to extract centerline data and centerline intersection data" specifically includes the following steps: Identify two endpoint positions of the original center line of the initially screened road center line data; A first segmented center line is newly obtained based on the positions of the two endpoints; Checking the quantity of the first segmented center lines, and outputting them as qualified segmented center lines if the quantity meets the standard; Outputting the centerline data and the centerline intersection data based on the qualified line segmented centerline; Preferably, the "generating a first segmented centerline based on the two endpoint positions" comprises the following steps: Get the coordinates of the two endpoints of all original center lines. According to the connection relationship between the endpoints of all the original center lines, an initial segmented center line is newly created; Traversing all the initial line segmentation center lines, performing a first judgment, and outputting the initial line segmentation center lines that meet the first judgment condition as the first line segmentation center lines; Marking the initial line segmentation center line that does not meet the first judgment condition, outputting the judgment result and prompting the position of the initial line segmentation center line that does not meet the first judgment condition, and manually processing; First judgment: judging whether it is a qualified line segmentation center line, the first judgment condition is that the initial line segmentation center line is a standard center line structure.
3. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 2 is characterized in that: The “marking the initial segmented center line that does not meet the first judgment condition” specifically includes the following steps: The center line of the standard center line structure is connected to other center lines at the beginning and the end, and no center line intersects with other center lines; If it is identified that one end of the initial segmented center line is not connected to other center lines, it is determined that there is a broken center line, and the initial segmented center line is marked as a suspected broken road and included in the judgment result; If it is identified that the initial segmented center line intersects with other center lines, it is determined that there is an intersection, and the initial segmented center line is marked as an intersection road condition and included in the judgment result.
4. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 3 is characterized in that: The "generating a first segmented center line based on the two endpoint positions" further includes the following steps: The original center line of the initially screened road center line data is deleted.
5. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 2 is characterized in that: The "checking the quantity of the first segmented center lines and outputting them as qualified segmented center lines if the quantity meets the standard" specifically includes the following steps: Performing a second judgment on the first segmented center line, and outputting it as a qualified segmented center line if the second judgment condition is met; The second judgment is: Performing a scattering process on the first segmented center lines, and determining whether the number of center lines before and after the scattering process is the same; If they are consistent, the first segmented centerline is identified as the qualified segmented centerline; If they are inconsistent, return to the step of "obtaining the first segmented center line based on the positions of the two endpoints".
6. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 2 is characterized in that: The "based on the centerline intersection data and the dead-end intersection endpoint data, combining the centerline data and the dead-end road data to obtain a road network topology connection relationship diagram" specifically includes the following steps: Extracting all redundant intersection endpoints of the segmented center lines; Merging the redundant intersection endpoints that are clustered together to obtain centerline intersection data; Combining the centerline intersection data with the dead-end intersection endpoint data to obtain a road network range intersection data map; Combined with the centerline data and the dead-end road data, the road network range intersection data graph is roadized to obtain a road network topology connection relationship graph.
7. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 6 is characterized in that: The "merging the redundant intersection endpoints that are clustered together to obtain centerline intersection data" specifically includes the following steps: At the same intersection, the endpoints of the connecting center lines generate a plurality of redundant intersection endpoints; Performing buffer analysis on multiple redundant intersection endpoints of all intersections: setting a buffer radius value, and setting a point buffer for the redundant intersection endpoints based on the buffer radius value; Merging the point buffers of the redundant intersection endpoints of the same intersection to obtain buffer surfaces that respectively map the intersections, selecting the midpoints of the buffer surfaces as the intersection points of the connected center lines, and obtaining center line intersection data; The position angle of the center line data is adjusted according to the center line intersection data.
8. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 1 is characterized in that: The first process comprises the following steps: Performing topological processing on the original road centerline data; Identify dead-end roads based on topological errors; The dead-end road data are extracted and eliminated from the original road centerline data to obtain the primary screening road centerline data.
9. The improved method for quickly extracting urban intersection connection relations and intersection information according to claim 8, characterized in that: The first process further comprises the following steps: Performing topological processing on the original road centerline data after removing the dead-end road data, and generating preliminary screening road centerline data if no new topological error is generated; If a new topological error is generated, the dead-end road data is identified and removed based on the new topological error.
10. Improved urban intersection connection relationship and intersection information rapid extraction system, characterized by: The system is used to execute the improved urban intersection connection relationship and intersection information rapid extraction method according to any one of claims 1 to 9; the system comprises: A first acquisition module, the first acquisition module is used to acquire basic road network data; A first extraction module, the first extraction module is used to extract original road centerline data from the road network basic data; A first processing module, the first processing module is used to perform a first processing on the original road centerline data; A second processing module, the second processing module is used to perform sampling processing on the primary screening road centerline data; The first generation module is used to obtain a road network topology connection relationship diagram based on the centerline intersection data and the dead-end intersection endpoint data, combined with the centerline data and the dead-end road data.
Citation Information
Patent Citations
Intersection expression method based on road network data and vector calculation
CN114168905A
Method for establishing discrete trajectory of moving target
CN115794977A
Urban road network topology connection relation and intersection information extraction method and system
CN119415613A