Administrative division boundary road recognition method, electronic equipment, medium and program product

Abstract

The present application provides a method for identifying administrative division boundary roads, electronic equipment, medium and program products, and relates to the field of computer technology. The method comprises: determining the first geometric shape of each road in at least one road according to the boundary line of at least one road in a road data set; generating a buffer zone containing the first geometric shape for each first geometric shape; and identifying administrative division boundary roads in at least one road according to the overlap between the boundary line of at least one administrative division in the road data set and each buffer zone. The method is used to achieve the effect of improving the accuracy of screening administrative division boundaries.

Description

Technical Field

[0001] The present application relates to the field of computer technology, and in particular to an administrative division boundary road recognition method, electronic equipment, medium and program product. Background Art

[0002] In the process of electronic map production, administrative divisions are important attributes for organizing and managing road data. Usually, the production of road data for electronic maps relies on reference materials and data collected according to administrative divisions to ensure the accuracy and consistency of the data. In particular, when dealing with roads located at and around administrative division boundaries, special production and processing are required to meet the challenges of boundary complexity.

[0003] In the related art, administrative division boundaries are usually screened out manually from a large amount of road data. However, this method has the following problems: the accuracy of screening out administrative division boundaries is poor. Summary of the invention

[0004] The embodiments of the present application provide a method for identifying administrative division boundary roads, electronic equipment, medium and program products, so as to achieve the effect of improving the accuracy of screening administrative division boundaries.

[0005] In a first aspect, an embodiment of the present application provides a method for identifying administrative boundary roads, including:

[0006] Determining a first geometric shape of each road in the at least one road based on a boundary line of the at least one road in the road data set;

[0007] For each first geometric shape, generating a buffer zone including the first geometric shape;

[0008] According to the overlap degree between the boundary line of at least one administrative division and each buffer zone in the road data set, an administrative division boundary road in at least one road is identified.

[0009] In a possible implementation, identifying an administrative division boundary road in at least one road according to the overlap degree between the boundary line of at least one administrative division and each buffer zone in the road data set includes:

[0010] Determine the first minimum circumscribed geometry of each buffer zone;

[0011] Determine the second smallest circumscribed geometric figure of each boundary line;

[0012] When the first minimum circumscribed geometric figure overlaps with the second minimum circumscribed geometric figure, the road corresponding to the first minimum circumscribed geometric figure overlapping with the second minimum circumscribed geometric figure is determined as the administrative boundary road, or the administrative boundary road is determined from the roads corresponding to the overlapping first minimum circumscribed geometric figure.

[0013] In a possible implementation, determining the administrative boundary road from the roads corresponding to the first minimum circumscribed geometric figures that overlap includes:

[0014] Determine whether there is at least one separating axis between the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure, where the separating axis is a straight line or a plane perpendicular to the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure; perform the following processing for each separating axis: determine a first projection of the first minimum circumscribed geometric figure on the separating axis and determine a second projection of the second minimum circumscribed geometric figure on the separating axis; determine whether there is overlap between the first projection and the second projection; when the first projection determined by each separating axis overlaps with the second projection, determine the road corresponding to the first projection that overlaps with the second projection as an administrative boundary road.

[0015] In a possible implementation, for each first geometric shape, generating a buffer zone including the first geometric shape includes:

[0016] Based on each first geometric shape and with a first radius, a buffer zone including the first geometric shape is generated according to a road scene.

[0017] In a possible implementation manner, after determining the administrative division boundary roads, the method further includes:

[0018] Obtain a dataset of suspected broken roads;

[0019] According to the administrative boundary roads, the broken roads are identified from the suspected broken roads dataset.

[0020] In a possible implementation, determining a dead-end road from a suspected dead-end road dataset according to administrative boundary roads includes:

[0021] The broken road dataset is obtained based on the difference between the suspected broken road dataset and the administrative boundary roads;

[0022] For the broken point in the broken road dataset, a buffer zone including the broken point is generated with the second radius;

[0023] Determine the broken roads based on the buffer zone generated based on the broken points.

[0024] In a possible implementation, determining a dead-end road based on a buffer zone generated based on a dead-end point includes:

[0025] When the buffer zone generated by the broken point intersects with the low-level road set in the suspected broken road data set, the road corresponding to the broken point is determined to be a non-broken road;

[0026] The broken-end roads are determined based on the difference between the broken-end road dataset and the non-broken-end roads.

[0027] In a second aspect, an embodiment of the present application provides an electronic map construction method, including:

[0028] Through the first aspect and / or various possible implementations of the first aspect, the road data set is processed to obtain administrative district boundary roads in the road data set; and the electronic map is updated according to the administrative district boundary roads.

[0029] In a third aspect, an embodiment of the present application provides an administrative division boundary road recognition device, comprising:

[0030] A determination module, configured to determine a first geometric shape of each road in the at least one road according to a boundary line of the at least one road in the road data set;

[0031] A generating module, for generating a buffer zone including the first geometric shape for each first geometric shape;

[0032] The identification module is used to identify the administrative division boundary road in at least one road according to the overlap degree between at least one administrative division and each buffer zone in the road data set.

[0033] In a possible implementation, the identification module is specifically used for:

[0034] Determine the first minimum circumscribed geometry of each buffer zone;

[0035] Determine the second smallest circumscribed geometric figure of each boundary line;

[0036] When the first minimum circumscribed geometric figure overlaps with the second minimum circumscribed geometric figure, the road corresponding to the first minimum circumscribed geometric figure overlapping with the second minimum circumscribed geometric figure is determined as the administrative boundary road, or the administrative boundary road is determined from the roads corresponding to the overlapping first minimum circumscribed geometric figure.

[0037] In a possible implementation, the identification module is further used for:

[0038] Determine whether there is at least one separating axis between the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure, the separating axis being a straight line or a plane perpendicular to the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure;

[0039] The following processing is performed for each separating axis: determining a first projection of a first minimum circumscribed geometric figure on the separating axis and determining a second projection of a second minimum circumscribed geometric figure on the separating axis; determining whether the first projection overlaps the second projection;

