Intersection surface generation method, device, equipment, and program

The method generates intersection surfaces for complex node intersections by integrating enveloping surfaces with road surfaces, addressing the limitations of existing technologies that rely on extensive data and costly route information, achieving efficient and robust results.

JP2024544649AActive Publication Date: 2024-12-03TENCENT TECHNOLOGY (SHENZHEN) CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
JP2024532544
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2022-08-19
Filing Date
2023-07-04
Publication Date
2024-12-03
Estimated Expiration
2043-07-04

AI Technical Summary

Technical Problem

Current technologies face challenges in generating intersection surfaces for complex node intersections due to the reliance on extensive original data, including route instruction information, which is costly and has limited coverage, making it difficult to automate the process over a wide area.

Method used

A method and device for generating intersection surfaces by determining a compound node intersection, obtaining a road surface, and integrating an enveloping surface with the road surface using intersection information from individual node intersections, without requiring complex calculation policies.

Benefits of technology

Enables efficient and high-quality generation of intersection surfaces for complex node intersections using minimal original data, ensuring robustness and avoiding extreme cases.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024544649000001_ABST
    Figure 2024544649000001_ABST
Patent Text Reader

Abstract

A method for generating an intersection surface includes the steps of: determining a complex node intersection based on road network data, where the complex node intersection includes at least two single-node intersections (202); obtaining a road surface of the complex node intersection based on intersection information of the complex node intersection (204); determining an intersection surface of each single-node intersection in the at least two single-node intersections (206); generating an enclosing surface of the complex node intersection based on the intersection surface of each single-node intersection (208); and integrating the enclosing surface with the road surface to obtain the intersection surface of the complex node intersection (210).
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] (CROSS-REFERENCE TO RELATED APPLICATIONS) This application claims priority to a Chinese patent application filed with the China Patent Office on August 19, 2022, bearing application number 202210998820.9 and entitled "Method, apparatus, device, storage medium and program product for generating intersection surface," the entire contents of which are incorporated herein by reference.

[0002] The present application relates to the technical field of Internet, and in particular to a method, an apparatus, a computer device, a storage medium and a computer program product for generating an intersection surface. [Background technology]

[0003] With the rapid development of computer and Internet technologies, a growing number of virtual map products have emerged to simulate urban road conditions, including high-precision lane-level maps, general maps, and urban road models, bringing convenience to people's daily lives.

[0004] In some cases, it is necessary to generate road elements using original road network data, and especially in some areas, when high-precision map data is lacking, some road elements need to be generated based on general maps, so that the effect close to that of high-precision maps can be obtained even in areas without high-precision map data. In areas where high-precision map data is lacking, intersection surfaces are one of the road elements required to generate a virtual map.

[0005] Currently, in order to generate an intersection surface of a complex node intersection, not only road shape data and road topology data but also route indication information is required. However, the collection cost of route indication information is high, it has a certain aging, and the coverage is limited. In other words, the related technology not only needs to rely on a lot of original data, but also has low robustness and high cost, making it difficult to automatically generate the intersection surface of a complex node intersection in a wide range. Summary of the Invention [Means for solving the problem]

[0006] In a first aspect, the present application provides a method for generating an intersection surface, the method comprising: determining a complex node intersection based on road network data, the complex node intersection including at least two single-node intersections; obtaining a road surface of the composite node intersection based on intersection information of the composite node intersection; determining an intersection plane of each of the single-node intersections in the at least two single-node intersections respectively; generating an enclosing surface of the complex node junction based on the junction surface of each of the single node junctions; and integrating the surrounding surface with the road surface to obtain an intersection surface of the composite node intersection.

[0007] In a second aspect, the present application further provides an apparatus for generating an intersection surface, the apparatus comprising: a determination module configured to determine a complex node intersection based on road network data, the complex node intersection including at least two single-node intersections; a road surface generation module configured to obtain a road surface of the composite node intersection based on intersection information of the composite node intersection; a single-node intersection surface generation module configured to respectively determine an intersection surface of each of the single-node intersections in the at least two single-node intersections; an enclosing surface generation module configured to generate an enclosing surface of the composite node junction based on the junction surface of each of the single-node junctions; and a merging module configured to merge the enclosing surface with the road surface to obtain an intersection surface of the composite node intersection.

[0008] In a third aspect, the present application further provides a computing device, comprising a memory and a processor, the memory storing computer readable stored instructions, the processor, when executing the computer readable stored instructions, performing the following steps: determining a complex node intersection based on road network data, the complex node intersection including at least two single-node intersections; obtaining a road surface of the composite node intersection based on intersection information of the composite node intersection; determining an intersection plane of each of the single-node intersections in the at least two single-node intersections respectively; generating an enclosing surface of the complex node junction based on the junction surface of each of the single node junctions; integrating the surrounding surface with the road surface to obtain an intersection surface of the composite node intersection.

[0009] In a fourth aspect, the present application further provides a computer-readable storage medium having stored thereon computer-readable instructions which, when executed by a processor, perform the following steps: determining a complex node intersection based on road network data, the complex node intersection including at least two single-node intersections; obtaining a road surface of the composite node intersection based on intersection information of the composite node intersection; determining an intersection plane of each of the single-node intersections in the at least two single-node intersections respectively; generating an enclosing surface of the complex node junction based on the junction surface of each of the single node junctions; integrating the surrounding surface with the road surface to obtain an intersection surface of the composite node intersection.

[0010] In a fifth aspect, the present application further provides a computer program product, the computer program product comprising computer readable stored instructions which, when executed by a processor, perform the following steps: determining a complex node intersection based on road network data, the complex node intersection including at least two single-node intersections; obtaining a road surface of the composite node intersection based on intersection information of the composite node intersection; determining an intersection plane of each of the single-node intersections in the at least two single-node intersections respectively; generating an enclosing surface of the complex node junction based on the junction surface of each of the single node junctions; integrating the surrounding surface with the road surface to obtain an intersection surface of the composite node intersection. [Brief description of the drawings]

[0011] [Figure 1] FIG. 2 is a diagram illustrating an application environment of a method for generating an intersection surface in an embodiment. [Diagram 2] 1 is a flowchart of a method for generating an intersection surface in one embodiment. [Diagram 3] FIG. 2 is a schematic diagram of a single node intersection in one embodiment. [Figure 4] FIG. 2 is a schematic diagram of a complex node intersection in one embodiment. [Diagram 5] FIG. 13 is an exemplary effect diagram of a road surface at a complex node intersection in one embodiment. [Figure 6] 4A-4C are schematic diagrams of intersection surfaces of each single node in one embodiment. [Figure 7] FIG. 2 is a schematic diagram of an enclosing surface of a complex node intersection in one embodiment. [Figure 8] FIG. 13 is a schematic diagram of an enclosing surface of a complex node intersection in another embodiment. [Figure 9] FIG. 13 is a schematic diagram of an enclosing surface of a complex node intersection in yet another embodiment. [Figure 10] 1 is an exemplary effect diagram of an enclosure surface and a road surface in one embodiment. [Figure 11] FIG. 2 is a schematic diagram of trim points on an enclosing surface in one embodiment. [Figure 12] FIG. 2 is a schematic diagram of an intersection surface of an irregularly shaped composite node intersection in one embodiment. [Figure 13] 13 is a flowchart for reordering trim points on an enclosing surface in one embodiment. [Figure 14] FIG. 13 is a schematic diagram showing the effect of smoothly connecting trim points in one embodiment. [Figure 15] FIG. 2 is a schematic diagram showing smoothing connection of Bezier curves in an embodiment. [Figure 16] 1 is a schematic diagram of an intersection surface of a composite node intersection generated in one embodiment. FIG. [Figure 17] FIG. 2 is a schematic diagram of a road surface at a single node intersection in one embodiment. [Figure 18] FIG. 2 is a schematic diagram of crossing tangents of a road in one embodiment. [Figure 19] 11A and 11B are schematic diagrams showing an example in which tangents do not intersect with each other or intersect at tangent end points in an embodiment. [Figure 20] 13 is a flow chart for generating an enclosing surface in accordance with certain embodiments; [Figure 21] FIG. 2 is a schematic diagram showing the configuration of an intersection surface generation device in one embodiment. [Figure 22] FIG. 1 is a schematic diagram showing the internal structure of a computer device according to an embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] In order to more clearly describe the technical solutions of the embodiments of the present application, the drawings used in the description of the embodiments are briefly introduced above. Obviously, the above drawings are only some embodiments of the present application, and those skilled in the art can also obtain other related drawings based on these drawings without any creative efforts.

[0013] In order to more clearly describe the objectives, technical solutions and advantages of the present application, the present application is described in detail below with reference to the drawings. It should be understood that the specific embodiments described herein are only used to describe the present application, and are not intended to limit the present application.

[0014] The intersection surface generation method provided by the embodiment of the present application can be applied to various virtual map products such as high-precision virtual maps, normal-precision maps, and urban road models, and can be used to visually display road areas including multiple intersections. The intersection surface generation method can be understood as a process of compiling original map data, that is, a process of processing and processing the original map data as a link between the top and bottom to generate more compact and more user-friendly files and data. The data obtained by the compilation can be used for calling upper layers (map navigation, positioning technology, map rendering, etc.). Exemplarily, the intersection surface data of the generated composite node intersection can provide the navigation engine with base map data at the intersection to enhance the visual effect of the navigation interface, and can provide data support to subjects such as the driver when making decisions at an intersection during autonomous driving or when making driving decisions using an electronic map, preventing the vehicle from deviating outside the intersection range and reducing accidents at the intersection, thereby reducing the probability of accidents occurring and improving the safety of autonomous driving.

[0015] In the intersection surface generation method provided by the present application, the intersection surface of a single-node intersection and the road surface and intersection surface of a multi-node intersection can be generated according to the road network data on the electronic map. In some examples, the intelligent transportation system can be used to provide an intelligent navigation route service to a driving subject such as a driver based on the position information, contour, etc. of the intersection surface. Or, the terminal device can use computer vision technology, etc. to display a high-precision three-dimensional image corresponding to the intersection surface more realistically and clearly on the navigation application page or the map page.

[0016] Currently, lane-level navigation mainly uses high-precision map data (with accuracy at the decimeter or centimeter level), but the coverage area of ​​high-precision maps is limited; for example, in some cities, high-precision map data is only available in areas outside the Circular Route 5, and there is no high-precision map data in areas inside the Circular Route 5. In order to achieve the effect of a high-precision map in areas without high-precision map data, the algorithm needs to generate road elements based on standard-precision maps (normal navigation maps, with accuracy at the 10m level), and the intersection surface data of the composite node needs to be generated as one of the road elements based on the original road network data.

[0017] In the related art, the method for generating the intersection surface of a complex node has the main drawback of relying on a lot of original data. In addition to the road shape and road topology data, route indication information (such as turning left, turning right, and going straight) is also required. However, the collection cost of the route indication information is high, it has a certain aging, and the coverage is limited, and some intersections cannot even obtain the corresponding route indication information. Therefore, the related art has poor robustness, that is, poor performance against interference. In addition, human intervention is required in some special cases, which is costly, and the intersection surface of a complex node intersection cannot be automatically generated in a wide range.

[0018] Based on this, in order to solve the above technical problems, the embodiment of the present application provides a method for generating an intersection surface. For a complex node intersection including at least two single-node intersections, obtain a road surface of the complex node intersection based on the intersection information of the complex node intersection, generate an enclosing surface of the complex node intersection based on the intersection surface of each single-node intersection included, and then integrate the enclosing surface into the road surface to obtain the intersection surface of the complex node intersection. On the premise of relying on a small amount of original data, the intersection surface of the complex node intersection can be generated simply, efficiently and with high quality, without the need to introduce a complex calculation policy, and can avoid extreme cases, and is highly robust.

[0019] The intersection surface generation method provided by the embodiment of the present application can be applied to the application environment shown in Fig. 1. Here, the terminal 102 communicates with the server 104 through a network. The data storage system can store data processed by the server 104, such as original road network data of each of a plurality of single-node intersections included in the complex node intersection, where the road network data includes information such as roads connected to the single-node intersection, road grades, road widths, and the number of lanes, and these road network data can be used to generate the intersection surface of the complex node intersection. The data storage system may be integrated into the server 104 or may be located in a cloud or other server.

[0020] In one embodiment, the server 104 can implement the intersection surface generation method of the present application, in which the server 104 determines a complex node intersection, the complex node intersection including at least two single-node intersections, obtains a road surface of the complex node intersection based on the intersection information of the complex node intersection, and respectively determines the intersection surface of each single-node intersection in the at least two single-node intersections. Then, the server 104 generates an enclosing surface of the complex node intersection based on the intersection surface of each single-node intersection, and integrates the enclosing surface with the road surface to obtain the intersection surface of the complex node intersection. In some embodiments, the terminal 102 can call the intersection surface of the complex node intersection generated by the server 104 (the boundary of the intersection surface corresponds to a point sequence, i.e., a series of point coordinates), and render and display the intersection surface on a virtual map.

[0021] In some embodiments, the terminal 102 may have an application supporting a map service installed and executed, the server 104 may be a server providing services to the application, and the terminal 102 realizes interaction with the server 104 based on the application. The application may be a map application, a navigation application, a positioning application, or any application that supports intersection display, such as a traffic transportation application, a game application that requires calling and displaying road intersections. It can be understood that in some embodiments, the intersection surface of the composite node may be generated by the terminal, and the embodiment of the present application does not limit the execution entity for generating the intersection surface.

[0022] Here, the terminal 102 may be, but is not limited to, various personal computers, notebook computers, smartphones, tablets, IoT devices, and portable wearable devices. The IoT devices may be smart speakers, smart TVs, smart air conditioners, smart in-vehicle devices, etc., the smart in-vehicle devices may be in-vehicle navigation terminals, in-vehicle computers, etc., and the portable wearable devices may be smart watches, smart bracelets, headset devices, etc. The server 104 may be an independent physical server, a server cluster or a distributed system composed of multiple physical servers, or a cloud server providing basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDNs), big data, and artificial intelligence platforms.

[0023] In one embodiment, a method for generating an intersection surface is provided, as shown in Fig. 2. The method is illustrated by taking as an example the case where it is applied to a computer device (such as the server 104) shown in Fig. 1, and the method includes the following steps:

[0024] In step 202, a complex node intersection is determined based on the road network data, where the complex node intersection includes at least two single-node intersections.

[0025] Road network data of a map is data for describing complex roads. An intersection is a road element formed by the intersection of at least two roads, and in road network data of a map, an intersection can be represented by at least one node. In a general map, a road is generally represented by a line segment with no width (hereinafter referred to as a link), which is a "linear" road, and each line segment is represented by a plurality of discrete position points arranged in sequence, and one position point is one coordinate such as a latitude and longitude coordinate. At least two line segments (links) intersect to form a node. That is, an end point where at least two line segments intersect is represented as one node, and the node represents an intersection formed by the intersection of roads represented by the at least two line segments. Depending on the number of nodes included, an intersection is divided into a single-node intersection and a complex-node intersection. A single-node intersection refers to an intersection represented by a single node, and a complex-node intersection refers to an intersection represented by multiple nodes, i.e., a "large intersection."

[0026] As shown in Fig. 3, Fig. 3 is a schematic diagram of a single-node intersection in one embodiment. As shown in Fig. 3, at the single-node intersection, four roads, road 1 (link1) to road 4 (link4), join together to form one single-node intersection A.

[0027] As shown in Figure 4, Figure 4 is a schematic diagram of a complex node intersection in one embodiment. As shown in Figure 4, the complex node intersection includes four single-node intersections, and each single-node intersection also has four roads that merge to form one single-node intersection. Therefore, the complex node intersection includes a total of 12 roads (the above-mentioned links).

[0028] It can be understood that the number of roads merging into each single-node intersection is at least two, and may be three, four, six, ten, etc., and is not particularly limited by the present application. The number of single-node intersections included in each composite node intersection is at least two, and may be three, four, five, etc., and is not particularly limited by the present application. Furthermore, the single-node intersections and composite node intersections shown in Figures 3 and 4 do not necessarily have roads that are orthogonal to each other. In practical applications, they may be orthogonal to each other, and is not particularly limited by the present application.

[0029] The computer device can determine a complex node intersection for which an intersection surface is to be generated from the map data, and the complex node intersection may be a complex node intersection for which high-precision data is lacking in a high-precision map, or a complex node intersection for which an intersection surface is to be generated in a normal-precision map. The computer device can obtain known map road network data, and obtain road network data for each single-node intersection from the map road network data, and when the road network data of each of at least two single-node intersections includes the same complex node intersection mark, it represents that the at least two single-node intersections form the same complex node intersection, and the road network data for the complex node intersection can be obtained by the road network data of these single-node intersections, so that the computer device can determine one complex node intersection. The road network data for each single-node intersection may include road network data for at least two roads connected to the single-node intersection, and may include an intersection mark of the complex node intersection located therein. The road network data for each road may include a string of coordinate data (a sequence of points), i.e. a series of discrete location points of that road, and may include intersection marks of the single-node intersections to which it is connected, and may include road attributes of that road, e.g. road width, road class, road name, number of road lanes, etc.

[0030] In step 204, the road surface of the complex node intersection is obtained based on the intersection information of the complex node intersection.

[0031] The intersection information of a complex node intersection includes intersection information of single-node intersections included in the complex node, for example, which single-node intersections are included in the complex node intersection, and the intersection information of a complex node intersection further includes intersection information of each single-node intersection included therein, and the intersection information of each single-node intersection also includes road information of roads connected to the single-node intersection, and the road information includes, but is not limited to, road class, number of lanes, etc. The road surface is a "surface-like" road obtained by widening a "linear" road included in a complex node intersection, and is essentially data of the lines of two sides of the road, that is, the road surface of the road can be drawn based on the lines of two sides of the road.

[0032] For the complex node intersection for which an intersection surface is to be generated, the computer device can obtain corresponding intersection information, thereby determining the single-node intersections contained in the complex node intersection, the roads merging into each single-node intersection, and the road information of each road, etc. To obtain the intersection surface of the complex node intersection, the computer device first needs to generate a road surface of the complex node intersection, which is generated based on the road surfaces of each road contained in the complex node intersection. The road surface of the complex node intersection may be a set formed by the road surfaces of each road contained in it.