[0040] When the first projection determined by each separation axis overlaps with the second projection, the road corresponding to the first projection that overlaps with the second projection is determined as the administrative division boundary road.

[0041] In a possible implementation, the generation module is specifically used for:

[0042] Based on each first geometric shape and with a first radius, a buffer zone including the first geometric shape is generated according to a road scene.

[0043] In a possible implementation manner, the determination module is specifically configured to:

[0044] Obtain a dataset of suspected broken roads;

[0045] According to the administrative boundary roads, the broken roads are identified from the suspected broken roads dataset.

[0046] In a possible implementation manner, the determination module is further configured to:

[0047] The broken road dataset is obtained based on the difference between the suspected broken road dataset and the administrative boundary roads;

[0048] For the broken point in the broken road dataset, a buffer zone including the broken point is generated with the second radius;

[0049] Determine the broken roads based on the buffer zone generated based on the broken points.

[0050] In a possible implementation, the determination module is used to:

[0051] When the buffer zone generated by the broken point intersects with the low-level road set in the suspected broken road data set, the road corresponding to the broken point is determined to be a non-broken road;

[0052] The broken-end roads are determined based on the difference between the broken-end road dataset and the non-broken-end roads.

[0053] In a fourth aspect, an embodiment of the present application provides an electronic device, including: a memory, a processor;

[0054] Memory stores computer-executable instructions;

[0055] The processor executes the computer-executable instructions stored in the memory, so that the processor executes the first aspect and / or the second aspect and / or various possible implementations of the first aspect and / or various possible implementations of the second aspect as described above.

[0056] In a fifth aspect, an embodiment of the present application provides a computer-readable storage medium, in which computer execution instructions are stored. When the computer execution instructions are executed by a processor, they are used to implement the first aspect and / or the second aspect and / or various possible implementations of the first aspect and / or various possible implementations of the second aspect as above.

[0057] In a sixth aspect, an embodiment of the present application provides a computer program product, including a computer program, which, when executed by a processor, implements the first aspect and / or the second aspect and / or various possible implementations of the first aspect and / or various possible implementations of the second aspect as above.

[0058] The administrative division boundary road identification method, electronic device, medium and program product provided by the present application determine the first geometric shape of each road in at least one road according to the boundary line of at least one road in the road data set; generate a buffer zone containing the first geometric shape for each first geometric shape; and identify the administrative division boundary road in at least one road according to the overlap degree between the boundary line of at least one administrative division in the road data set and each buffer zone. The present application generates a buffer zone containing the first geometric shape for the first geometric shape of at least one road in the road data set, thereby reducing the impact of errors in making the road data set on road identification, thereby improving the accuracy of the road data set; and identifies the administrative division boundary roads in at least one road according to the overlap degree between the boundary line of at least one administrative division in the road data set and each buffer zone, thereby achieving the effect of improving the accuracy of screening administrative division boundary roads. BRIEF DESCRIPTION OF THE DRAWINGS

[0059] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0060] Figure 1 An example diagram of a broken road provided in an embodiment of the present application;

[0061] Figure 2 Schematic diagram of the process of the administrative division boundary road identification method provided in the embodiment of the present application Figure 1 ;

[0062] Figure 3 A schematic diagram of a first geometric shape of a road provided in an embodiment of the present application;

[0063] Figure 4 A schematic diagram of a structure for generating a buffer zone including a first geometric shape provided in an embodiment of the present application;

[0064] Figure 5 A schematic diagram of a suspected head-breaking data set adopted by an embodiment of the present application;

[0065] Figure 6 A schematic diagram of the structure of a method for generating a buffer zone including a break point provided in an embodiment of the present application;

[0066] Figure 7 An overall flow chart of the administrative division boundary road identification method provided in the embodiment of the present application;

[0067] Figure 8 A schematic diagram of the structure of the administrative division boundary road identification device provided for this application;

[0068] Fig. 9 A schematic diagram of the structure of an electronic device provided in one embodiment of the present application.

[0069] The above drawings have shown clear embodiments of the present application, which will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present application in any way, but to illustrate the concept of the present application to those skilled in the art by referring to specific embodiments. DETAILED DESCRIPTION

[0070] Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims.

[0071] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use, processing, transmission, provision, disclosure and application of the relevant data comply with relevant laws, regulations and standards, take necessary confidentiality measures, do not violate public order and good morals, and provide corresponding operation entrances for users to choose to authorize or refuse.

[0072] In addition, this application involves conducting big data analysis of user information (including but not limited to personal biometrics, identity data, consumption data, asset data, electronic terminal operation data, etc.), and using artificial intelligence technology to make automated decisions, and making technical solutions that have a significant impact on personal rights and interests based on the results of automated decisions. The application provides users with corresponding operation entrances for them to choose to agree or reject the results of automated decisions; if the user chooses to reject, the expert decision-making process will be entered.

[0073] In addition to marking administrative boundary roads when making electronic maps (such as high-definition maps or standard-definition maps, etc.), other scenarios in the high-definition map production process also require the identification of administrative boundary roads. For example, in the identification scenario of dead-end roads, administrative boundary roads are often identified as dead-end roads. The reason is that the collection and production of road data are often carried out in units of administrative divisions, resulting in administrative boundary roads also having the characteristics of such dead-end roads. The principle of dead-end roads can be referred to Figure 1 , Figure 1 This is an example diagram of a dead-end road provided in an embodiment of the present application. Figure 1 It can be seen that both the administrative boundary road a and the real dead-end road b will be identified as dead-end roads, but the administrative boundary road a is not actually a dead-end road. Figure 1 The thick black lines represent high-level roads, the thin black lines represent low-level roads, and the boxes represent administrative boundaries.

[0074] In order to address the above problems, this application proposes a road identification method, which first generates a road buffer according to the road's geometric shape and business scenarios, and then identifies the administrative boundary roads based on the spatial position relationship between the road buffer and the administrative boundary.

[0075] Furthermore, in this application, the electronic map can be updated according to the identified administrative boundary roads, such as marking the administrative boundary roads in the electronic map, etc.; the broken roads in the electronic map can also be corrected according to the identified administrative boundary roads. In this application, the urban infrastructure can be better planned and improved according to the identified administrative boundary roads, including road construction, transportation facilities construction, etc., to improve the overall development level of the city. In this application, the potential safety hazard areas can also be identified according to the identified administrative boundary roads, and measures can be taken to improve road safety and reduce the incidence of traffic accidents.