[0033] As mentioned above, in the original road network data of the map, each road is usually represented by a line segment with no width, and is a "linear" road. To generate a road surface of a complex node intersection, the computer device needs to widen the line segment with no width into a road surface having a certain width. The widening can be based on road information of the road, such as road class, number of lanes, etc., the lane class can be, for example, a trunk road, a secondary road, a branch road, etc., and the lane class can be, for example, a first-class expressway, a second-class expressway, a third-class expressway, a fourth-class expressway, etc. Roads with different road information correspond to different widening widths, and the computer device widens each road into the corresponding road surface according to the road width. In some embodiments, the road information of a road may directly include the corresponding road width, and the computer device widens each road into the corresponding road surface according to the road width. In some embodiments, the road width of each road may take the same value. It can be understood that the road surface formed after each road is widened includes a left side line and a right side line of the road surface, and the road width for widening the road can be the road width on one side or the common road width on both sides, and the road widths on both sides can be the same or different.

[0034] In one embodiment, step 204 includes the steps of obtaining road network data for each single-node intersection included in the composite node intersection; determining at least two roads connected to each single-node intersection based on the road network data to obtain a plurality of roads included in the composite node intersection; obtaining corresponding road information for each road, the corresponding road information including at least one of a road class, a number of lanes, and a lane width; determining a road width corresponding to each road based on the road information, and widening each road according to the respective road width to obtain a road surface of the road; and obtaining a road surface of the composite node intersection based on the road surface of each road.

[0035] In this embodiment, based only on the road information of the roads included in the complex node intersection, narrow roads can be widened to obtain the corresponding road surface, and the road surface of the complex node intersection can be generated simply and efficiently without relying on other additional data or complex policies.

[0036] As shown in Fig. 5, Fig. 5 is an exemplary effect diagram of a road surface of a complex node intersection in one embodiment. Referring to Fig. 5, according to the road attribute information of each road (link) included in the complex node intersection shown in Fig. 4, each road is widened on both sides according to the corresponding road width to form the road surface of the complex node intersection.

[0037] In step 206, an intersection plane of each single-node intersection in the at least two single-node intersections is determined respectively.

[0038] As described above, each single-node intersection is a node formed by the merging of at least two line segments (links), and the node represents one single-node intersection. In this way, the single-node intersection is "point-like" data. To obtain the intersection surface of the complex node intersection, the computer device must first generate the intersection surface of each single-node intersection included in the complex node intersection, and extend the "point-like" data to "surface-like" data. The embodiment of the present application does not limit the method or specific algorithm for generating the intersection surface of each single-node intersection.

[0039] For example, in some embodiments, after obtaining the road surface of the composite node, for the road surface of each single-node intersection therein, the computing device extends outward from each single-node intersection along the road surface of each road a fixed offset distance to obtain a perpendicular line to the road surface (also called a tangent line to the road surface), and connects the perpendicular lines on the road surface of each road to form a closed shape as the intersection surface of the single-node intersection.

[0040] For example, in some embodiments, the computing device may further determine the intersection points of the tangent lines with the lines of the edges on both sides of the road surface, and based on the intersection points on the road surface of each road, determine a smallest convex polygon as the intersection surface of the single-node intersection.

[0041] In the above method, since the offset distance is specified, in some cases, the shape of the intersection surface may be abnormal and may not fit the actual situation. Therefore, in order to make the shape of the intersection surface of each single node match the actual situation and realistically reflect the actual situation of the intersection, the computer device may constrain the tangents of each road connected to the single node intersection, that is, (1) the tangents are perpendicular to the road surface, and (2) the tangents do not intersect with each other or intersect only at the tangent end points. In addition, on the premise that the above constraints are satisfied, the area of ​​the intersection surface of the single node intersection may be constrained to be as small as possible. The computer device may employ any algorithm or policy to realize the above constraints to ensure that the shape of the intersection surface of the single node matches the actual situation, and the embodiment of the present application is not limited thereto. A specific embodiment will be described in detail later.

[0042] As shown in Fig. 6, Fig. 6 is a schematic diagram of the intersection surface of each single node in the composite node intersection generated in one embodiment. Referring to Fig. 6, for the four single nodes included in the composite node intersection shown in Fig. 4, the computer device generates the intersection surface of each single node respectively.

[0043] In step 208, an enclosing surface of the complex node junction is generated based on the junction surface of each single node junction.

[0044] Here, the enclosing surface is a closed shape formed by the edge lines of the intersection surface of the complex node intersection, and the edge lines of the intersection surface are represented by a series of ordered discrete position points, and these discrete ordered position points can be used to draw the edge lines of the intersection surface of the complex node intersection. Specifically, after obtaining the intersection surface of each single-node intersection included in the complex node intersection, the computer device generates an enclosing surface based on the intersection surface of each single-node intersection, and the enclosing surface can enclose the intersection surface of each single-node intersection. Exemplarily, the enclosing surface is a convex hull with a minimum area that encloses the intersection surface of each single-node intersection, that is, a convex hull intersection surface. Exemplarily, the enclosing surface is a convex hull with a minimum area that encloses the intersection surface of each single-node intersection, and each boundary line of the convex hull is perpendicular to the corresponding road surface. Exemplarily, the enclosing surface is a maximum irregular shape formed by all shape points of the intersection surface of each single-node intersection. The enclosing surface is essentially a sequence of data points that is continuous, ordered, and capable of forming a closed shape.

[0045] In one embodiment, the step of generating an enclosing surface of the complex node intersection based on the intersection surface of each single-node intersection includes the steps of obtaining a first shape point set based on shape points included in the intersection surface of each single-node intersection, and calculating, based on the first shape point set, a smallest convex polygon that encloses all shape points in the first shape point set to be the enclosing surface of the complex node intersection.

[0046] Here, as described above, the intersection surface of each single-node intersection is a closed shape, the closed shape is formed by a plurality of shape points, and it can be understood that the shape points are bending points on the boundary of the closed shape. After determining the intersection surface of each single-node intersection included in the complex node intersection, the computer device collects the shape points of the intersection surface of each single-node intersection to obtain a first shape point set, and then the computer device calculates a smallest convex polygon that encloses all shape points in the first shape point set, and the smallest convex polygon is an enclosing surface of the complex node intersection.

[0047] As shown in Fig. 7, Fig. 7 is a schematic diagram of an enclosing surface of a complex node intersection in an embodiment. Referring to Fig. 7, the complex node intersection includes four single-node intersections, and the smallest convex polygon including all shape points of these four single-node intersections is the enclosing surface of the complex node intersection.

[0048] In one embodiment, if it is desired that the boundaries of the intersection surface of the finally generated complex node intersection are all perpendicular to the road surface, the computer device can also extend the smallest convex polygon outward so that the boundaries are all perpendicular to the road surface of each road, to obtain an enclosing surface of the complex node intersection. After obtaining the enclosing surface, the subsequent enclosing surface is integrated into the road surface of the complex node intersection based on the enclosing surface to obtain the intersection surface of the complex node intersection. As shown in Figure 8, Figure 8 is a schematic diagram of the enclosing surface of a complex node intersection in one embodiment, and the boundaries corresponding to the enclosing surface are all perpendicular to the road surface of each road.

[0049] In some embodiments, the computer device determines the maximum irregular shape that can be formed by the shape points of the intersection surface of each single-node intersection, as the surrounding surface of the complex node intersection, and then integrates the subsequent surrounding surface into the road surface of the complex node intersection based on the surrounding surface to obtain the intersection surface of the complex node intersection. As shown in Figure 9, Figure 9 is a schematic diagram of the surrounding surface of a complex node intersection in another embodiment, where the surrounding surface is an irregular shape and has an abnormal shape.

[0050] The above embodiment is based on the method of enclosing the intersection surface of the included single-node intersection, has strong versatility and universality, and can generate the initial form of the intersection surface of the complex node intersection simply and efficiently, without relying on other extra data or complex policies.

[0051] In step 210, the enclosing surface is merged with the road surface to obtain the intersection surface of the complex node intersection.

[0052] In this embodiment, in order to obtain an intersection surface that is more suitable for the actual state of the intersection, the computer device uses the road surface of the road corresponding to the complex node intersection to perform further processing on the enclosing surface, i.e., integrates the enclosing surface into the road surface to obtain the intersection surface of the complex node intersection. Specifically, the computer device further "trimming" the enclosing surface to make the boundary line of the intersection more accurate, smooth, and natural, so that the intersection surface of the complex node intersection that is finally suitable for the actual road state can be obtained. Therefore, "trimming" in the embodiment of the present application means that the enclosing surface of the complex node intersection obtained in the above step is further processed to obtain an enclosing surface that is suitable for the actual road state, which can be used as the intersection surface of the complex node intersection. Of course, in some embodiments, the computer device can also use the enclosing surface obtained in the previous step 208 as the intersection surface generated for the complex node intersection.

[0053] As shown in Fig. 10, Fig. 10 is an exemplary effect diagram of the enclosing surface and the road surface in one embodiment, which shows that the current enclosing surface does not match well with the multiple roads included in the complex node intersection, and the enclosing surface exceeds the range of the road surface, so the accuracy of the generated intersection surface is low.

[0054] This allows the computing device to be further trimmed relative to the enclosure surface.

[0055] The computer device can first determine a trim point, and in this embodiment, the trim point can be the intersection point between the boundary line corresponding to the enclosing surface of the complex node intersection and the edge line of the road surface of the road included in the complex node. As shown in Figure 11, Figure 11 is a schematic diagram of the trim points on the boundary line corresponding to the enclosing surface in one embodiment. Referring to Figure 11, the white points in the figure are trim points.