[0076] The technical solution of the present application and how the technical solution of the present application solves the above-mentioned technical problems are described in detail below with specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below in conjunction with the accompanying drawings.

[0077] Figure 2 Schematic diagram of the process of the administrative division boundary road identification method provided in the embodiment of the present application Figure 1 ,like Figure 2 As shown, the method includes:

[0078] S201. Determine a first geometric shape of each road in at least one road according to a boundary line of at least one road in a road data set.

[0079] In this step, it can be understood that by identifying and determining the boundary lines of the roads, the first geometric shape of each road in at least one road can be determined. The boundary lines of the roads refer to the edges or boundaries of the roads, and these lines define the actual range of the roads. The first geometric shape of each road refers to the preliminary or basic geometric shape of each road, which includes basic features such as the width, curvature, and length of the road. Further, the schematic diagram of the first geometric shape of the road can be referred to Figure 3 , Figure 3 A schematic diagram of a first geometric shape of a road provided in an embodiment of the present application. Figure 3 It can be seen that the first geometric shapes of the road include the following:

[0080] Rectilinear shape: extends along a straight line;

[0081] Horizontal curve shape: presents a curve shape in the horizontal direction;

[0082] Vertical curve shape: presents a curve shape in the vertical direction.

[0083] Need to explain, Figure 3 The a in the equation indicates that the first geometric shape of the road is a straight line. Figure 3 The b in the equation indicates that the first geometric shape of the road is a horizontal curve. Figure 3 The c in denoted as is a vertical curve shape.

[0084] The specific implementation method of obtaining the first geometric shape of the road determined corresponding to the boundary line of the road in the road data set can also be set according to the specific actual situation.

[0085] In one example, a first geometric shape is manually input into a computing device such as a server or a server cluster, and the computing device automatically extracts the manually input first geometric shape.

[0086] In another example, a shape extraction algorithm is used to automatically extract a first geometric shape from the high-definition map being produced. The shape extraction algorithm can be set according to specific needs. Optionally, the shape extraction algorithm includes an edge detection algorithm, a contour detection algorithm, a segmentation algorithm, and the like.

[0087] In yet another example, the first geometric shape is directly input manually.

[0088] S202 . For each first geometric shape, generate a buffer zone including the first geometric shape.

[0089] After obtaining the first geometric shape of at least one road in the road dataset, a buffer zone including the first geometric shape needs to be generated for the first geometric shape of the road. This means that the number of generated buffer zones is related to the number of roads in the road dataset, and the shape of the generated buffer zone is related to the first geometric shape of the road in the road dataset.

[0090] Furthermore, for the first geometric shape of at least one road in the road data set, a buffer zone containing the first geometric shape is generated, which can reduce the impact of errors in the production of the road data set on the administrative division boundary road identification method, thereby improving the accuracy of the administrative division boundary road identification method.

[0091] S203: Identify an administrative division boundary road in at least one road according to the degree of overlap between the boundary line of at least one administrative division and each buffer zone in the road data set.

[0092] After obtaining the first geometric shape, it is necessary to extract the boundary line of at least one administrative division in the road data set. The specific implementation method of extracting the boundary line of the administrative division can be set according to specific needs.

[0093] In one example, the active contour model is used to automatically extract the boundaries of administrative divisions. The active contour model achieves boundary extraction by defining an energy function, which consists of two parts: internal energy and external energy. The internal energy helps to maintain the smoothness and shape constraints of the curve, while the external energy attracts the curve to move toward the boundary of the object according to the image features. Under the joint action of these energies, the curve gradually evolves and eventually converges to the boundary of the object.

[0094] In each iteration, the active contour model adjusts the shape of the curve according to the gradient direction of the energy function, gradually approaching the boundary of the object. Through continuous iteration, the curve shrinks or expands until the optimal boundary position is found.

[0095] A significant advantage of the active contour model is that it can cope with noise and discontinuities in images and is suitable for extracting the boundaries of objects of various shapes. This method has a wide range of applications in fields such as image segmentation and target detection, and can effectively extract the boundary information of complex objects in images.

[0096] In another example, the edge algorithm is used to automatically extract the boundaries of administrative divisions. The edge algorithm identifies the boundaries of administrative divisions by calculating the changes in pixel grayscale values. Common edge algorithms include using the Sobel operator or the Prewitt operator to perform gradient calculations to determine areas with significant changes in grayscale values, thereby identifying the boundaries of administrative divisions. This method can effectively capture the boundaries of administrative divisions and provide important basic information for the subsequent identification of administrative division boundaries.

[0097] In another example, an edge detection algorithm is first used to obtain discrete edge points in the boundary line of the administrative division, such as Canny edge detection and Laplacian operator to obtain discrete edge points in the second geometric shape. Then, based on the edge connection algorithm, the discrete edge points in the boundary line of the administrative division are connected into a continuous contour line to form a closed boundary line of the administrative division.

[0098] Furthermore, extracting at least one administrative division boundary line from the road data set can reduce the impact of the time error of the road data set on the administrative division boundary road recognition method, thereby improving the accuracy of the administrative division boundary road recognition method.

[0099] Furthermore, the overlap degree between the buffer zone generated in S202 and the boundary line of the administrative division is determined, and then the administrative division boundary road in at least one road is identified according to the overlap degree between the generated buffer zone and the boundary line of the administrative division. The specific implementation method of whether the generated buffer zone overlaps the boundary line of the administrative division can be set according to the actual situation.

[0100] In one implementation, a spatial intersection calculation is used to determine the degree of overlap between the generated buffer and the boundary lines of the administrative divisions.

[0101] In another implementation, a bounding sphere method is used to determine the degree of overlap between the generated buffer zone and the boundary line of the administrative division.

[0102] In yet another implementation, an axis-aligned bounding box collision detection method is used to determine the degree of overlap between the generated buffer and the boundary line of the administrative division.