[0056] In one embodiment, step 210 may be a step of determining the edge lines of the road surface of each road included in the road surface of the complex node intersection, determining the intersection points between the boundary line of the enclosing surface of the complex node intersection and the edge lines of the road surface to obtain a trim point set formed by the trim points of the enclosing surface, determining each two adjacent trim points in the trim point set, and connecting each two adjacent trim points with a straight line to obtain the intersection surface of the complex node intersection. As shown in Figure 12, Figure 12 is a schematic diagram of the intersection surface of an irregular-shaped complex node intersection in one embodiment.

[0057] In one embodiment, step 210 may further include determining the edge lines of the road surface of each road included in the road surface of the composite node intersection, determining the intersection points between the boundary lines corresponding to the enclosing surface of the composite node intersection and the edge lines of the road surface to obtain a trim point set formed by the trim points of the enclosing surface, determining each two adjacent trim points in the trim point set, and performing a smoothing process between each two adjacent trim points on the enclosing surface to obtain the intersection surface of the composite node intersection.

[0058] Here, the side lines of the road surface of each road included in the road surface of the complex node intersection include the left side line of the road surface of each road and the right side line of the road surface of each road, and the boundary line corresponding to the enclosing surface of the complex node intersection is also the enclosing line of the enclosing surface. The computer device can determine a trim point set formed by the trim points of the enclosing surface based on the intersection of the point sequence representing the enclosing line and the point sequence representing the side lines of the road surface of each road, which is denoted as trimPoints.

[0059] For each two adjacent trim points on the enclosing surface, adjacent means that the front-back order of the two trim points is adjacent on the boundary of the enclosing surface. In order to perform connection smoothing for two adjacent trim points, the front-back order of the trim points needs to be determined, and each two adjacent trim points in the trim point set are determined by reordering the trim points.

[0060] In one embodiment, the step of determining each two adjacent trim points in the trim point set includes the steps of determining a second shape point set formed by shape points of an enclosing surface, where the shape points have a front-to-back order; for each trim point in the trim point set, calculating a left-side shape point and a right-side shape point of the trim point in the second shape point set; and for each trim point in the trim point set, ordering according to the front-to-back order of a corresponding target shape point, and determining each two adjacent trim points in the trim point set based on the ordering results, where the target shape point is a left-side shape point or a right-side shape point.

[0061] An enclosing surface is a closed shape formed by a plurality of shape points, and the shape points of the enclosing surface are break points such as A, B, and C shown in Fig. 10 on the boundary line corresponding to the enclosing surface. These break points have a front-to-back order on the boundary line, and the front-to-back order may be a clockwise order formed with a certain break point as a starting point, or a counterclockwise order formed with a certain break point as a starting point. A second shape point set formed by these shape points can be represented as basePoints.

[0062] For each trim point in the trim point set, the computer device determines the left neighboring shape point p1 and the right neighboring shape point p2 of each trim point in the second shape point set. That is, by determining between which two neighboring points (p1, p2) in the second shape point set the trim point is located, the trim point can be reordered according to the front-to-back order of p1 on the boundary line corresponding to the enclosing surface (which can be determined by the index) or the front-to-back order of p2 on the boundary line corresponding to the enclosing surface.

[0063] As shown in Figure 13, Figure 13 is a flow chart of reordering trim points on an enclosing surface in one embodiment. Referring to Figure 13, the step of reordering trim points includes the following steps:

[0064] In step 1302, a set of trim points trimPoints and a set of second shape points basePoints are determined.

[0065] In step 1304, for each trim point in trimPoints, determine between which two neighboring points (p1, p2) in the second shape point set the trim point is located, and denote the index of p1 or p2 on the boundary of the enclosing surface as index.

[0066] It can be understood that the trim point is determined between which two neighboring points (p1, p2) in the second shape point set, and then a 2-dimensional tuple of trim points may be obtained according to the index of p1 on the boundary of the enclosing surface uniformly, and a 22-dimensional tuple of trim points may be obtained according to the index of p2 on the boundary of the enclosing surface uniformly. The corresponding indexes of the two trim points may match, and if they match, the distances between the two points and the shape points basePoints(index) corresponding to the indices are compared and reordered; if they do not match, the sizes of the indices are directly compared and ordered according to the size of the index.

[0067] In step 1306, the trim point point is recorded as a two-dimensional tuple (point, index).

[0068] In step 1308, for each trim point in trimPoints, the trim points are ordered according to the index to obtain a reordered sequence of trim points.

[0069] For example, the index corresponding to each shape point in the second shape point set basePoints is determined in ascending order in the clockwise direction, and they are uniformly ordered in ascending order of the index of p1 on the boundary line of the enclosing surface. If the indexes corresponding to two trim points point are the same, the trim point that is closer to the shape point basePoints(index) corresponding to that index is ordered to a rear position, and the trim point with the greater distance is ordered to a forward position.

[0070] After obtaining the reordered trim point sequence, the computing device can determine each two adjacent trim points in the trim point set.

[0071] In one embodiment, the step of performing a smoothing process between each two adjacent trim points on the enclosing surface includes a step of connecting the two adjacent trim points with a straight line if the two adjacent trim points are located on a line of an edge of the road surface of the same road on the enclosing surface, and a step of connecting the two adjacent trim points with a smooth curve if the two adjacent trim points are located on a line of an edge of the road surface of different roads on the enclosing surface.

[0072] As shown in Fig. 14, Fig. 14 is a schematic diagram showing the effect of smoothly connecting trim points in one embodiment. Referring to Fig. 14, in Fig. 14, adjacent trim points M and N are located on the line of two sides of the road surface of the same road in the enclosing surface, in this case, the trim points M and N are directly connected by a straight line, and adjacent trim points P and Q are located on the line of two sides of the road surface of different roads in the enclosing surface, in this case, the trim points P and Q are connected by a smooth curve.

[0073] In one embodiment, the smooth curve is a Bezier curve, and the step of generating a Bezier curve between two adjacent trim points includes the steps of: extending the two adjacent trim points along the edge lines of the road surface where the trim points are located, respectively, in the direction of a single-node intersection to which the edge lines of the road surface are connected, to obtain two control points; and generating a Bezier curve based on the two adjacent trim points and the two control points.

[0074] In the embodiment of the present application, two control points are determined for two adjacent trim points located on the side line of the road surface of different roads of the enclosing surface, and a fourth-order Bezier curve is generated based on the two adjacent trim points and the two control points, so that the Bezier curve can be ensured to be tangent to the side line of the road surface where the two adjacent trim points are located, and a better connection smoothing effect can be obtained. In some embodiments, one control point may be determined between the two adjacent trim points, and a third-order Bezier curve may be generated based on the one control point and the two adjacent trim points, and three control points may be determined between the two adjacent trim points, and a fifth-order Bezier curve may be generated based on the three control points and the two adjacent trim points.

[0075] As shown in FIG. 15, FIG. 15 is a schematic diagram showing the smooth connection of Bezier curves in one embodiment. Referring to FIG. 15, the road surface edge line 1 is the edge line of one side of the road surface of road 1 (link 1), and the road surface edge line 2 is the edge line of one side of the road surface of road 2 (link 2). P1 and P2 are trim points where the composite road surface intersects with the road surface edge line 1 and the road surface edge line 2 respectively. The computer device calculates the Bezier curve between P1 and P2 by the following method, where a fourth-order Bezier curve is taken as an example, and in addition to P1 and P2, two more control points need to be calculated. The calculation method is as follows: calculate point P11 at a distance d1 along the direction of line 1 of the road surface edge from P1 to the connected single-node intersection, and calculate point P22 at a distance d2 along the direction of line 2 of the road surface edge from P2 to the connected single-node intersection; then, the computer device can calculate a sequence of points corresponding to the Bezier curve between P1 and P2 based on the trim points P1 and P2, and the control points P11 and P22, and use the sequence of points to smoothly connect P1 and P2.

[0076] As shown in Fig. 16, Fig. 16 is a schematic diagram of an intersection surface of a complex node intersection generated in an embodiment. Referring to Fig. 16, the closed irregular figure in the figure is the intersection surface of the finally generated complex node intersection, and the computer device stores the point sequence corresponding to the boundary line of the intersection surface and the intersection mark of the complex node intersection in correspondence with each other as attribute data of the complex node intersection so that other applications or interfaces can quickly use the complex node intersection when displaying and rendering the complex node intersection.

[0077] The method for generating the intersection face of each single-node intersection included in the complex node intersection will be described in detail below.

[0078] In one embodiment, in step 206, the step of respectively determining the intersection surface of each single-node intersection in the at least two single-node intersections includes the steps of: for each single-node intersection, determining at least two roads connected to the single-node intersection; obtaining a constraint condition and an objective function, where the objective function indicates a solution target for the area size of the intersection surface of the single-node intersection, the constraint condition indicates a limiting condition for the area size, the constraint condition includes a constraint relationship between offset variables of each two adjacent roads among the at least two roads, and the objective function includes at least two offset variables, each offset variable indicating a distance situation from the single-node intersection to a tangent of a corresponding road; solving the objective function based on the road surface width of each road in the at least two roads and the constraint condition to obtain the road offset distance; and generating the intersection surface of the single-node intersection based on the road surface width of the road and the road offset distance.