[0103] The road identification method provided in the embodiment of the present application determines the first geometric shape of each road in at least one road based on the boundary line of at least one road in the road data set, and generates a buffer zone containing the first geometric shape, thereby reducing the impact of errors in making the road data set on road identification, thereby improving the accuracy of the road data set; and identifies administrative division boundary roads in at least one road based on the degree of overlap between the boundary line of at least one administrative division in the road data set and each buffer zone, thereby achieving the effect of improving the accuracy of screening administrative division boundary roads.

[0104] On the basis of the above embodiments, according to the degree of overlap between the boundary line of at least one administrative division and each buffer zone in the road data set, an administrative division boundary road in at least one road is identified, including: determining the first minimum circumscribed geometric figure of each buffer zone; determining the second minimum circumscribed geometric figure of each boundary line; when the first minimum circumscribed geometric figure overlaps with the second minimum circumscribed geometric figure, determining the road corresponding to the first circumscribed geometric figure that overlaps with the second minimum circumscribed geometric figure as the administrative division boundary road, or determining the administrative division boundary road from the roads corresponding to the first minimum circumscribed geometric figure that overlaps.

[0105] In this embodiment, it can be understood that to determine the administrative division boundary road, it is necessary to first determine the first minimum circumscribed geometric figure of each buffer zone and the second minimum circumscribed geometric figure of each boundary line. The minimum circumscribed geometric figure refers to a geometric figure with the minimum area that can completely surround a given geometric shape. The shape of the minimum circumscribed geometric figure can be set according to specific needs.

[0106] The following uses the determination of the first bounding rectangle of the buffer as an example to explain how to determine the minimum bounding rectangle:

[0107] 1. Find all vertices in the buffer;

[0108] 2. Determine the minimum and maximum horizontal coordinate values ​​among the vertices;

[0109] 3. Determine the minimum and maximum ordinate values ​​among the vertices;

[0110] 4. Construct a rectangle based on the above four coordinate values. This rectangle is the minimum enclosing rectangle.

[0111] In another example, we take determining the first circumscribed convex polygon of the buffer as an example to explain how to determine the minimum circumscribed convex polygon:

[0112] 1. Find all vertices in the buffer;

[0113] 2. Use the convex hull algorithm to calculate the minimum convex polygon that can surround all vertices of the buffer zone. This minimum convex polygon is the minimum circumscribed convex polygon.

[0114] After determining the first minimum circumscribed geometry of the buffer zone and the second minimum circumscribed geometry of the boundary line, it is necessary to determine the degree of overlap between the first minimum circumscribed geometry of the buffer zone and the second minimum circumscribed geometry of the boundary line, and perform targeted processing based on whether there is overlap between the first minimum circumscribed geometry of the buffer zone and the second minimum circumscribed geometry of the boundary line.

[0115] Determining the second minimum circumscribed geometric figure of each boundary line includes the following situations: directly determining the second minimum circumscribed geometric figure of each boundary line; first determining the second geometric shape of each boundary line, and then determining the second minimum circumscribed geometric figure based on the second geometric shape. Among them, the second geometric shape of the boundary line refers to the boundary shape of the administrative area in the geographical space. The division of administrative areas can be determined by, but not limited to, one or any combination of factors such as history, geography, and humanities. The shape of the administrative division boundary can be relatively regular or irregular. Different administrative divisions correspond to different administrative division boundary shapes. For example, in the administrative planning areas of most cities, the boundary shapes of some industrial parks present a relatively regular geometric shape; the administrative division boundary shapes of some counties in Guiyang City present an irregular geometric shape.

[0116] Furthermore, a relatively regular administrative division boundary shape may be specifically a rectangle, a polygon, etc. An irregular administrative division boundary shape may be specifically a sawtooth shape, a complex polygon, etc.

[0117] In one implementation, when any first minimum circumscribed geometric figure overlaps with any second minimum circumscribed geometric figure, the road corresponding to the first circumscribed geometric figure overlapping with the second minimum circumscribed geometric figure is directly determined as the administrative boundary road.

[0118] In another implementation, when any first minimum circumscribed geometric figure overlaps with any second minimum circumscribed geometric figure, the administrative boundary roads are determined from the roads corresponding to the overlapping first minimum circumscribed geometric figures.

[0119] The embodiment of the present application can reduce the impact of errors in producing road data sets on road identification by identifying administrative boundary roads in at least one road based on the degree of overlap between the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure, thereby improving the accuracy of the road identification method.

[0120] Furthermore, determining the administrative boundary road from the roads corresponding to the first minimum circumscribed geometric figures that overlap includes: determining whether there is at least one separation axis between the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure, the separation axis being a straight line or plane perpendicular to the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure; performing the following processing for each separation axis: determining the first projection of the first minimum circumscribed geometric figure on the separation axis and determining the second projection of the second minimum circumscribed geometric figure on the separation axis; determining whether there is overlap between the first projection and the second projection; when the first projection determined by each separation axis overlaps with the second projection, determining the road corresponding to the first projection that overlaps with the second projection as the administrative boundary road. In other words, when the first minimum circumscribed geometric figure overlaps with the second minimum circumscribed geometric figure, the degree of overlap between the first geometric figure and the second minimum circumscribed geometric figure is accurately identified, and the administrative boundary road is determined based on the result of the accurate identification.

[0121] In one implementation, if there is a separation axis where the first projection and the second projection do not overlap, the road corresponding to the first projection that does not overlap with the second projection is determined as a non-administrative boundary road.

[0122] In another implementation, when the first projection and the second projection determined by each separation axis have overlapping points or overlapping areas, the road corresponding to the first projection having overlapping points or overlapping areas with the second projection is determined as the administrative boundary road.

[0123] Furthermore, the administrative division boundary roads determined from the roads corresponding to the first minimum circumscribed geometric figures with overlap can be set according to actual conditions.

[0124] In one example, the Separating Axis Theorem is used to determine administrative boundary roads from roads corresponding to the first minimum circumscribed geometric figures that have overlaps.

[0125] Next, taking the example of a convex polygon as the minimum circumscribed geometric figure, it is explained how to use the separating axis principle to determine the administrative boundary roads from the roads corresponding to the first minimum circumscribed geometric figure that overlap.

[0126] 1. For two convex polygons, calculate the normal vector of each edge as a potential separation axis. The normal vector can be used to check whether there is a gap between the two convex polygons;

[0127] 2. For each potential separating axis, project all vertices of the two convex polygons onto each candidate separating axis to obtain two projected line segments on a potential separating axis;

[0128] 3. For each potential separating axis, check whether there is an overlapping area between the two projected line segments. If there is an overlapping area between the projected intervals on all potential separating axes, the two convex polygons are considered to intersect. Otherwise, the two convex polygons are considered to not intersect.

[0129] In another example, the Weiler-Atherton algorithm is used to accurately identify roads corresponding to buffers with overlapping areas. The Weiler-Atherton algorithm effectively determines the intersection of two polygons through the steps of boundary tracing, intersection calculation, and new polygon construction. By recording the intersection points of the polygon boundaries and constructing a new polygon, the intersection relationship between the two polygons can be accurately calculated.

[0130] The embodiment of the present application can improve the accuracy of the administrative division boundary road identification method by determining the administrative division boundary road from the roads corresponding to the first minimum circumscribed geometric figures that have overlap.

[0131] Based on the above embodiment, for each first geometric shape, generating a buffer zone including the first geometric shape includes: based on each first geometric shape, generating a buffer zone including the first geometric shape according to a road scene with a first radius, wherein the first radius can be set according to a business scenario.

[0132] In one example, in the administrative division boundary road recognition scenario, the first radius is determined by the error between the endpoint of the administrative division boundary road and the administrative division boundary. The reason is that the road data set used in the business scenario of administrative division boundary road recognition may contain road data that has not been strictly connected during the production process, resulting in a certain error between the endpoint of the administrative division boundary road and the boundary road. Therefore, in order to reduce the impact of the error on the administrative division boundary road, the length of the error is used as the first radius to generate a buffer zone containing the first geometric shape. Assuming the error is 100 meters, the first radius is also 100 meters.

[0133] Furthermore, after obtaining the first geometric shape of at least one road in the road dataset, it is necessary to generate a buffer zone containing the first geometric shape based on the first geometric shape of at least one road in the road dataset and with a first radius according to the road scene, which means that the buffer zone can also be set according to the road scene.

[0134] Below, we take urban roads as an example to explain how to generate a buffer zone containing the first geometric shape of urban roads. For the specific principle, please refer to Figure 4 , Figure 4 A schematic diagram of a structure for generating a buffer zone including a first geometric shape provided in an embodiment of the present application. Figure 4As shown, generating a buffer zone containing a first geometric shape requires determining two endpoints of the first geometric shape of the road, generating two semicircles at the endpoints with a first radius, and generating a rectangle containing the first geometric shape of the road between the two endpoints with a width twice the value of the first radius and a length of the horizontal distance between the two endpoints. The two semicircles and the rectangle are joined together to form a buffer zone containing the first geometric shape.

[0135] The embodiment of the present application can improve the accuracy of administrative division boundary road recognition by generating a buffer zone including the first geometric shapes based on each first geometric shape and with a first radius according to a road scene.

[0136] Furthermore, in the process of high-speed data production, high-level roads, such as expressways, are produced first, and then low-level roads, such as national highways, are produced. However, after the production of high-level roads is completed, when the production of low-level roads is started, it is necessary to identify the non-broken roads of high-level roads, that is, the connection position between high-level roads and low-level roads. The collection and production of administrative data are often carried out in units of administrative divisions, and administrative division boundary roads can also be regarded as suspected broken roads. This means that the suspected broken road data set contains administrative division boundary roads, broken roads of high-level roads, and non-broken roads.

[0137] Therefore, after determining the administrative boundary roads, the method further includes: obtaining a suspected dead-end road dataset; and determining the dead-end road from the suspected dead-end road dataset according to the administrative boundary roads. The method further includes: obtaining the dead-end road dataset according to the difference between the suspected dead-end road dataset and the administrative boundary roads; generating a buffer zone containing the dead-end point with a second radius for the dead-end point in the dead-end road dataset; and determining the dead-end road based on the buffer zone generated by the dead-end point.

[0138] The roads included in the suspected broken road dataset can be referenced Figure 5 . Figure 5 This is a schematic diagram of a suspected head-breaking data set adopted by an embodiment of the present application. Figure 5 The road d in the figure is a boundary road, the road e is a non-broken road, and the road f is a broken road. Roads d, e, and f constitute a suspected broken road dataset.

[0139] from Figure 5 It can be seen that the suspected dead-end road dataset contains administrative boundary roads, while administrative boundary roads are not real dead-end roads. Therefore, it is necessary to remove administrative boundary roads from the suspected dead-end road dataset to obtain the dead-end road dataset, in which the dead-end road dataset contains dead-end roads and non-broken roads.

[0140] Further, Figure 5 The thick black lines represent high-level roads, the thin black lines represent low-level roads, and the boxes represent administrative boundaries.

[0141] Then, for the breakpoints in the breakpoint road dataset, a buffer zone containing the breakpoints is generated with the second radius. For the specific principle, please refer to Figure 6 , Figure 6 A schematic diagram of a method for generating a buffer zone including a break point provided in an embodiment of the present application. Figure 6 The roads, thick black lines, thin black lines, and boxes in the Figure 5 Consistent.

[0142] Furthermore, based on the buffer zone generated by the dead-end point, the dead-end road is determined, including: when there is an intersection between the buffer zone generated by the dead-end point and the set of low-level roads in the suspected dead-end road data set, determining that the road corresponding to the dead-end point is a non-dead-end road; and determining the dead-end road according to the difference between the dead-end road data set and the non-dead-end road.

[0143] This means that it is necessary to perform an intersection judgment calculation on the buffer zone generated at the break point and the set of low-level equal roads in the suspected break road data set to determine whether there is an intersection between the buffer zone generated at the break point and the set of low-level equal roads in the suspected break road data set, that is, whether there is a common part, wherein the principle of intersection judgment calculation is similar to the principle of overlap degree calculation, and has been explained in detail in the above embodiments, and the embodiments of the present application will not be repeated here.