[0079] As shown in FIG. 17, FIG. 17 is a schematic diagram of a road surface of a single-node intersection in one embodiment. For four roads (i.e., link1 to link4) connected to the single-node intersection A, each road can be widened to a road surface having a certain width. For example, for link1, the corresponding road surface width information is the road surface width information of the sub-road surface on the left side of the link1 (i.e., the lw1 ) and the width information of the road surface of the right sub-road surface of link1 (i.e., r w1 ) for link2, the corresponding road surface width information is also the road surface width information of the sub road surface on the left side of link2 (i.e., w2 ) and the width information of the road surface of the right sub-road surface of link2 (i.e., r w2 Similarly, the width information of the road surface of link3 and the width information of the road surface of link4 can be understood by specifically referring to the width information of the road surface of link1 and link2.

[0080] For each road, if the tangents corresponding to each road intersect, an abnormality occurs in the shape of the intersection surface of the generated single-node intersection, and the actual intersection surface cannot be accurately reflected. Therefore, in order to avoid an abnormality in the shape of the intersection surface, it is necessary to prevent the tangents corresponding to each road from intersecting. Each road is perpendicular to the corresponding tangent, and the position of the tangent can be represented by the distance from the intersection point between the tangent and the link to the single-node intersection.

[0081] The distance from the intersection of the tangent and the link to the single-node intersection is called the offset distance, which will be described later in the embodiment of the present application, and whether the tangents corresponding to each road intersect depends on the offset distance of each road. If the offset distance of the road is too small, the corresponding tangents will intersect at the middle of the tangents, causing the shape of the intersection surface to become abnormal.

[0082] For example, FIG. 18 is a schematic diagram of intersecting tangents of a road provided by an embodiment of the present application. As shown in FIG. 18, a tangent of link1 (i.e., L1) intersects with a tangent of link2 (i.e., L2), and the intersection of L1 and L2 is restricted by the value of the offset variable of link1 (i.e., w1) and the value of the offset variable of the adjacent link2 (i.e., w2). Similarly, L2 intersects with a tangent of link3 (i.e., L3), and is also restricted by the value of w2 and the value of the offset variable of the adjacent link3 (i.e., w3). The case where L3 intersects with a tangent of link4 (i.e., L4) and the case where L4 intersects with L1 can also be understood with reference to the case where L1 intersects with L2 or the case where L2 intersects with L3, and will not be described in detail here. It should be understood that the road tangent intersection shown in Figure 18 is described only as an example of a situation where all four links intersect, and in actual application, a situation where only two or three of the links intersect may occur, and the present application is not specifically limited. In addition, the offset variable mentioned can be used to indicate a distance situation from a single node intersection to a corresponding road tangent, for example, a distance situation from a single node intersection A to a tangent L1 of link1. When a specific value is given to the offset variable, it can be called an offset distance.

[0083] Based on this, the value of w1 affects the value of adjacent w2, the value of w2 affects the value of adjacent w3, the value of w3 affects the value of adjacent w4, and the value of w4 affects the value of adjacent w1. Similarly, the value of w1 also affects the value of adjacent w4, the value of w4 affects the value of adjacent w3, the value of w3 affects the value of adjacent w2, and the value of w2 affects the value of adjacent w1. Obviously, no matter whether the four links of the same single-node intersection are ordered clockwise or the four links are ordered counterclockwise, the coupling relationships between the offset variables w1, w2, w3, and w4 are mutually constrained, so in the embodiment of the present application, a mathematical optimization method can be adopted to process the coupling relationships. That is, the constraint relationships between the offset variables of each road are changed into constraint equations that optimize the problem.

[0084] The computer device can establish the constraint condition based on the constraint relationship between the offset variables of each of the two adjacent roads, and determine the value of the offset variable w of each road so that the corresponding tangents L do not intersect or only intersect at the end points. The constraint relationship between the offset variables of each of the two adjacent roads can be established by the included angle information between each of the two adjacent roads. For example, the computer device can determine the included angle information between each of the two adjacent roads based on the road surface width information of each of the two adjacent roads and the offset variables of the corresponding roads, and then establish the constraint condition based on the included angle information between each of the two adjacent roads.

[0085] The constraint condition can be established by adopting the following method: the road surface of each road includes a left side line of the road surface and a right side line of the road surface, the computer device obtains an included angle between a first road and a second road, the first road and the second road are adjacent roads among at least two roads, and obtains a first included angle between the first road and the right side line of the road surface of the first road, a second included angle between the second road and the left side line of the road surface of the second road, and a third included angle between the right side line of the road surface of the first road and the left side line of the road surface of the second road, and the constraint condition can be established based on the included angle between the first road and the second road, the first included angle, the second included angle, and the third included angle.

[0086] Taking the diagram in the upper right corner of FIG. 19 as an example, link1 in FIG. 19 can be understood to be the first road, link2 can be understood to be the second road, and link1 is adjacent to link2 and connected to single-node intersection point A. The intersection point of tangent L1 and the line of the right side of the road surface of link1 is P1, and the intersection point of tangent L2 and the line of the left side of the road surface of link2 is P2. With point A as the origin, the included angle between link1 and link2, i.e., α 12Similarly, the first included angle, i.e., α1, can be obtained by calculating the included angle between link1 and P1A with point A as the origin. For example, the tangent line L1 is perpendicular to link1, and the road surface width of the right sub-road surface of link1 is r wi Therefore, the width r of the right sub-road surface of the link1 is calculated by the arctangent function. wi And process the offset variable w1 of link1,

number

number

[0087] In order for L1 and L2 to not intersect or to intersect only at their end points, the included angles α1 and α2 should satisfy:

number

number

[0088] Here, minα1 is the minimum value of the included angle P1AP2, that is, the included angle between the line on the right side of the road surface of link1 and the line on the left side of the road surface of link2. Furthermore, α1 ≧ 0. This is the constraint condition. If n (n>1) roads are connected to a single-node intersection A, n constraint conditions are constructed.

[0089] On the premise of satisfying the above-mentioned constraint condition, if it is desired that the intersection surface of the generated single-node intersection is as small as possible, the area size of the intersection surface of the single-node intersection can be taken as an objective function, and the area size can be limited by the constraint condition constructed as described above. It should be noted that the objective function includes at least two offset variables, and the constraint relationship between each offset variable can be understood with reference to the constraint condition constructed as described above. In other words, the area size of the intersection surface is influenced by the value of the offset variable of the road connected to the single-node intersection. Therefore, the expression of the size of the value of the offset variable w of the road related to the single-node intersection can be taken as the expression of the area size of the intersection surface of the single-node intersection. For example, for the single-node intersection A in FIG. 19, if the sum of squares of the offset variable w is taken as the expression of the area size of the intersection surface, the area size of the intersection surface is expressed as V=w1 2 +w2 2 +w3 2 +w4 2 where w1, w2, w3, and w4 are the offset variables of the corresponding link1, link2, link3, and link4. In addition to the sum of squares of the offset variables, the area size of the intersection plane can also be expressed using the sum of cubes of the offset variables, the sum of N (N≧2) powers, the sum of absolute values, etc. in actual applications, and is not specifically limited in the embodiments of the present application.

[0090] In this way, the objective function for the area size of the intersection surface, i.e., minV=w1 2 +w2 2 +w3 2 +w4 2 After constructing the constraint conditions and obtaining the objective function, a solution calculation is performed for the objective function based on the road surface width information of the road and the constraint conditions, and the specific values ​​of each offset variable in the objective function are calculated, that is, the offset distance of each road can be obtained.

[0091] Based on the constraint conditions and the road surface width information of the roads, the objective function can be solved based on a predetermined constraint optimization model such as an interior point method. Exemplarily, after obtaining road surface width information of each road (including road surface width information of the left sub-road surface and road surface width information of the right sub-road surface), the road surface width information of each road can be processed through the predetermined constraint optimization model to obtain a specific value of the offset variable of each road, i.e., an optimal solution of the offset distance of each road. After the offset distance of each road is calculated, the intersection surface of the single-node intersection can be generated based on the road surface width information of each road and the corresponding road offset distance.

[0092] In the above method for generating the intersection surface of a single-node intersection, it is only necessary to construct a constraint condition based on the constraint relationship between the offset variables of adjacent roads and calculate the offset distance of the road in combination with the width information of the road surface of the road, and the intersection surface of the intersection node can be efficiently generated without relying on a complex pure geometric algorithm.

[0093] As shown in Figure 20, Figure 20 is a flow chart of generating an enclosing surface in one specific embodiment. The method can be performed by a computer device, and with reference to Figure 20, includes the following steps:

[0094] In step 2002, if the road network data of each of the at least two single-node intersections includes the same composite node intersection mark, determine a composite node intersection corresponding to the composite node intersection mark formed by the at least two single-node intersections.

[0095] In step 2004, road network data for each single-node intersection included in the complex-node intersection is obtained.

[0096] In step 2006, at least two roads connected to each single-node intersection are determined based on the road network data to obtain a plurality of roads included in the complex-node intersection.

[0097] In step 2008, for each road, obtain corresponding road information, including at least one of road class, number of lanes, and lane width, determine a road width corresponding to each road based on the road information, and widen each road according to the respective road width to obtain a road surface of the road.

[0098] In step 2010, the road surface of the complex node intersection is obtained based on the road surface of each road.

[0099] In step 2012, an intersection face of each single-node intersection in the at least two single-node intersections is determined respectively.

[0100] In step 2014, a first set of shape points is obtained based on the shape points contained in the intersection plane of each single-node intersection.

[0101] In step 2016, based on the first shape point set, the smallest convex polygon that encloses all shape points in the first shape point set is calculated to obtain an enclosing surface of the complex node intersections.

[0102] In step 2018, the road surface edge lines of each road included in the road surface of the complex node intersection are determined.

[0103] In step 2020, the intersection points of the boundary line of the enclosing surface of the complex node intersection and the edge lines of the road surface are determined to obtain a set of trim points formed by the trim points of the enclosing surface.

[0104] In step 2022, a second shape point set formed by the shape points of the enclosing surface is determined, where the shape points have a front-to-back order.

[0105] In step 2024, for each trim point in the trim point set, the left and right adjacent shape points of the trim point in the second shape point set are calculated.

[0106] In step 2026, for each trim point in the trim point set, the trim points are ordered according to the front-to-back order of the corresponding target shape point, and based on the ordering result, each of the two adjacent trim points in the trim point set is determined, and the target shape point is the left adjacent shape point or the right adjacent shape point.

[0107] In step 2028, if two adjacent trim points are located on the line of the side of the road surface of the same road on the enclosing surface, the two adjacent trim points are connected by a straight line.

[0108] In step 2030, if two adjacent trim points are located on the line of the sides of the road surfaces of different roads in the enclosing surface, the two adjacent trim points are connected by a smooth curve.

[0109] In step 2032, an intersection face of the complex node intersection is obtained based on the connected trim points.

[0110] Here, in step 2030, the step of connecting two adjacent trim points with a smooth curve may include the steps of extending the two adjacent trim points along the edge lines of the road surface on which the trim points are located, in the direction of the single-node intersection to which the edge lines of the road surface are connected, to obtain two control points, and generating a Bezier curve based on the two adjacent trim points and the two control points, and connecting the two adjacent trim points using the Bezier curve.

[0111] Here, in step 2012, the step of generating an intersection surface of each single-node intersection includes the steps of: for each single-node intersection, determining at least two roads connected to the single-node intersection; determining included angle information between each two adjacent roads based on the width of the road surface of each of the two adjacent roads and the offset variable of the corresponding road, the included angle information indicating an intersection situation between tangents corresponding to each of the two adjacent roads; obtaining an included angle between a first road and a second road, the first road and the second road being adjacent roads of the at least two roads; and obtaining a first included angle between the first road and a line of a right side of the road surface of the first road, a second included angle between the second road and a line of a left side of the road surface of the second road, and a third included angle between the right side of the road surface of the first road and a line of a left side of the road surface of the second road. The method may include the steps of: obtaining an angle; constructing constraint conditions based on the included angle between the first road and the second road, the first included angle, the second included angle, and the third included angle; obtaining an objective function, where the objective function indicates a solution goal of the area size of the intersection surface of the single-node intersection, and the constraint conditions indicate limiting conditions for the area size, and the constraint conditions include a constraint relationship between the offset variables of each of two adjacent roads among the at least two roads, and the objective function includes at least two offset variables, each offset variable indicating a distance situation from the single-node intersection to a tangent of the corresponding road; solving the objective function based on the road surface width of each road in the at least two roads and the constraint conditions to obtain the road offset distance; and generating the intersection surface of the single-node intersection based on the road surface width of the road and the road offset distance.

[0112] In the above intersection surface generation method, for a composite node intersection including at least two single-node intersections, the road surface of the composite node intersection is obtained based on the intersection information of the composite node intersection, and an enclosing surface of the composite node intersection is generated based on the intersection surfaces of each single-node intersection included therein. Then, the intersection surface of the composite node intersection can be obtained simply by trimming the enclosing surface within the road surface. This allows the enclosing surface to be generated simply, efficiently and with high quality by relying only on a small amount of original data, does not require the introduction of complex calculation policies, can avoid extreme cases, and is highly robust.

[0113] The intersection surface generation method provided by the embodiment of the present application can be applied to any scene that needs to generate an intersection surface of a complex node intersection based on original road network data. For example, even in areas where corresponding high-precision data is lacking in a high-precision map, the intersection surface generation method provided by the embodiment of the present application can be used to generate corresponding intersection surfaces for complex node intersections in these areas using general map data. For example, the intersection surface of a complex node intersection can be efficiently generated by relying only on the original general map data, and there is no need to rely on other route indication information. For example, after the intersection surface of the generated complex node intersection is called into a map application, it can be rendered directly based on the point sequence data of the intersection surface to display the intersection surface. For example, in a game application related to an urban road model, the corresponding game screen can be rendered and displayed directly based on the point sequence data of the intersection surface in the urban road model. Of course, the application scenes are not limited to the above examples.

[0114] A detailed explanation will be given below by taking one scene as an example.

[0115] Even in an area where corresponding high-precision data is lacking in a high-precision map, the intersection surface generation method provided by the embodiments of the present application based on general map data can be adopted to solve the problem of being unable to render and display the intersection surface of the high-precision map in the above area.

[0116] The computer device preliminarily finds areas in the map where high-precision maps are lacking, for example, areas within the Circular Route No. 5 of a city, and obtains original road network data for generating a general map for each of the roads in these areas. In the road network data of the general map, the road is a line segment with no width, that is, the road is represented by a set of data points (link), and the set of data points is also called a point string. The road network data of the road also includes road information. If the road network data of multiple roads contain the same single-point intersection mark, the multiple roads form one single-node intersection. For each single-node intersection, the computer device can generate an intersection surface of the single-node intersection, and the generation of the intersection surface is for generating coordinates of the shape points of the road, and the intersection surface of the single-node intersection is actually represented by a set of data points, each data point is a coordinate, and the set of data points can form a closed polygon. For the single-node intersections in these areas, the computer device can generate a corresponding intersection surface. The generation of the intersection surface is mainly for generating coordinates of the shape points of the boundary of the intersection surface. In high precision maps, the coordinates of these boundary shape points are generally taken directly from the original data provided at a higher level.

[0117] When the road network data of a plurality of single-node intersections includes the same composite node intersection mark, the plurality of single-node intersections form one composite node intersection. For such a composite node intersection, the computer device can generate a corresponding intersection surface, specifically including the steps of determining a plurality of single-node intersections included in the composite node intersection, and for each single-node intersection, determining at least two roads connected to the single-node intersection based on the corresponding road network data. In this way, a plurality of roads included in the composite node intersection can be obtained. As mentioned above, a road is a line segment with no width, and for each road, the computer device can obtain corresponding road information, determine a road width corresponding to each road based on the road information, and widen each road according to the respective road width to obtain the road surface of the road, and the road surface of the road includes a line of the left side of the road surface and a line of the right side of the road surface. In this way, the road surface is represented by three line segments, namely, a set of original data points (link), point sequence data representing the line of the left side of the road surface, and point sequence data representing the line of the right side of the road surface. Then, the computer device obtains an intersection surface of each single-node intersection in the complex node intersection, the intersection surface of the single-node intersection is a set of data points, and the set of data points can form a closed polygon. The computer device calculates a minimum convex polygon that encloses the shape points according to the shape points included in the intersection surface of each single-node intersection to obtain an enclosing surface of the complex node intersection, and the intersection surface of the complex node intersection is actually a set of data points, and the set of data points can form a closed polygon. Then, the computer device determines the side lines of the road surface of each road included in the road surface of the complex node intersection, and determines a trim point set formed by trim points on the enclosing surface based on the intersection of the point sequence data representing the side lines of the road surface and the point sequence data representing the boundary line of the enclosing surface of the complex node intersection, and determines each two adjacent trim points in the trim point set by ordering the trim points according to the order of the trim points on the boundary line of the enclosing surface.Furthermore, for the trim points on the enclosing surface, the computer device connects two adjacent trim points located on the edge lines of the road surface of the same road with a straight line, and connects two adjacent trim points located on the edge lines of the road surface of different roads with a smooth curve, to obtain a final intersection surface.

[0118] For the above-mentioned areas where high-precision data is lacking, the computer device can pre-store in a map database point sequence data representing the intersection surfaces of single-node intersections, point sequence data representing the intersection surfaces of complex-node intersections, etc., and render and display high-precision maps of these areas as a complement to the high-precision map data required for these areas.

[0119] In this way, in map navigation processing, if a terminal or in-vehicle terminal is currently moving to a position near a certain composite node intersection within the above-mentioned area and it is necessary to display the intersection surface of the composite node intersection, the map application on the terminal or in-vehicle terminal can directly call up point sequence data representing the intersection surface of the composite node intersection from the map database, and efficiently render and display a high-precision map navigation screen for the current position based on the called point sequence data.

[0120] It should be understood that although the steps of the flowcharts according to the above-mentioned embodiments are shown in sequence according to the arrows, the steps are not necessarily performed in the order indicated by the arrows. Unless otherwise specified herein, the execution of the steps is not limited to a strict order, and the steps may be performed in other orders. Furthermore, at least some of the steps of the flowcharts according to the above-mentioned embodiments may include multiple steps or multiple stages, and these steps or stages are not necessarily performed simultaneously, but may be performed at different times, and the order of execution of these steps or stages is not necessarily performed sequentially, but may be alternated with other steps or at least some of the steps or stages in other steps.

[0121] Based on the same inventive concept, the embodiments of the present application further provide an intersection plane generating device for realizing the above-mentioned intersection plane generating method. Since the problem solving embodiments provided by the device are similar to those described in the above-mentioned method, the specific limitations in one or more intersection plane generating device embodiments provided below may refer to the limitations related to the above-mentioned intersection plane generating method, and will not be described again here.

[0122] In one embodiment, as shown in FIG. 21 , an intersection surface generating device 2100 is provided, which includes a determination module 2102, a road surface generating module 2104, a single-node intersection surface generating module 2106, an enclosing surface generating module 2108, and an integration module 2110.

[0123] The determining module 2102 is configured to determine a complex node intersection, the complex node intersection including at least two single node intersections; The road surface generation module 2104 is configured to obtain a road surface of the composite node intersection based on the intersection information of the composite node intersection; The single-node intersection surface generation module 2106 is configured to respectively determine an intersection surface of each single-node intersection in the at least two single-node intersections; The enclosing surface generation module 2108 is configured to generate an enclosing surface of the complex node intersection based on the intersection surface of each single node intersection; The merging module 2110 is configured to merge the enclosing surface with the road surface to obtain an intersection surface of the complex node intersection.

[0124] In one embodiment, the determination module 2102 is further configured to determine a composite node intersection corresponding to a composite node intersection mark formed by the at least two single-node intersections when the road network data of each of the at least two single-node intersections includes the same composite node intersection mark.

[0125] In one embodiment, the road surface generation module 2104 is further configured to obtain road network data for each single-node intersection included in the composite node intersection, determine at least two roads connected to each single-node intersection based on the road network data to obtain a plurality of roads included in the composite node intersection, obtain corresponding road information for each road, including at least one of a road class, a number of lanes, and a lane width, determine a road width corresponding to each road based on the road information, widen each road according to the respective road width to obtain a road surface for the roads, and obtain a road surface for the composite node intersection based on the road surfaces of each road.

[0126] In one embodiment, the single-node intersection surface generation module 2106 is further configured to perform the steps of: for each single-node intersection, determining at least two roads connected to the single-node intersection; obtaining a constraint condition and an objective function, where the objective function indicates a solution goal of the area size of the intersection surface of the single-node intersection, the constraint condition indicates a limit condition of the area size, the constraint condition includes a constraint relationship between offset variables of each two adjacent roads among the at least two roads, and the objective function includes at least two offset variables, each offset variable indicating a distance situation from the single-node intersection to a tangent of the corresponding road; solving the objective function based on the road surface width of each road in the at least two roads and the constraint condition to obtain the road offset distance; and generating the intersection surface of the single-node intersection based on the road surface width of the road and the road offset distance.

[0127] In one embodiment, the single node intersection surface generation module 2106 is further configured to perform the steps of determining included angle information between each of the two adjacent roads based on the road surface widths of each of the two adjacent roads and the offset variables of the corresponding roads, where the included angle information indicates an intersection situation between tangents corresponding to each of the two adjacent roads, and constructing a constraint condition based on the included angle information between each of the two adjacent roads.

[0128] In one embodiment, the single node intersection surface generation module 2106 is further configured to perform the steps of: obtaining an included angle between a first road and a second road, the first road and the second road being adjacent roads of the at least two roads; obtaining a first included angle between the first road and a line of a right side of the road surface of the first road, a second included angle between the second road and a line of a left side of the road surface of the second road, and a third included angle between the line of the right side of the road surface of the first road and a line of the left side of the road surface of the second road; and constructing a constraint condition based on the included angle between the first road and the second road, the first included angle, the second included angle, and the third included angle.

[0129] In one embodiment, the enclosing surface generation module 2108 is further configured to obtain a first shape point set based on the shape points included in the intersection surface of each single-node intersection, and calculate, based on the first shape point set, a smallest convex polygon that encloses all shape points in the first shape point set to obtain an enclosing surface of the complex node intersection.

[0130] In one embodiment, the integration module 2110 is further configured to determine the edge lines of the road surface of each road included in the road surface of the composite node intersection, determine the intersection points between the boundary line of the enclosing surface of the composite node intersection and the edge lines of the road surface to obtain a trim point set formed by the trim points of the enclosing surface, determine each two adjacent trim points in the trim point set, and perform a smoothing operation between each two adjacent trim points on the enclosing surface to obtain the intersection surface of the composite node intersection.

[0131] In one embodiment, the integration module 2110 is further configured to perform the steps of determining a second shape point set formed by shape points of the enclosing surface, where the shape points have a front-to-back order; for each trim point in the trim point set, calculating a left-neighbor shape point and a right-neighbor shape point of the trim point in the second shape point set; and for each trim point in the trim point set, ordering according to the front-to-back order of the corresponding destination shape point, and determining each two adjacent trim points in the trim point set based on the ordering result, where the destination shape point is a left-neighbor shape point or a right-neighbor shape point.

[0132] In one embodiment, the smooth curve is a Bezier curve, and the integration module 2110 is further configured to extend two adjacent trim points along the edge lines of the road surface where the trim points are located, in the direction of a single-node intersection to which the edge lines of the road surface are connected, to obtain two control points, and generate a Bezier curve based on the two adjacent trim points and the two control points.

[0133] Each module in the intersection surface generation device 2100 can be realized in whole or in part by software, hardware, or a combination thereof. Each module may be integrated in the processor of a computer device in the form of hardware, or may be independent of the processor in the computer device, and may be stored in the memory of a computer device in the form of software so that the processor can call and execute the operations corresponding to each module.

[0134] The above-mentioned intersection surface generation device 2100 obtains the road surface of a composite node intersection including at least two single-node intersections based on intersection information of the composite node intersection, and generates an enclosing surface of the composite node intersection based on the intersection surfaces of each single-node intersection included therein. Then, the intersection surface of the composite node intersection can be obtained by simply trimming the enclosing surface to the road surface. On the premise of relying on a small amount of original data, the enclosing surface can be generated simply, efficiently and with high quality, there is no need to introduce complex calculation policies, extreme cases can be avoided, and it is highly robust.

[0135] In one embodiment, a computer device is provided, which may be the server 104 shown in FIG. 1, and its internal structure diagram can be shown in FIG. 22. The computer device includes a processor, a memory, an input / output interface (I / O: Input / Output), and a communication interface. Wherein, the processor, the memory, and the input / output interface are connected via a system bus, and the communication interface is connected to the system bus via the input / output interface. Wherein, the processor of the computer device is configured to provide a calculation function and a control function. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer-readable storage instructions, and a database. The internal memory provides an environment for executing the operating system and the computer-readable storage instructions stored in the non-volatile storage medium. The database of the computer device is configured to store road network data. The input / output interface of the computer device is configured to exchange information between the processor and an external device. The communication interface of the computer device is configured to communicate with an external terminal via a network connection. When executed by the processor, the computer-readable storage instructions realize a method for generating an intersection surface.

[0136] Those skilled in the art will understand that the structure shown in FIG. 22 is merely a block diagram of a portion of the structure related to the solution of the present application, and is not a limitation on the computer device to which the solution of the present application can be applied, and that a specific computer device may include more or fewer components than those shown, may combine specific components, or may have a different component arrangement.

[0137] In one embodiment, a computing device is provided comprising a memory and a processor, the memory storing computer-readable storage instructions, the processor, when executing the computer-readable storage instructions, implementing steps of an intersection surface generation method provided in any one or more embodiments of the present application.

[0138] In one embodiment, a computer-readable storage medium having stored thereon computer-readable instructions that, when executed by a processor, implement steps of a method for generating an intersection surface provided in any one or more embodiments of the present application.

[0139] In one embodiment, a computer program product is provided that includes computer-readable storage instructions that, when executed by a processor, implement steps of an intersection surface generation method provided in any one or more embodiments of the present application.

[0140] In addition, all user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) related to this application are information and data authorized by the user or fully authorized by each related party, and the collection, use and processing of related data shall comply with the relevant laws, regulations and standards of the relevant countries and regions.