[0144] If the calculation result of the intersection judgment between the buffer zone generated at the dead-end point and the low-level road set in the suspected dead-end road dataset is an intersection, then the road corresponding to the dead-end point can be confirmed as a non-dead-end road; the non-dead-end road is removed from the dead-end dataset to obtain the dead-end road. Among them, the non-dead-end road refers to the high-level road adjacent to the low-level road. For details, please refer to Figure 6 The road shown is e.

[0145] Furthermore, dead-end roads are filtered and non-dead-end roads are retained to form a data basis for subsequent services, thereby providing a basis for subsequent services, such as providing a data basis for subsequent navigation services.

[0146] After determining the administrative boundary roads, the embodiment of the present application needs to determine the broken roads from the suspected broken road data set, which can improve the accuracy of broken road identification, thereby improving the accuracy of the road identification method.

[0147] Based on the above embodiments, an embodiment of the present application provides an electronic map construction method, which includes: processing a road data set through the administrative division boundary road identification method provided in the above method embodiment to obtain administrative division boundary roads in the road data set; and updating the electronic map according to the administrative division boundary roads.

[0148] In one example, the administrative division boundary roads in the road data set are obtained through the administrative division boundary road recognition method provided by the above method embodiment, and the administrative division boundary roads are updated in the map according to the administrative division boundary roads.

[0149] In another example, the administrative division boundary road recognition method provided by the above method embodiment is used to obtain the administrative division boundary roads in the road data set, and the map annotation information is updated in the map according to the administrative division boundary roads to provide the latest map annotation information.

[0150] In another example, the administrative boundary roads in the road data set are obtained through the administrative boundary road recognition method provided by the above method embodiment, and traffic signs, traffic lights and other information are updated in the map according to the administrative boundary roads to ensure that the map content is consistent with the actual road conditions, thereby assisting users to drive safely and accurately.

[0151] The embodiment of the present application can improve the accuracy of the electronic map by updating the electronic map according to the administrative division boundary roads.

[0152] Next, we will explain how to use the administrative division boundary road recognition method provided in the embodiment of the present application to perform administrative division boundary road recognition. The overall process of the method is shown in FIG. Figure 7 , Figure 7 The overall flow chart of the administrative division boundary road identification method provided in the embodiment of the present application. Figure 7 As shown, the overall process is as follows:

[0153] 1. Obtain the geometry of at least one road and at least one administrative division in the road dataset;

[0154] 2. For each acquired geometric shape of each road: according to each acquired geometric shape of the road, a corresponding buffer zone is generated with a first radius, wherein the first radius is determined according to an error between an endpoint of the administrative division boundary road and the administrative division boundary;

[0155] 3. For the obtained geometric shapes of each administrative division: extract the boundary lines of the geometric shapes of the administrative divisions;

[0156] 4. Perform spatial intersection calculations on the buffer zones of each road and the boundaries of each administrative division, and determine the administrative division boundary roads based on the results of the spatial intersection calculations.

[0157] 4.1 Calculate the minimum enclosing rectangle of the road buffer and administrative division boundary line;

[0158] 4.2 Determine whether the minimum enclosing rectangle of the road buffer zone and the minimum enclosing rectangle of the administrative division boundary line intersect;

[0159] 4.3 If the minimum enclosing rectangle of the buffer zone intersects with the minimum enclosing rectangle of the administrative boundary line, based on a boundary recognition detection algorithm, such as the SAT algorithm, the road corresponding to the buffer zone that intersects with the minimum enclosing rectangle of the administrative boundary line is determined to be an administrative boundary road; if the minimum enclosing rectangle of the buffer zone intersects with the minimum enclosing rectangle of the administrative boundary line but does not intersect, the road corresponding to the buffer zone that does not intersect with the minimum enclosing rectangle of the administrative boundary line is determined to be a non-administrative boundary road.

[0160] 5. After determining the administrative division roads, obtain the suspected dead-end road data set, and obtain the dead-end road data set based on the difference between the suspected dead-end road data set and the administrative division boundary roads; for the dead-end points in the dead-end road data set, generate a buffer zone corresponding to the dead-end point with the second radius; when the corresponding buffer zone generated by the dead-end point has an intersection with the set of low-level roads in the suspected dead-end road data set, determine that the road corresponding to the dead-end point is a non-dead-end road, remove the non-dead-end road from the dead-end road data set to obtain a dead-end road, that is, when the corresponding buffer zone generated by the dead-end point has no intersection with the set of low-level roads in the suspected dead-end road data set, determine that the road corresponding to the dead-end point is a dead-end road.

[0161] In summary, the embodiments of the present application can automatically and efficiently identify administrative district boundary roads from a large amount of road data, thereby facilitating targeted processing of administrative district boundary roads during the high-definition map production process to improve the efficiency and accuracy of high-definition map production.

[0162] Furthermore, after identifying the administrative boundary roads, non-broken roads are determined from the suspected broken road data set, that is, the roads adjacent to high-level roads and low-level roads are determined from the suspected broken road data set to provide a data basis for subsequent services.

[0163] The following is an embodiment of the device of the present application, which can be used to execute the embodiment of the method of the present application. For details not disclosed in the embodiment of the device of the present application, please refer to the embodiment of the method of the present application.

[0164] Figure 8 The schematic diagram of the structure of the administrative division boundary road identification device provided in this application is as follows: Figure 8 As shown, the administrative division boundary road recognition device 800 provided in this embodiment includes:

[0165] A determination module 801, configured to determine a first geometric shape of each road in at least one road according to a boundary line of at least one road in the road data set;

[0166] A generating module 802 is used to generate a buffer zone including the first geometric shape for each first geometric shape;

[0167] The identification module 803 is used to identify an administrative division boundary road in at least one road according to the overlap degree between at least one administrative division and each buffer zone in the road data set.

[0168] In a possible implementation, the identification module 803 is specifically configured to:

[0169] Determine the first minimum circumscribed geometry of each buffer zone;

[0170] Determine the second smallest circumscribed geometric figure of each boundary line;