[0141] Those skilled in the art can understand that all or part of the processes in each method of the above embodiments can be completed by hardware associated with program readable storage instructions, and the computer readable storage instructions can be stored in a non-volatile computer readable storage medium, and when the computer readable storage instructions are executed, the processes in each method embodiment can be included. Here, any memory, database, or other medium cited in each embodiment provided by the present application can include at least one of a non-volatile memory and a volatile memory. The non-volatile memory can include a read-only memory (ROM), a magnetic tape, a floppy disk, a flash memory, an optical memory, a high-density embedded non-volatile memory, a resistive random access memory (ReRAM), a magnetoresistive random access memory (MRAM), a ferroelectric random access memory (FRAM), a phase change memory (PCM), a graphene memory, etc. The volatile memory can include a random access memory (RAM) or an external cache memory. By way of illustrative but non-limiting example, the RAM may be in various forms, such as a static random access memory (SRAM) or a dynamic random access memory (DRAM). The database in each embodiment provided by the present application may include at least one of a relational database and a non-relational database. The non-relational database may include, but is not limited to, a blockchain-based distributed database. The processor in each embodiment provided by the present application may be, but is not limited to, a universal processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic processor, a data processing logic processor based on quantum computing, and the like.

[0142] Each technical feature of the above embodiments can be combined in any manner, and for the sake of brevity, not all possible combinations of each technical feature in the above embodiments are described, but all combinations of these technical features should be considered to be within the scope of this specification, unless there is a contradiction.

[0143] The above examples only represent some embodiments of the present application, and are described in more specific and detailed manner, but they should not be construed as limiting the scope of protection of the present application. It should be noted that a person skilled in the art can make some modifications and improvements without departing from the idea of ​​the present application, and these modifications and improvements are included in the scope of protection of the present application. Therefore, the scope of protection of the present application shall be subject to the claims. [Explanation of symbols]

[0144] 102 Terminals 104 Server 2100 Generator 2102 Decision Module 2104 Road Surface Generation Module 2106 Single-node intersection surface generation module 2108 Enclosure Generation Module 2110 Integration Module

Claims

1. 1. A method for generating an intersection surface, implemented by a computing device, comprising: determining a complex node intersection based on road network data, the complex node intersection including at least two single-node intersections; obtaining a road surface of the composite node intersection based on intersection information of the composite node intersection; determining an intersection plane of each of the single-node intersections in the at least two single-node intersections respectively; generating an enclosing surface of the complex node junction based on the junction surface of each of the single node junctions; and integrating the surrounding surface with the road surface to obtain an intersection surface of the composite node intersection.

2. The step of determining the complex node intersection includes: obtaining road network data for each single-node intersection; If the road network data for at least two single-node intersections each contain the same composite-node intersection mark, determining that the at least two single-node intersections form the composite node intersection; The method for generating an intersection surface according to claim 1 .