[0171] When the first minimum circumscribed geometric figure overlaps with the second minimum circumscribed geometric figure, the road corresponding to the first minimum circumscribed geometric figure overlapping with the second minimum circumscribed geometric figure is determined as the administrative boundary road, or the administrative boundary road is determined from the roads corresponding to the overlapping first minimum circumscribed geometric figure.

[0172] In a possible implementation, the identification module 803 is further configured to:

[0173] Determine whether there is at least one separating axis between the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure, the separating axis being a straight line or a plane perpendicular to the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure;

[0174] The following processing is performed for each separating axis: determining a first projection of a first minimum circumscribed geometric figure on the separating axis and determining a second projection of a second minimum circumscribed geometric figure on the separating axis; determining whether the first projection overlaps the second projection;

[0175] When the first projection determined by each separation axis overlaps with the second projection, the road corresponding to the first projection that overlaps with the second projection is determined as the administrative division boundary road.

[0176] In a possible implementation, the generating module 802 is specifically configured to:

[0177] Based on each first geometric shape and with a first radius, a buffer zone including the first geometric shape is generated according to a road scene.

[0178] In a possible implementation, the determination module 801 is specifically configured to:

[0179] Obtain a dataset of suspected broken roads;

[0180] According to the administrative boundary roads, the broken roads are identified from the suspected broken roads dataset.

[0181] In a possible implementation, the determining module 801 is further configured to:

[0182] The broken road dataset is obtained based on the difference between the suspected broken road dataset and the administrative boundary roads;

[0183] For the broken point in the broken road dataset, a buffer zone including the broken point is generated with the second radius;

[0184] Determine the broken roads based on the buffer zone generated based on the broken points.

[0185] In a possible implementation, the determination module 801 is used to:

[0186] When the buffer zone generated by the broken point intersects with the low-level road set in the suspected broken road data set, the road corresponding to the broken point is determined to be a non-broken road;

[0187] The broken-end roads are determined based on the difference between the broken-end road dataset and the non-broken-end roads.

[0188] The administrative division boundary road identification device provided in this embodiment can execute the method provided in the above method embodiment. Its implementation principle and technical effect are similar, and this embodiment will not be described in detail here.

[0189] It should be noted that it should be understood that the division of the various modules of the above device is only a division of logical functions. In actual implementation, they can be fully or partially integrated into one physical entity, or they can be physically separated. And these modules can all be implemented in the form of software called by processing elements; they can also be all implemented in the form of hardware; some modules can also be implemented in the form of software called by processing elements, and some modules can be implemented in the form of hardware. For example, the processing module can be a separately established processing element, or it can be integrated in a chip of the above device. In addition, it can also be stored in the memory of the above device in the form of program code, and called and executed by a processing element of the above device. The implementation of other modules is similar. In addition, these modules can be fully or partially integrated together, or they can be implemented independently. The processing element here can be an integrated circuit with signal processing capabilities. In the implementation process, each step of the above method or each module above can be completed by an integrated logic circuit of hardware in the processor element or instructions in the form of software.

[0190] For example, the above modules may be one or more integrated circuits configured to implement the above methods, such as one or more application specific integrated circuits (ASIC), or one or more microprocessors (DSP), or one or more field programmable gate arrays (FPGA). For another example, when a module is implemented in the form of a processing element to allocate program code, the processing element may be a general-purpose processor, such as a central processing unit (CPU) or other processor that can call program code. For another example, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).

[0191] Fig. 9 This is a schematic diagram of the structure of an electronic device provided by an embodiment of the present application. Fig. 9 As shown, the electronic device 900 provided in the embodiment of the present application may include: a processor 901, and a memory 902 connected to the processor in communication, wherein:

[0192] Memory stores computer-executable instructions;

[0193] The processor executes the computer-executable instructions stored in the memory to implement the method described in the foregoing method embodiment.

[0194] It should be understood that the processor 901 can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), etc. The general-purpose processor can be a microprocessor or the processor can be any conventional processor, etc. The steps of the method disclosed in the application can be directly embodied as being executed by a hardware processor, or can be executed by a combination of hardware and software modules in the processor. The memory 902 may include a high-speed random access memory (RAM), and may also include non-volatile storage NVM (non-volatile memory), such as at least one disk storage, and can also be a USB flash drive, a mobile hard disk, a read-only memory, a disk or an optical disk, etc.

[0195] Optionally, the electronic device 900 may further include a communication interface 903. In a specific implementation, if the communication interface 903, the memory 902 and the processor 901 are implemented independently, the communication interface 903, the memory 902 and the processor 901 may be interconnected through a bus and communicate with each other. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The bus may be divided into an address bus, a data bus, a control bus, etc., but it does not mean that there is only one bus or one type of bus.

[0196] Optionally, in a specific implementation, if the communication interface 903, the memory 902 and the processor 901 are integrated on a chip, the communication interface 903, the memory 902 and the processor 901 can communicate through an internal interface.

[0197] An embodiment of the present application also provides a computer-readable storage medium, in which computer-executable instructions are stored. When the computer-executable instructions are executed, they are used to implement the method described in any of the aforementioned embodiments.

[0198] It is understood that the computer-readable storage medium can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read only memory (EEPROM), erasable programmable read only memory (EPROM), programmable read only memory (PROM), read only memory (ROM), magnetic storage, flash memory, magnetic disk or optical disk. The readable storage medium can be any available medium that can be accessed by a general or special-purpose computer.

[0199] An exemplary computer-readable storage medium is coupled to a processor so that the processor can read information from the computer-readable storage medium and write information to the computer-readable storage medium. Of course, the computer-readable storage medium can also be an integral part of the processor. The processor and the computer-readable storage medium can be located in an ASIC. Of course, the processor and the computer-readable storage medium can also exist in an electronic device as discrete components.

[0200] The above-mentioned integrated module implemented in the form of a software function module can be stored in a computer-readable storage medium. The above-mentioned software function module is stored in a computer-readable storage medium, including a number of instructions for enabling an electronic device (which can be a personal computer, a server, or a network device, etc.) or a processor to perform some steps of the method described in each embodiment of the present application.

[0201] An embodiment of the present application also provides a computer program product, including a computer program, which implements the method described in any of the above embodiments when executed.