3. The step of acquiring a road surface of the composite node intersection based on intersection information of the composite node intersection includes: obtaining road network data for each single-node intersection included in the complex-node intersection; determining at least two roads connected to each of the single-node intersections based on the road network data to obtain a plurality of roads included in the complex-node intersection; obtaining corresponding road information for each road, the road information including at least one of a road class, a number of lanes, and a lane width; determining a road width corresponding to each of the roads based on the road information, and widening each of the roads according to the respective road widths to obtain a road surface of the road; and obtaining a road surface of the composite node intersection based on the road surface of each of the roads. A method for generating an intersection surface according to claim 1 or 2.

4. The step of respectively determining an intersection plane of each of the single-node intersections in the at least two single-node intersections comprises: for each single-node intersection, determining at least two roads connected to said single-node intersection; obtaining a constraint condition and an objective function, the objective function indicating a solution target for an area size of an intersection surface of the single-node intersection, the constraint condition indicating a limiting condition for the area size, the constraint condition including a constraint relationship between offset variables of each of two adjacent roads among the at least two roads, the objective function including at least two of the offset variables, each of the offset variables indicating a distance situation from the single-node intersection to a tangent of a corresponding road; solving the objective function based on a road surface width of each of the roads in the at least two roads and the constraints to obtain an offset distance for the road; generating an intersection surface for the single-node intersection based on a road surface width of the road and an offset distance of the road. A method for generating an intersection surface according to any one of claims 1 to 3.

5. The step of acquiring the constraint condition includes: determining an included angle between each of the two adjacent roads based on a road surface width of each of the two adjacent roads and an offset variable of the corresponding road, the included angle indicating an intersection situation between tangents corresponding to each of the two adjacent roads; and establishing a constraint based on the included angle information between each pair of adjacent roads. A method for generating an intersection surface according to any one of claims 1 to 4.

6. The road surface of each of the roads includes a left side line and a right side line of the road surface, and the step of constructing a constraint condition based on the included angle information between each two adjacent roads includes: obtaining an angle between a first road and a second road, the first road and the second road being adjacent roads among the at least two roads; obtaining a first included angle between the first road and a line of a right side of a road surface of the first road, a second included angle between the second road and a line of a left side of a road surface of the second road, and a third included angle between the line of the right side of the road surface of the first road and a line of a left side of the road surface of the second road; establishing a constraint condition based on an angle between the first road and the second road, the first angle, the second angle, and the third angle; The method for generating an intersection surface according to claim 5 .

7. generating an enclosing surface of the complex node junction based on the junction surface of each of the single-node junctions; obtaining a first set of shape points based on shape points included in an intersection plane of each of the single-node intersections; calculating a smallest convex polygon that encloses all shape points in the first shape point set based on the first shape point set to obtain an enclosing surface of the complex node intersection point; A method for generating an intersection surface according to any one of claims 1 to 6.

8. The step of integrating the enclosing surface with the road surface to obtain an intersection surface of the composite node intersection includes: determining a road surface edge line of each road included in the road surface of the composite node intersection; determining intersections of a boundary line of an enclosing surface of the complex node intersection with an edge line of the road surface to obtain a set of trim points formed by trim points of the enclosing surface; determining two adjacent trim points in the set of trim points; performing a smoothing process between each two of the adjacent trim points on the enclosing surface to obtain an intersection surface of the composite node intersection; A method for generating an intersection surface according to any one of claims 1 to 7.

9. The step of determining each two adjacent trim points in the set of trim points comprises: determining a second set of shape points formed by shape points of the enclosing surface, the shape points having a chronological order; calculating, for each trim point in the set of trim points, a left adjacent shape point and a right adjacent shape point of the trim point in the second set of shape points; and a step of ordering each trim point in the trim point set according to a front-back order of a corresponding target shape point, and determining each of the two adjacent trim points in the trim point set based on the ordering result, the target shape point being a left adjacent shape point or a right adjacent shape point. The method for generating an intersection surface according to claim 8.

10. The step of performing a smoothing process between each two adjacent trim points on the enclosing surface includes: If two adjacent trim points are located on a line of a side of the road surface of the same road of the enclosing surface, connecting the two adjacent trim points with a straight line; and if two adjacent trim points are located on a line of an edge of a road surface of different roads in the enclosing surface, connecting the two adjacent trim points with a smooth curve. The method for generating an intersection surface according to claim 8.

11. The smooth curve is a Bezier curve, and the step of generating a Bezier curve between two adjacent trim points includes: Extending each of the two adjacent trim points along the edge line of the road surface on which the trim points are located in the direction of the single-node intersection to which the edge line of the road surface is connected, to obtain two control points; generating the Bezier curve based on the two adjacent trim points and the two control points; The method for generating an intersection surface according to claim 10.

12. An intersection surface generation device, comprising: a determination module configured to determine a complex node intersection based on road network data, the complex node intersection including at least two single-node intersections; a road surface generation module configured to obtain a road surface of the composite node intersection based on intersection information of the composite node intersection; a single-node intersection surface generation module configured to respectively determine an intersection surface of each of the single-node intersections in the at least two single-node intersections; an enclosing surface generation module configured to generate an enclosing surface of the composite node junction based on the junction surface of each of the single-node junctions; an integration module configured to integrate the enclosing surface with the road surface to obtain an intersection surface of the composite node intersection.

13. The road surface generation module is further configured to: obtain road network data for each of the single-node intersections included in the composite node intersection; determine at least two roads connected to each of the single-node intersections based on the road network data to obtain a plurality of roads included in the composite node intersection; obtain corresponding road information for each road, the corresponding road information including at least one of a road class, a number of lanes, and a lane width; determine a road width corresponding to each of the roads based on the road information; widen each of the roads according to the respective road widths to obtain a road surface of the roads; and obtain a road surface of the composite node intersection based on the road surfaces of each of the roads. The apparatus for generating an intersection surface according to claim 12.

14. The enclosing surface generation module is further configured to obtain a first shape point set based on shape points included in an intersection surface of each of the single-node intersections, and to calculate, based on the first shape point set, a minimum convex polygon that encloses all shape points in the first shape point set to obtain an enclosing surface of the complex-node intersections. An apparatus for generating an intersection surface according to claim 12 or 13.

15. The integration module is further configured to: determine an edge line of a road surface of each road included in the road surface of the composite node intersection; determine an intersection point between a boundary line of an enclosing surface of the composite node intersection and an edge line of the road surface to obtain a trim point set formed by trim points of the enclosing surface; determine two adjacent trim points in the trim point set; and perform a smoothing operation between the two adjacent trim points on the enclosing surface to obtain an intersection surface of the composite node intersection. An intersection surface generation device according to any one of claims 12 to 14.

16. The integration module is further configured to perform the steps of: determining a second shape point set formed by shape points of the enclosing surface, the shape points having a front-to-back order; calculating, for each trim point in the trim point set, a left neighbor shape point and a right neighbor shape point of the trim point in the second shape point set; and, for each trim point in the trim point set, ordering according to a front-to-back order of a corresponding target shape point, and determining each two adjacent trim points in the trim point set based on the ordering result, the target shape point being a left neighbor shape point or a right neighbor shape point. The intersection surface generation device according to claim 15.

17. The integration module is further configured to connect the two adjacent trim points with a straight line when the two adjacent trim points are located on a line of an edge of a road surface of the same road of the enclosing surface, and to connect the two adjacent trim points with a smooth curve when the two adjacent trim points are located on a line of an edge of a road surface of different roads of the enclosing surface. The intersection surface generation device according to claim 15.

18. A computing apparatus comprising a memory having computer-readable stored instructions stored thereon and a processor which, when executing said computer-readable stored instructions, implements the steps of the method according to any one of claims 1 to 11.

19. A computer readable storage medium having stored thereon computer readable instructions which, when executed by a processor, implement the steps of the method according to any one of claims 1 to 11.

20. A computer program product having stored thereon computer readable instructions which, when executed by a processor, implement the steps of the method according to any one of claims 1 to 11.

Citation Information

Patent Citations

  • Data structure of route guidance database

    JP2009176223A

  • Method for creating intersection model, device, apparatus, and media

    JP2021119501A

  • Map creation device, map creation method, and computer program for map creation

    JP2022079170A

  • Device and method for creating and using data on road map expressed by polygons

    KR100579767B1

  • Map database creating system

    KR1020080070620A