[0202] It should be noted that, for the aforementioned method embodiments, for the sake of simplicity, they are all expressed as a series of action combinations, but those skilled in the art should be aware that the present application is not limited by the described order of actions, because according to the present application, certain steps can be performed in other orders or simultaneously. Secondly, those skilled in the art should also be aware that the embodiments described in the specification are all optional embodiments, and the actions and modules involved are not necessarily required by the present application.

[0203] It should be further noted that, although the various steps in the flow chart are displayed in sequence according to the indication of the arrows, these steps are not necessarily executed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps is not strictly limited in order, and these steps can be executed in other orders. Moreover, at least a portion of the steps in the flow chart may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but can be executed at different times, and the execution order of these sub-steps or stages is not necessarily to be carried out in sequence, but can be executed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.

[0204] In the above embodiments, the description of each embodiment has its own emphasis. For parts not described in detail in a certain embodiment, please refer to the relevant description of other embodiments. The technical features of the above embodiments can be combined arbitrarily. In order to make the description concise, all possible combinations of the technical features in the above embodiments are not described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0205] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the invention disclosed herein. The present application is intended to cover any modification, use or adaptation of the present application, which follows the general principles of the present application and includes common knowledge or customary techniques in the art that are not disclosed in the present application. The specification and examples are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the following claims.

[0206] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A method for identifying administrative boundary roads, characterized in that: include: Determining a first geometric shape of each road in the at least one road based on a boundary line of the at least one road in the road data set; For each road's first geometric shape, generate a buffer zone including the first geometric shape, wherein the buffer zone is determined based on an error between an endpoint of the administrative division boundary road and the administrative division boundary; Identifying an administrative division boundary road in at least one road according to the overlap degree of the boundary line of at least one administrative division and each buffer zone in the road data set; Identifying an administrative division boundary road in at least one road according to the overlap degree of the boundary line of at least one administrative division and each buffer zone in the road data set, comprising: Determine the first minimum circumscribed geometry of each buffer zone; Determine the second smallest circumscribed geometric figure of each boundary line; When the first minimum circumscribed geometric figure overlaps with the second minimum circumscribed geometric figure, the road corresponding to the first minimum circumscribed geometric figure that overlaps with the second minimum circumscribed geometric figure is determined as the administrative boundary road, or the administrative boundary road is determined from the roads corresponding to the overlapping first minimum circumscribed geometric figure.

2. The method for identifying administrative boundary roads according to claim 1, characterized in that: Determining the administrative division boundary road from the roads corresponding to the first minimum circumscribed geometric figures that overlap, including: Determine whether there is at least one separating axis between the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure, wherein the separating axis is a straight line or a plane perpendicular to the first minimum circumscribed geometric figure and the second minimum circumscribed geometric figure; The following processing is performed for each separation axis: determining a first projection of the first minimum circumscribed geometric figure on the separation axis and determining a second projection of the second minimum circumscribed geometric figure on the separation axis; determining whether the first projection overlaps with the second projection; When the first projection determined by each separation axis overlaps with the second projection, the road corresponding to the first projection that overlaps with the second projection is determined as an administrative division boundary road.

3. The method for identifying administrative boundary roads according to claim 1, characterized in that: For each of the first geometric shapes of the roads, generating a buffer zone including the first geometric shape, including: Based on the first geometric shapes of the roads, a buffer zone including the first geometric shapes is generated according to the road scene with a first radius, where the first radius is determined based on the error.

4. The method for identifying administrative division boundary roads according to any one of claims 1 to 3, characterized in that: After determining the administrative boundary roads, it also includes: Obtain a dataset of suspected broken roads; According to the administrative division boundary roads, the dead-end roads are determined from the suspected dead-end road data set.

5. The method for identifying administrative division boundary roads according to claim 4, characterized in that: Determining the dead-end road from the suspected dead-end road data set according to the administrative boundary road includes: Obtaining a broken road dataset according to a difference set between the suspected broken road dataset and the administrative division boundary roads; For a breakpoint in the breakpoint road data set, generating a buffer zone including the breakpoint with a second radius; The broken road is determined based on the buffer zone generated based on the broken point.

6. The method for identifying administrative division boundary roads according to claim 5, characterized in that: Based on the buffer zone generated by the break point, the break road is determined, including: When the buffer zone generated by the dead-end point and the low-level road set in the suspected dead-end road data set have an intersection, determining that the road corresponding to the dead-end point is a non-dead-end road; The dead-end road is determined according to the difference set between the dead-end road data set and the non-dead-end road.

7. A method for constructing an electronic map, characterized in that: include: Processing a road dataset by the administrative division boundary road recognition method according to any one of claims 1 to 6 to obtain administrative division boundary roads in the road dataset; The electronic map is updated according to the administrative boundary roads.

8. An administrative division boundary road recognition device, characterized in that: include: A determination module, configured to determine a first geometric shape of each road in the at least one road according to a boundary line of the at least one road in the road data set; A generating module, for generating a buffer zone including the first geometric shape for each road, wherein the buffer zone is determined based on an error between an endpoint of the administrative division boundary road and the administrative division boundary; an identification module, for identifying an administrative division boundary road in at least one road according to the overlap degree between the boundary line of at least one administrative division and each buffer zone in the road data set; The identification module is specifically used for: Determine the first minimum circumscribed geometry of each buffer zone; Determine the second smallest circumscribed geometric figure of each boundary line; When the first minimum circumscribed geometric figure overlaps with the second minimum circumscribed geometric figure, the road corresponding to the first minimum circumscribed geometric figure that overlaps with the second minimum circumscribed geometric figure is determined as the administrative boundary road, or the administrative boundary road is determined from the roads corresponding to the overlapping first minimum circumscribed geometric figure.

9. An electronic device, characterized in that: include: Memory, processor; The memory stores computer-executable instructions; The processor executes the computer-executable instructions stored in the memory, so that the processor performs the method according to any one of claims 1-6 or 7.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer-executable instructions, which are used to implement the method according to any one of claims 1 to 6 or 7 when executed by a processor.

11. A computer program product, comprising a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 6 or 7 is implemented.

Images