CN117745865A

CN117745865A - Method for eliminating gland of electronic map element and storage medium

Info

Publication number: CN117745865A
Application number: CN202211112297.1A
Authority: CN
Inventors: 谭效良; 伍广明
Original assignee: Fengtu Technology Shenzhen Co Ltd
Current assignee: Fengtu Technology Shenzhen Co Ltd
Priority date: 2022-09-13
Filing date: 2022-09-13
Publication date: 2024-03-22

Abstract

The application provides a gland eliminating method and a storage medium of electronic map elements, wherein the method comprises the following steps: acquiring a preset vector graphic of each feature element in an electronic map of a target area to obtain a preset vector graphic set; in the elimination of the preset vector graphic set, determining a first vector graphic and a second vector graphic which have the mutual capping condition; determining a gland type of a mutual gland eliminating condition between the first vector graphic and the second vector graphic; determining a gland elimination strategy for eliminating the gland type; a de-capping strategy is performed to remove the mutual capping condition between the first vector graphic and the second vector graphic. By adopting the method, the corresponding gland eliminating strategy can be executed according to the gland type of the mutual gland condition, and the gland is not required to be eliminated manually, so that the eliminating efficiency and accuracy of the gland phenomenon are improved.

Description

Method for eliminating gland of electronic map element and storage medium

Technical Field

The application relates to the technical field of electronic maps, in particular to a gland eliminating method and a storage medium for electronic map elements.

Background

The ground feature elements are basic elements in the electronic map, and reflect the actual positions, shapes, lengths and areas of different ground features in the physical world. The feature elements need to be displayed correctly, accurately and regularly on the drawing of the electronic map. However, in the process of producing and drawing an electronic map, the phenomenon of mutual capping between different ground object elements is easily caused due to the fact that the production among the different ground object elements is asynchronous, the technical level of production operators is uneven, the positioning offset and the projection difference exist in different reference images at different periods, and the like.

At present, mutual capping among different feature elements is mainly performed through manual inspection and manual elimination, but because the feature elements are various in variety, and the order of magnitude of element capping is greatly improved along with the increase of the coverage area of an electronic map, the efficiency of manually eliminating capping phenomenon is lower.

Disclosure of Invention

In view of the above, it is necessary to provide a gland eliminating method and a storage medium for electronic map elements, which improve the efficiency and accuracy of eliminating the gland phenomenon.

In a first aspect, the present application provides a capping elimination method for an electronic map element, including:

Acquiring a preset vector graphic of each feature element in an electronic map of a target area to obtain a preset vector graphic set;

in the preset vector graphic set, determining a first vector graphic and a second vector graphic which are mutually pressed;

determining a gland type of a mutual gland condition between the first vector graphic and the second vector graphic;

determining a gland removal strategy for the gland type;

and executing the gland removing strategy to remove the mutual gland condition between the first vector graph and the second vector graph.

In some embodiments of the present application, the determining a gland type to which a mutual gland condition between the first vector graphic and the second vector graphic belongs includes:

determining an end line segment in the outline of the first vector graphic, wherein the outline of the first vector graphic comprises the end line segment and a side line segment;

determining a mutual capping area of the first vector graphic and the second vector graphic;

if the end line segment intersects with the mutual gland area, determining the gland type as that the end line segment is fully capped or the end line segment is partially capped according to the length of the intersecting line segment between the mutual gland area and the end line segment;

And if the end line segment is not intersected with the mutual gland area, determining that the gland type is that the end line segment is not gland.

In some embodiments of the present application, the executing the capping elimination policy to eliminate a capping condition between the first vector graphic and the second vector graphic includes:

if the gland type is that the tail end line segment is not gland, determining the gland depth degree between the first vector graphic and the second vector graphic;

if the gland depth is shallow gland, judging that the second vector graph is inaccurate, and adjusting the outline of the second vector graph according to the mutual gland area so as to eliminate the mutual gland area;

and if the gland depth is the depth gland, judging that the first vector graph and the second vector graph are inaccurate, and adjusting the outline of the first vector graph and the outline of the second vector graph according to the mutual gland area so as to eliminate the mutual gland area.

In some embodiments of the present application, the determining the gland depth between the first vector graphic and the second vector graphic includes:

Determining a central region of the first vector graphic;

if the central area and the mutual capping area are at least partially overlapped, determining that the capping depth degree between the first vector graphic and the second vector graphic is a depth capping;

and if the central area and the mutual capping area are not overlapped, determining that the capping depth degree between the first vector graphic and the second vector graphic is a shallow capping.

In some embodiments of the present application, the adjusting the contour of the second vector graphics includes:

determining a line segment edge intersected with the first vector graph from a plurality of line segment edges contained in the outline of the second vector graph;

determining a line segment edge to be translated from line segment edges intersected with the first vector graph;

and translating the line segment edges to be translated along the orthogonal direction of the line segment edges to be translated until the mutual gland area is eliminated.

In some embodiments of the present application, the ground feature element represented by the first vector graphic is a road, the first vector graphic includes a road center line of the road, the road center line is formed by splicing a plurality of line segments, and the adjusting the contour of the first vector graphic includes:

Determining an intersection point of the contour of the first vector graphic and the contour of the second vector graphic;

determining a target line segment nearest to the intersection point from a plurality of line segments contained in the central line of the road;

determining a symmetry point of the intersection point relative to the target line segment;

generating a new line segment for replacing the target line segment based on the symmetry point, wherein the new line segment comprises the symmetry point;

replacing the target line segment with the new line segment to obtain an adjusted road center line;

and adjusting the outline of the first vector graph based on the adjusted road center line.

In some embodiments of the present application, after the executing the capping-removal policy to remove the mutual capping condition between the first vector graphic and the second vector graphic, the method further includes:

acquiring a first area of the second vector graphic after the gland removal strategy is executed and a second area of the second vector graphic before the gland removal strategy is executed;

determining an area ratio between the first area and the second area;

and if the area ratio is larger than a preset ratio, judging that the gland eliminating strategy is qualified to execute.

and if the gland type is that the tail end line segment is fully capped, judging that the first vector graph is inaccurate, and adjusting the outline of the first vector graph according to the mutual capping area so as to eliminate the mutual capping area.

if the gland type is that the tail end line segment is partially gland, determining the gland depth degree between the first vector graphic and the second vector graphic;

if the gland depth is the depth gland, judging that the first vector graph is inaccurate, and adjusting the outline of the first vector graph according to the mutual gland area so as to eliminate the mutual gland area.

In some embodiments of the present application, the adjusting the contour of the first vector graphics to eliminate the capping region includes:

and deleting the part belonging to the mutual capping area in the first vector graph so as to eliminate the mutual capping area.

In some embodiments of the present application, the determining, in the preset vector graphics set, a first vector graphics and a second vector graphics in which a mutual capping condition exists includes:

determining element categories of feature elements of each preset vector graph in the preset vector graph set;

dividing the preset vector graphic set according to the element categories to obtain a plurality of preset vector graphic subsets, wherein the element categories to which the feature elements of the preset vector graphics in different preset vector graphic subsets belong are different;

determining a first vector graphic and a second vector graphic with mutual capping conditions according to whether the preset vector graphics in different vector graphic subsets are at least partially overlapped;

wherein the first vector graphic and the second vector graphic belong to different preset vector graphic subsets.

In a second aspect, the present application provides a capping elimination apparatus for an electronic map element, including:

The image acquisition module is used for acquiring preset vector images of all feature elements in the electronic map of the target area to obtain a preset vector image set;

the gland detection module is used for determining a first vector graph and a second vector graph which have the condition of mutual gland in the preset vector graph set;

the gland classification module is used for determining the gland type of the mutual gland condition between the first vector graphic and the second vector graphic;

and the gland eliminating module is used for determining the gland eliminating strategy of the gland type, and executing the gland eliminating strategy to eliminate the mutual gland condition between the first vector graph and the second vector graph.

In some embodiments of the present application, the gland classification module is specifically configured to determine an end line segment in a contour of the first vector graphic, where the contour of the first vector graphic includes the end line segment and a side line segment; determining a mutual capping area of the first vector graphic and the second vector graphic; if the end line segment intersects with the mutual gland area, determining the gland type as that the end line segment is fully capped or the end line segment is partially capped according to the length of the intersecting line segment between the mutual gland area and the end line segment; and if the end line segment is not intersected with the mutual gland area, determining that the gland type is that the end line segment is not gland.

In some embodiments of the present application, the gland removing module is further configured to determine a gland depth between the first vector graphic and the second vector graphic if the gland type is that the end line segment is not gland; if the gland depth is shallow gland, judging that the second vector graph is inaccurate, and adjusting the outline of the second vector graph according to the mutual gland area so as to eliminate the mutual gland area; and if the gland depth is the depth gland, judging that the first vector graph and the second vector graph are inaccurate, and adjusting the outline of the first vector graph and the outline of the second vector graph according to the mutual gland area so as to eliminate the mutual gland area.

In some embodiments of the present application, the gland removal module is further configured to determine a central region of the first vector graphic; if the central area and the mutual capping area are at least partially overlapped, determining that the capping depth degree between the first vector graphic and the second vector graphic is a depth capping; and if the central area and the mutual capping area are not overlapped, determining that the capping depth degree between the first vector graphic and the second vector graphic is a shallow capping.

In some embodiments of the present application, the gland removing module is further configured to determine a line segment edge intersecting the first vector graphic from a plurality of line segment edges included in the outline of the second vector graphic; determining a line segment edge to be translated from line segment edges intersected with the first vector graph; and translating the line segment edges to be translated along the orthogonal direction of the line segment edges to be translated until the mutual gland area is eliminated.

In some embodiments of the present application, the gland removal module is further configured to determine an intersection of the contour of the first vector graphic and the contour of the second vector graphic; determining a target line segment nearest to the intersection point from a plurality of line segments contained in the central line of the road; determining a symmetry point of the intersection point relative to the target line segment; generating a new line segment for replacing the target line segment based on the symmetry point, wherein the new line segment comprises the symmetry point; replacing the target line segment with the new line segment to obtain an adjusted road center line; and adjusting the outline of the first vector graph based on the adjusted road center line.

In some embodiments of the present application, the capping elimination apparatus of the electronic map element further includes a checking module, configured to obtain a first area of the second vector graphic after the capping elimination policy is executed, and a second area of the second vector graphic before the capping elimination policy is executed; determining an area ratio between the first area and the second area; and if the area ratio is larger than a preset ratio, judging that the gland eliminating strategy is qualified to execute.

In some embodiments of the present application, the gland eliminating module is further configured to determine that the first vector graphic is inaccurate if the gland type is that the end line segment is fully capped, and adjust the contour of the first vector graphic according to the inter-capping region, so as to eliminate the inter-capping region.

In some embodiments of the present application, the gland removing module is further configured to determine a gland depth between the first vector graphic and the second vector graphic if the gland type is that an end line segment is partially gland; if the gland depth is shallow gland, judging that the second vector graph is inaccurate, and adjusting the outline of the second vector graph according to the mutual gland area so as to eliminate the mutual gland area; if the gland depth is the depth gland, judging that the first vector graph is inaccurate, and adjusting the outline of the first vector graph according to the mutual gland area so as to eliminate the mutual gland area.

In some embodiments of the present application, the capping elimination module is further configured to delete a portion of the first vector graphic that belongs to the region of mutual capping, so as to eliminate the region of mutual capping.

In some embodiments of the present application, the gland detection module is specifically configured to determine an element category to which a feature element of each preset vector graphic in the preset vector graphic set belongs; dividing the preset vector graphic set according to the element categories to obtain a plurality of preset vector graphic subsets, wherein the element categories to which the feature elements of the preset vector graphics in different preset vector graphic subsets belong are different; determining a first vector graphic and a second vector graphic with mutual capping conditions according to whether the preset vector graphics in different vector graphic subsets are at least partially overlapped; wherein the first vector graphic and the second vector graphic belong to different preset vector graphic subsets.

In a third aspect, the present application also provides a computer device comprising:

one or more processors;

a memory; and

one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the steps in the above-described method of gland removal of electronic map elements.

In a fourth aspect, the present application also provides a computer readable storage medium having stored thereon a computer program that is loaded by a processor to perform the steps in the above-described method for gland removal of electronic map elements.

In a fifth aspect, embodiments of the present application provide a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions so that the computer device performs the steps in the above-described method of gland removal of electronic map elements.

According to the gland eliminating method and the storage medium of the electronic map element, the first vector graph and the second vector graph with the mutual gland condition are determined, the gland type of the mutual gland condition between the first vector graph and the second vector graph is determined, and the corresponding gland eliminating strategy is executed according to the gland type of the mutual gland condition, so that manual operation is not needed to eliminate the gland, and the efficiency and the accuracy of eliminating the gland phenomenon are improved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings that are needed in the description of the embodiments will be briefly introduced below, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

Fig. 1 is a flow chart of a capping elimination method of an electronic map element in an embodiment of the present application;

FIG. 2 is a schematic flow chart of determining gland type in an embodiment of the present application;

FIG. 3 is a schematic flow chart of a capping elimination strategy in an embodiment of the present application;

FIG. 4 is a schematic flow chart of the pressure cap detection in the embodiment of the present application;

fig. 5 is a schematic structural diagram of a capping device for electronic map elements in the embodiment of the present application;

FIG. 6 is a schematic diagram of a computer device in an embodiment of the present application;

FIG. 7 is an interface schematic diagram of an electronic map according to an embodiment of the present application;

FIG. 8 is a schematic illustration of the positional relationship of various gland stack types in an embodiment of the present application;

FIG. 9 is a schematic diagram of a positional relationship of a second vector graphic including a first vector graphic according to an embodiment of the present application;

FIG. 10 is a schematic diagram of a positional relationship in which a first vector graphic passes completely through a second vector graphic in an embodiment of the present application;

FIG. 11 is a schematic illustration of the positional relationship of various gland types in embodiments of the present application;

FIG. 12 is a schematic diagram of the position relationship of the end points 0 in the embodiment of the present application;

FIG. 13 is a schematic diagram of the position relationship of the end points 1 in the embodiment of the present application;

FIG. 14 is a schematic diagram of the position relationship of the end points with the number of 2 points in the embodiment of the present application;

FIG. 15 is a schematic diagram of the position relationship of 3 points in the number of endpoints in the embodiment of the present application;

FIG. 16 is a schematic diagram of a positional relationship between the first and second vector graphics before and after adjustment in the embodiment of the present application;

FIG. 17 is a schematic diagram of another positional relationship between the first and second vector graphics before and after adjustment in the embodiment of the present application;

fig. 18 is a schematic diagram of still another positional relationship between the first and second vector graphics before and after adjustment in the embodiment of the present application.

Detailed Description

The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all, of the embodiments of the present application. All other embodiments, which can be made by those skilled in the art based on the embodiments herein without making any inventive effort, are intended to be within the scope of the present application.

In the description of the present application, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more of the described features. In the description of the present application, the meaning of "a plurality" is two or more, unless explicitly defined otherwise.

In the description of the present application, the term "for example" is used to mean "serving as an example, instance, or illustration. Any embodiment described herein as "for example" is not necessarily to be construed as preferred or advantageous over other embodiments. The following description is presented to enable any person skilled in the art to make and use the invention. In the following description, details are set forth for purposes of explanation. It will be apparent to one of ordinary skill in the art that the present invention may be practiced without these specific details. In other instances, well-known structures and processes have not been described in detail so as not to obscure the description of the invention with unnecessary detail. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features disclosed herein.

Referring to fig. 1, an embodiment of the present application provides a capping method for electronic map elements, where the method includes steps S101 to S105, specifically as follows:

s101, acquiring preset vector graphics of each feature element in the electronic map of the target area, and obtaining a preset vector graphics set.

The target area refers to an area where gland removal is required. The electronic map refers to a digital map, which is a map stored and referred in a digital manner by utilizing a computer technology, and is obtained by carrying out field measurement by map production operators. The ground feature elements refer to buildings, roads and auxiliary facilities thereof, public facilities, pipelines and palisades, water systems and auxiliary facilities thereof, and the like. The electronic map of the target area comprises a plurality of preset vector graphics, each preset vector graphic represents a ground feature element in the target area, and the preset vector graphic set comprises a plurality of preset vector graphics in the electronic map. The preset vector graphics have the attributes of shape, outline, size, geographic position and the like so as to draw corresponding ground feature elements on the electronic map. The attributes of the preset vector graphics are obtained by measuring the ground feature elements in the target area in advance in the field, so that the preset vector graphics in the electronic map are generated according to the attributes. Referring to fig. 7, fig. 7 shows a part of contents of an electronic map, and it can be seen that the electronic map in fig. 7 includes a preset vector graphic where a building is located and a preset vector graphic where a road is located.

In some embodiments, the preset vector graphic may be a planar vector graphic or a linear vector graphic. Taking the ground feature as an example of a road, since the road generally comprises bidirectional lanes, and the bidirectional lanes are separated by a road center line, a preset vector graphic where the road is located is generally a linear vector graphic, and the linear vector graphic is overlapped with the road center line. In order to facilitate the capping elimination method of the embodiment, a preset road width value of the road may be obtained, and the linear vector graphics may be expanded into planar vector graphics according to the preset road width value, where the width of the planar vector graphics is the preset road width value.

S102, determining a first vector graph and a second vector graph which have mutual capping conditions in the preset vector graph set.

Specifically, in the preset vector graphic set, whether each two preset vector graphics are at least partially overlapped or not is detected. And if the two preset vector graphics are at least partially overlapped, indicating that the mutual capping condition exists between the two preset vector graphics, and taking one of the two preset vector graphics with the mutual capping condition as a first vector graphic and the other one as a second vector graphic. When detecting whether the two preset vector graphics are at least partially overlapped, specifically, respectively acquiring the occupied areas of the two preset vector graphics in the electronic map, and determining whether the two preset vector graphics are at least partially overlapped according to the comparison between the occupied areas.

In some embodiments, before step S102, an area of each preset vector graphic in the set of preset vector graphics is obtained. If the area of the preset vector graphics is smaller than the area threshold, the gland effect of the preset vector graphics is indicated to be smaller, and the preset vector graphics are deleted from the preset vector graphics set. And if the area of the preset vector graph is larger than or equal to the area threshold value, reserving the preset vector graph in the preset vector graph set. Wherein the area threshold is typically 5 square meters.

In some embodiments, after step S102, the areas occupied by the first vector graphic and the second vector graphic in the electronic map are acquired respectively, the overlapping portion between the areas occupied by the first vector graphic and the second vector graphic in the electronic map is used as a capping area, and then the ratio of the area of the capping area to the area of the first vector graphic and the ratio of the area of the capping area to the area of the second vector graphic are calculated respectively. If both ratios are less than or equal to the first preset threshold, step S103 is performed. If any one of the ratio values is greater than the first preset threshold value, the degree of representing the mutual capping is too large (for example, as shown in fig. 9), and the error between the first vector graphic or the second vector graphic and the actual situation is too large, the first vector graphic or the second vector graphic needs to be re-measured and drawn by production operators, so that step S103 is not executed on the first vector graphic and the second vector graphic, and prompt information is output for the production operators to confirm the first vector graphic and the second vector graphic. Wherein the first preset threshold is typically 95%.

In some embodiments, after step S102, the first vector graphic is used to perform a region difference operation on the second vector graphic, and if the second vector graphic is subjected to the region difference operation to obtain a plurality of spaced regions, the first vector graphic is represented to pass completely through the second vector graphic, and the feature element of the first vector graphic is also actually passed completely through the feature element of the second vector graphic (for example, as shown in fig. 10), so that step S103 is not performed on the first vector graphic and the second vector graphic. Similarly, the second vector graphic is used to perform the region difference operation on the first vector graphic, if the first vector graphic obtains a plurality of spaced regions through the region difference operation, the second vector graphic is represented to completely pass through the first vector graphic, and the feature elements of the second vector graphic are also actually completely passed through the feature elements of the first vector graphic, so that step S103 is not performed on the first vector graphic and the second vector graphic.

S103, determining the gland type of the mutual gland condition between the first vector graphic and the second vector graphic.

Specifically, a first vector graph is taken as a reference, a mutual capping area between a second vector graph and the first vector graph is determined, and a capping type of the mutual capping situation between the first vector graph and the second vector graph is determined according to the mutual capping area. The gland types can include deep gland and shallow gland, and also can include that the tail end line segment is fully gland, the tail end line segment is partially gland and the tail end line segment is not gland, wherein the outline of the first vector graph comprises the tail end line segment and the side line segment, the length of the tail end line segment is smaller than that of the side line segment, the outline of the first vector graph is composed of a plurality of line segments, and one end of the tail end line segment is regarded as the tail end of the outline of the first vector graph. In determining the end line segment and the side line segment, at least one shorter line segment among the plurality of line segments of the contour of the first vector graphic is taken as the end line segment, other line segments except the end line segment among the plurality of line segments of the contour of the first vector graphic are taken as the side line segment, and for example, the shortest line segment among the plurality of line segments of the contour of the first vector graphic is taken as the end line segment. Taking the example that the gland types comprise deep gland and shallow gland, determining the condition of the mutual gland between the first vector graphic and the second vector graphic according to the mutual gland area can be: the method comprises the steps of obtaining the area of a mutual capping area, obtaining the area of a first vector graph, and determining the ratio between the area of the mutual capping area and the area of the first vector graph. If the ratio is greater than a second preset threshold, determining that the gland type is depth gland. If the ratio is smaller than or equal to a second preset threshold, judging the gland type to be shallow gland. The second preset threshold is smaller than the first preset threshold. The specific steps of determining the gland type to which the mutual gland condition between the first vector graphic and the second vector graphic belongs according to the mutual gland area when the end line segment is fully capped, the end line segment is partially capped and the end line segment is not capped are as shown in the embodiment of fig. 2.

S104, determining a gland elimination strategy of the gland type;

specifically, corresponding gland eliminating strategies are preset for different gland types, and the mutual gland areas are eliminated by executing the gland eliminating strategies corresponding to the gland types, so that the mutual gland condition between the first vector graphic and the second vector graphic is eliminated. The gland removal policies may include profile adjustments to the first vector graphic and/or the second vector graphic, different gland removal policies including different ways of profile adjustment. It will be appreciated that after executing the gland removal policy corresponding to the gland type, it may be ensured that the mutual gland area between the first vector graphic and the second vector graphic is removed. The region of mutual capping is eliminated, meaning that by adjusting the contours of the first vector graphic and/or the second vector graphic, there is no overlap between the first vector graphic and the second vector graphic.

S105, executing the gland removing strategy to remove the mutual gland condition between the first vector graph and the second vector graph.

Taking the case that the gland type comprises a deep gland and a shallow gland as an example, if the gland type of the mutual gland condition between the first vector graphic and the second vector graphic is the shallow gland, because the mutual gland area is smaller and the gland type is determined by taking the first vector graphic as a reference, the accuracy of the default first vector graphic is higher than that of the second vector graphic, so that the first vector graphic is judged to be completely accurate, the second vector graphic is inaccurate, and when a gland elimination strategy corresponding to the gland type is executed, only the outline of the second vector graphic is adjusted, so that the gland elimination is realized. Taking the case of the capping type of the mutual capping condition between the first vector graphic and the second vector graphic as the depth capping, because the mutual capping area is larger, the vector graphic error resulting in the condition is larger, and the error existing in the single vector graphic is limited, so that the judgment error exists in the first vector graphic and the second vector graphic simultaneously, both the first vector graphic and the second vector graphic are inaccurate, and when the capping elimination strategy corresponding to the capping type is executed, the contours of the first vector graphic and the second vector graphic are adjusted, so that the overlarge adjustment amplitude of the second vector graphic caused by the adjustment of the contour of the second vector graphic only is avoided. Taking contour adjustment of the first vector graphics as an example, the region where the first vector graphics are located can be reduced by deleting the region of the first vector graphics that is overlapped with each other, and the contour of the first vector graphics can be changed. Other adjustment manners of the profiles of the first vector graphic and the second vector graphic can refer to the embodiment of fig. 3, and are not described herein.

In addition, after step S105 is performed, the process returns to step S102 until no preset vector graphics of the mutual capping condition exist in the preset vector graphics set.

In one embodiment, as shown in fig. 2, step S103 includes:

s201, determining an end line segment in the outline of the first vector graph, wherein the outline of the first vector graph comprises the end line segment and a side line segment;

specifically, as described in the foregoing embodiment, at least one shorter line segment of the plurality of line segments of the contour of the first vector graphic is taken as the end line segment, and the other line segments except the end line segment of the plurality of line segments of the contour of the first vector graphic are taken as the side line segments, wherein the end line segment and the side line segment may both exist in plurality. Taking the first vector graph as an example of a preset vector graph of a building, the outline of the preset vector graph of the building is generally rectangular, the rectangle consists of two long sides and two short sides, the two short sides are all terminal line segments, and the two long sides are all side line segments. Taking the first vector pattern as a preset vector pattern of the road as an example, the outline of the preset vector pattern of the road is generally a strip-shaped outline, the short side in the strip-shaped outline is an end line segment, and the other sides except the end line segment in the strip-shaped outline are side line segments.

Because the road in reality is longer, can divide into the multistage with same road, measure on the spot respectively, like this, same road can correspond to a plurality of vector graphics of predetermineeing that communicate in proper order from beginning to end. If the plurality of preset vector graphics on which the road is located includes the first vector graphics, when determining the end line segment in the outline of the first vector graphics, the determined end line segment may be located in the middle part of the road, instead of the head or tail of the road. Therefore, if the feature element corresponding to the first vector graphic is a road, after determining the end line segment in the outline of the first vector graphic, it may be detected whether the end line segment coincides with the end line segment in the outline of other preset vector graphics in the preset vector graphic set. If the tail end line segment in the outline of the first vector graph is overlapped with the tail end line segments in the outlines of other preset vector graphs, and the ground feature elements corresponding to the other preset vector graphs are roads, representing that the two roads are actually one road, combining the first vector graph and the other preset vector graphs into one preset vector graph, and returning to redetermine the tail end line segment in the outline of the first vector graph based on the updated first vector graph as the updated first vector graph.

S202, determining a mutual capping area of the first vector graphic and the second vector graphic;

the manner of determining the region of mutual capping of the first vector graphic and the second vector graphic may be: and respectively acquiring the areas occupied by the first vector graphic and the second vector graphic in the electronic map, and taking the superposition part between the areas occupied by the first vector graphic and the second vector graphic in the electronic map as the mutual capping area.

And S203, if the end line segment intersects with the mutual gland area, determining the gland type as that the end line segment is fully capped or the end line segment is partially capped according to the length of the intersecting line segment between the mutual gland area and the end line segment.

Specifically, the gland type is determined based on whether the end line segment intersects with the mutual gland area or not with reference to the end line segment in the contour of the first vector graphics. If the end line segment is not intersected with the mutual capping area, determining that the capping type is that the end line segment is not capped, namely the mutual capping area is concentrated on the side edge of the first vector graph. If the end line segment intersects with the mutual capping region, the capping type of the mutual capping condition between the first vector graphic and the second vector graphic can be further determined according to the length of the intersecting line segment between the mutual capping region and the end line segment, specifically: and calculating the ratio of the length of the intersecting line segment to the total length of the end line segment, and if the ratio is larger than a third preset threshold value, determining that the gland type is that the end line segment is fully covered. If the ratio is smaller than a third preset threshold, determining the gland type as that the end line segment is partially gland. Taking the third preset threshold value as an example, if the ratio of the length of the intersecting line segment to the total length of the end line segment is greater than 99%, the gland type is that the end line segment is fully capped, and if the ratio of the length of the intersecting line segment to the total length of the end line segment is less than 99%, the gland type is that the end line segment is partially capped.

Referring to fig. 11, fig. 11 includes a first vector pattern in which a road is located, in which a road center line (a broken line in fig. 11) is provided, and a second vector pattern in which a building is located. It can be seen that the three pictures in fig. 11 represent the gland types from left to right, with the end segments not being capped, the end segments being fully capped, and the end segments being partially capped, respectively.

Taking the example of the gland type including the end segment being fully-capped, the end segment being partially-capped, and the end segment not being capped, in one embodiment, as shown in fig. 3, step S104 includes:

s301, if the gland type is that the tail end line segment is not gland, determining the gland depth degree between the first vector graphic and the second vector graphic;

specifically, if the capping type of the mutual capping condition between the first vector graphic and the second vector graphic is that the end line segment is not capped, determining the capping depth degree between the first vector graphic and the second vector graphic according to the mutual capping area by taking the first vector graphic as a reference. Determining the gland depth from the mutual gland area may be: determining a central area of the first vector graphic, wherein the central area refers to an area within a specified distance by taking the inner center of the first vector graphic as a central point, for example, the central area can be a circular area taking the inner center of the first vector graphic as a circle center and the specified distance as a radius, the inner center of the first vector graphic is the circle center of an inscribed circle of the first vector graphic, and the value of the specified distance is smaller than or equal to the radius of the inscribed circle; and if the central area is at least partially overlapped with the mutual capping area, the degree of capping of the first vector graph is represented to be deeper, and the degree of capping depth is determined to be depth capping. If the central area is not overlapped with the mutual capping area, the degree of capping representing the first vector graph is shallower, and the degree of capping depth is determined to be shallow capping. The central area of the first vector graphic may be an area within a certain distance near the central point of the first vector graphic, and taking the first vector graphic as an example of a vector graphic where the road is located, the central area of the first vector graphic refers to the road center line of the road.

S302, if the gland depth is shallow gland, judging that the second vector graph is inaccurate, and adjusting the second vector graph according to the mutual gland area to eliminate the mutual gland area;

because the gland type is determined by taking the first vector graph as a reference, when the gland type is that the tail end line segment is not capped, and the gland depth degree is shallow gland, the second vector graph is judged to be inaccurate, and the outline of the second vector graph is adjusted according to the mutual capping area until the mutual capping area does not exist between the first vector graph and the second vector graph.

And S303, if the gland depth degree is the depth gland, judging that the first vector graphic and the second vector graphic are inaccurate, and adjusting the outline of the first vector graphic and the outline of the second vector graphic according to the mutual gland area so as to eliminate the mutual gland area.

Specifically, if the depth of the gland is the depth gland, the gland representing the deeper depth is caused by inaccuracy of both the first vector graphic and the second vector graphic, so that the contour of the first vector graphic and the contour of the second vector graphic are adjusted until no mutual gland area exists between the first vector graphic and the second vector graphic.

Examples of adjustments to the contour of the first vector graphic and/or the contour of the second vector graphic are as follows: and when the gland type is that the end line segments are not gland, acquiring the number of endpoints in a second vector graphic contour contained in the mutual gland area by taking the first vector graphic as a reference, wherein the second vector graphic contour is formed by splicing a plurality of line segments, and the endpoints of the line segments in the second vector graphic contour are endpoints in the second vector graphic contour. And if the gland depth is the depth gland, adjusting the contour of the first vector graph and the contour of the second vector graph according to the number of endpoints in the contour of the second vector graph included in the mutual gland area. And if the gland depth is shallow gland, adjusting the profile of the second vector graph according to the number of endpoints in the profile of the second vector graph contained in the mutual gland region. The number of endpoints in the second vector graphics contour included in the mutual capping area can be divided into the following categories: the number of the endpoints is 0 point, the number of the endpoints is 1 point, the number of the endpoints is 2 points, and the number of the endpoints is 3 points or more. As shown in fig. 12 to 15, the number of endpoints in the second vector graphics contour included in the inter-capping region in fig. 12 is 0 point, the number of endpoints in the second vector graphics contour included in the inter-capping region in fig. 13 is 1 point, the number of endpoints in the second vector graphics contour included in the inter-capping region in fig. 14 is 2 point, and the number of endpoints in the second vector graphics contour included in the inter-capping region in fig. 15 is 3 point.

If the capping depth is the depth capping, adjusting the profile of the first vector graphics and the profile of the second vector graphics according to the number of endpoints in the profile of the second vector graphics included in the inter-capping area may include:

(1) If the number of end points is 0, as shown in fig. 12, the adjustment of the first vector graphic and the second vector graphic is skipped to avoid deformation of the first vector graphic and the second vector graphic due to excessive adjustment.

(2) If the number of end points is 1, as shown in fig. 13, since the center line of the road is not necessarily an absolute straight line, but is formed by splicing a plurality of line segments, the adjustment of the contour of the first vector graphic includes: and determining an intersection point of the first vector graphic contour and the second vector graphic contour, traversing and searching each segment of line segment in the central line of the road to determine at least one segment nearest to the intersection point, and taking the at least one segment as a target line segment. If only one target line segment exists, a symmetrical point of the intersection point relative to the target line segment is determined, and when the gland depth degree is the depth gland, the contour of the first vector graph and the contour of the second vector graph are adjusted at the same time, so that the distance between the symmetrical point and the target line segment is generally 1/2 of the distance between the intersection point and the target line segment, namely, the symmetrical point of the intersection point relative to the target line segment at a preset specific distance (1/2 of the distance between the intersection point and the target line segment) is determined. And connecting the symmetrical points with two end points of the target line segment to form a new line segment for replacing the target line segment. And replacing the target line segment with the new line segment to obtain the adjusted road center line. If at least two target line segments spliced in sequence are present, symmetry points of the intersection point relative to each target line segment are determined, each symmetry point is connected in sequence to form a new line segment for replacing the target line segment, then, in end points of other line segments except the target line segment in the road center line, the end points for connecting the target line segment are connected to the end points of the new line segment, the target line segment is replaced by the new line segment, and an adjusted road center line is formed, wherein when the target line segment is replaced by the new line segment, the fact that the two intersected line segments do not exist in the adjusted road center line is required to be ensured. The abnormal angle inspection of the road route is carried out on the adjusted road center line, and the method specifically comprises the following steps: and respectively taking each symmetrical point as an initial angular point, calculating azimuth angles of the initial angular point and a front end point connected with the initial angular point and azimuth angles of the initial angular point and a rear end point connected with the initial angular point, subtracting a smaller azimuth angle from a larger azimuth angle to obtain an included angle formed by three points, and if the included angle is larger than an extreme angle threshold (the value of the extreme angle threshold can be 135 degrees), indicating that the change between the adjusted road center line and the original road center line is not too large, and judging that the adjusted road center line is qualified. And after the adjusted road center line is qualified, expanding the adjusted road center line into a planar vector graph according to a preset road width value of the road. And expanding the adjusted road center line to obtain a planar vector graph which is the adjusted first vector graph. The adjusting of the contour of the second vector graphic includes: traversing and searching a plurality of line segment edges contained in the second vector graphic outline to determine two line segment edges intersected with the first vector graphic outline, and traversing and searching each line segment in the central line of the road to determine a nearest target line segment at the intersection point; calculating the included angles between the target line segment and the two line segment edges respectively, and screening the two line segment edges according to the distribution of the two included angles: when any included angle is smaller than 30 degrees or any included angle is larger than 60 degrees, reserving one edge with the smallest included angle formed by the two line segment edges and the target line segment, otherwise, reserving the two line segment edges simultaneously; and taking the reserved line segment edge as the line segment edge to be translated, carrying out orthogonal translation on the line segment edge to be translated along the orthogonal direction of the line segment edge to be translated in the direction away from the first vector graph until the line segment edge to be translated is not intersected with the outline of the first vector graph, and obtaining the adjusted second vector graph.

(3) If the number of endpoints is 2 points, as shown in fig. 14, the contour of the first vector graphic is adjusted in the same manner as the first vector graphic when the number of endpoints is 1 point. The adjusting of the contour of the second vector graphic includes: traversing and searching a plurality of line segment edges contained in the second vector graphic outline to determine three line segment edges intersecting the first vector graphic outline in the second vector graphic outline; among the three line segment edges, a point, which is closer to the central line of the road, of the two end points of the second vector graph in the first vector graph is reserved, and two line segment edges intersecting with the point are determined among the three line segment edges; traversing each segment in the road center line to determine the nearest target segment from the intersection point; calculating the included angles between the target line segment and the two line segment edges respectively, and screening the two line segment edges according to the distribution of the two included angles: when any included angle is smaller than 30 degrees or any included angle is larger than 60 degrees, one side of the two line segment sides, which forms a smaller included angle with the target line segment, is reserved, otherwise, the two line segment sides are reserved at the same time; and taking the reserved line segment edge as the line segment edge to be translated, carrying out orthogonal translation on the line segment edge to be translated along the orthogonal direction of the line segment edge to be translated in the direction away from the first vector graph until the line segment edge to be translated is not intersected with the outline of the first vector graph, and obtaining the adjusted second vector graph.

(4) If the number of endpoints is 3 points or more, as shown in fig. 15, the contour of the first vector graphic is adjusted in the same manner as the first vector graphic when the number of endpoints is 1 point. The adjusting of the contour of the second vector graphic includes: calculating the farthest vertical distance between each endpoint of the second vector graphic contour in the first vector graphic and the central line of the road, and adding the farthest vertical distance to a preset road width value of the road to be used as a translation distance; and taking a straight line formed by two points where the second vector graphic outline and the first vector graphic outline intersect as a reference, translating all the points in the second vector graphic falling in the first vector graphic along the direction perpendicular to the straight line according to the translation distance to the direction far away from the first vector graphic, and obtaining an adjusted second vector graphic.

If the gland depth is shallow gland, adjusting the profile of the second vector graphics according to the number of endpoints in the profile of the second vector graphics included in the inter-gland region may include:

(1) If the number of the endpoints is 0 point, the adjusting of the contour of the second vector graphic includes: as shown in fig. 16, two end points of the line segment of the second vector graphics contour that is capped by the first vector graphics are determined, and the maximum length of each line segment length of the mutual capping area contour that is smaller than the preset road width value of the road is determined. And orthogonally translating line segments which are mutually covered in the outline of the second vector graph in a direction away from the first vector graph to obtain an adjusted second vector graph, wherein the translation distance is the calculated maximum length. As shown in fig. 16, the left side is the first vector pattern and the second vector pattern before adjustment, and the right side is the first vector pattern and the second vector pattern after adjustment.

(2) If the number of the endpoints is 1 point, the adjustment mode of the outline of the second vector graphic is the same as that of the second vector graphic when the depth degree of the gland is the depth gland and the number of the endpoints is 1 point;

(3) If the number of the endpoints is 2 points, the adjustment mode of the outline of the second vector graphic is the same as that of the second vector graphic when the depth degree of the gland is the depth gland and the number of the endpoints is 2 points;

(4) If the number of the endpoints is 3 points or more, the outline of the second vector graphic is adjusted in the same way as the outline of the second vector graphic when the depth of the gland is the depth gland and the number of the endpoints is 3 points.

In addition, after executing the capping elimination policy to eliminate the mutual capping condition between the first vector graphic and the second vector graphic, it may also be detected whether the execution of the capping elimination policy is acceptable. Specifically, a first area of a second vector graphic after performing the gland removal strategy and a second area of the second vector graphic before performing the gland removal strategy are obtained, and an area ratio between the first area and the second area is determined. If the area ratio is larger than the preset ratio, the adjustment amplitude of the second vector graph is smaller, the qualification of the execution of the gland eliminating strategy is judged, and the second vector graph obtained after the execution of the gland eliminating strategy is adopted to return to the execution step S101. If the area ratio is smaller than or equal to the preset ratio, the adjustment amplitude of the second vector graph is larger, the difference between the adjusted second vector graph and the actual ground feature element is larger, the unqualified execution of the gland eliminating strategy is judged, and the adjustment of the outline of the second vector graph is cancelled and skipped.

In some embodiments, if the capping type is that the end line segment is fully capped, the characterization of the inter-capping condition is caused by inaccuracy of the end portion of the first vector graphic, so that the inaccuracy of the first vector graphic is determined, and the contour of the first vector graphic is adjusted according to the inter-capping region until the inter-capping region does not exist between the first vector graphic and the second vector graphic. Taking the first vector graphic as a preset vector graphic where the road is, for example, the step of adjusting the contour of the first vector graphic includes: as shown in fig. 17, the center line of the road in the first vector diagram is acquired, and the length of the center line of the road in the mutually overlapping region is determined. If the length is smaller than the preset length, deleting at least the part belonging to the mutual capping area in the first vector graph. As shown in fig. 17, the left side is the first vector pattern and the second vector pattern before adjustment, and the right side is the first vector pattern and the second vector pattern after adjustment. When the length is greater than or equal to the preset length, if the part of the first vector graphic belonging to the mutual capping area is deleted, the adjustment of the first vector graphic is excessively large and is not consistent with the actual ground feature element, so that the adjustment of the first vector graphic is skipped, and the mutual capping condition between the first vector graphic and the second vector graphic is reserved.

In some embodiments, if the gland type is such that the end line segments are partially gland, the mutual gland condition may be caused by inaccuracy of the end portion of the first vector graphic or inaccuracy of the second vector graphic. The gland depth between the first and second vector graphics is thus determined. If the depth of the gland is the depth gland, representing that the gland degree is larger, judging that the mutual gland condition is caused by inaccuracy of the tail end part of the first vector graph, judging that the first vector graph is inaccurate, and adjusting the outline of the first vector graph according to the mutual gland area until the mutual gland area does not exist between the first vector graph and the second vector graph. The adjustment mode of the first vector graphics is the same as the adjustment mode of the first vector graphics when the gland type is that the tail end line segment is fully gland. If the degree of the gland depth is a shallow gland, the degree of the characterized gland is smaller, the condition of the mutual gland is judged to be caused by inaccuracy of the second vector graph, the inaccuracy of the second vector graph is judged, and the outline of the second vector graph is adjusted according to the mutual gland area until the mutual gland area does not exist between the first vector graph and the second vector graph. Taking the first vector graphic as the vector graphic where the road is, for example, the step of adjusting the outline of the second vector graphic includes: as shown in fig. 18, each segment in the road centerline is traversed to determine the closest target segment to the intersection; determining two edges intersecting with the outline of the first vector graph in the second vector graph to obtain azimuth angles of the two edges respectively; subtracting the azimuth angles of the target line segment from the azimuth angles of the two sides respectively to obtain the included angles between the target line segment and the two sides respectively, reserving the side with the smaller included angle, and taking the side as a translation side of the second vector graph; and determining the maximum length of the preset road width value smaller than the road in each line segment length of the contour of the mutually covered region. And orthogonally translating a line segment corresponding to a translation edge of the second vector graph to a direction far away from the first vector graph to obtain an adjusted second vector graph, wherein the translation distance is the calculated maximum length. As shown in fig. 18, the left side is the first vector pattern and the second vector pattern before adjustment, and the right side is the first vector pattern and the second vector pattern after adjustment.

The specific adjustment modes of the contour of the first vector graphic and the contour of the second vector graphic are executed on the premise that the first vector graphic is the vector graphic where the road is located and the second vector graphic is the vector graphic where the building is located. The outline adjustment modes of other preset vector graphics except the preset vector graphics of the road and the preset vector graphics of the building can be adaptively adjusted according to actual conditions, and the mutual capping area can be eliminated after outline adjustment.

In one embodiment, as shown in fig. 4, step S102 includes:

s401, determining element categories of feature elements of each preset vector graph in the preset vector graph set;

the element categories to which the ground feature elements belong include a plurality of categories such as buildings, roads and auxiliary facilities thereof, public facilities, pipelines and grids, water systems and auxiliary facilities thereof, and the like.

S402, dividing the preset vector graphic set according to the element categories to obtain a plurality of preset vector graphic subsets, wherein the element categories to which the feature elements of the preset vector graphics in different preset vector graphic subsets belong are different;

Specifically, the preset vector graphics of the feature elements of the same element category in the preset vector graphics set are divided into the same preset vector graphics sub-set, and the preset vector graphics of the feature elements of different element categories are divided into different preset vector graphics sub-sets, so that a plurality of preset vector graphics sub-sets are obtained. For example, after the preset vector graphic set is divided, a preset vector graphic subset corresponding to the building and a preset vector graphic subset corresponding to the road are obtained.

S403, determining a first vector graphic and a second vector graphic with mutual capping conditions according to whether preset vector graphics in different vector graphic subsets are at least partially overlapped, wherein the first vector graphic and the second vector graphic belong to different preset vector graphic subsets.

It can be understood that, when the ground feature elements are measured in the field, the measurement modes of the ground feature elements in different element categories are different, so that the situation of mutual capping often occurs between preset vector graphics where the ground feature elements in different element categories are located. The gland detection is performed for preset vector graphics in different vector graphics subsets, namely, a first vector graphics and a second vector graphics with mutual gland conditions are determined according to whether the preset vector graphics in the different vector graphics subsets are at least partially overlapped.

In one embodiment, topology checking techniques commonly used in geographic information systems (Geographic Information System, GIS) are employed to detect whether there is at least partial overlap between preset vector graphics in different vector graphics subsets. Topology inspection refers to objects in the topological structures of checkpoints, lines and surface data sets, which do not accord with topological rules. The topology rule is set to be incapable of being overlapped and is applied to different vector graphics subsets, and after topology inspection, a first vector graphic and a second vector graphic with mutual capping conditions are obtained.

The specific logic of topology checking is as follows: taking a vector graphic subset with element type as a building and a vector graphic subset with element type as a road as an example, taking the vector graphic subset with element type as the building as a building dictionary and taking the vector graphic subset with element type as the road as a road dictionary. Initializing a preset capping unit dictionary, wherein the preset capping unit dictionary comprises a plurality of capping groups, each capping group comprises a single (a plurality of) building and a single (a plurality of) road with mutual capping conditions, initializing the current capping times and an array for recording road serial numbers with the mutual capping conditions. Traversing the preset vector graphics of each building in the building dictionary and the preset vector graphics of each road in the road dictionary, and judging whether the preset vector graphics of each building and the preset vector graphics of each road are at least partially overlapped or not. If at least partial overlapping is carried out, the road sequence number of the current road is recorded, and the current capping times are updated. After traversing the preset vector graph of the current building and the preset vector graph of all roads, checking an array of recorded road numbers, and checking whether each road number in the array exists in a gland unit dictionary or not, wherein the method comprises the following specific operations: determining the road sequence number in the array of the recorded road sequence numbers, searching the road sequence number in the gland unit dictionary, if the road sequence number is found in the gland unit dictionary, recording the building sequence number of the preset vector graph where the current building is located in the gland group with the road sequence number, and then traversing the preset vector graph where the next building is located and the preset vector graphs where all roads are located. If the road number cannot be found in the gland unit dictionary, a gland group is newly built in the gland unit dictionary, and the building number and the road number of the preset vector graph where the current building is located are recorded. And after the traversal of the preset vector graphics of all buildings and the preset vector graphics of all roads is finished, obtaining a gland unit dictionary containing a plurality of gland groups. The plurality of gland groups in the gland unit dictionary are classified into four gland group types as one-to-one, one-to-many, many-to-one, many-to-many and many-to-many as shown in fig. 8 according to the number of building numbers and road numbers in a single gland group. The one-to-one representation is that the preset vector graphics of a single building and the preset vector graphics of a single road are mutually covered. For the situation that the one-to-many, many-to-one, many-to-many and the like contain a plurality of preset vector graphics and at least one preset vector graphics and mutual gland occurs, the situation is split into a plurality of one-to-one gland groups. Taking a preset vector graph corresponding to the road number in the same gland group as a first vector graph, and taking a preset vector graph corresponding to the building number in the same gland group as a second vector graph, so as to obtain the first vector graph and the second vector graph with the mutual gland condition.

As shown in fig. 5, an embodiment of the present application provides a capping device 500 for electronic map elements, including:

the image obtaining module 510 is configured to obtain a preset vector image in which each feature element in the electronic map of the target area is located, so as to obtain a preset vector image set;

the gland detection module 520 is configured to determine, in a preset vector graphic set, a first vector graphic and a second vector graphic in which a mutual gland condition exists;

the gland classification module 530 is configured to determine a gland type to which a mutual gland condition between the first vector graphic and the second vector graphic belongs;

the gland removal module 540 is configured to determine a gland removal policy of a gland type, and execute the gland removal policy to remove a mutual gland condition between the first vector graphic and the second vector graphic.

In this embodiment, the graph acquisition module 510 in the gland eliminating device 500 for electronic map elements acquires preset vector graphs of feature elements in the electronic map of the target area to obtain a preset vector graph set, the gland detection module 520 determines, in the preset vector graph set, a first vector graph and a second vector graph in which a mutual gland condition exists, the gland classification module 530 determines a gland type to which the mutual gland condition between the first vector graph and the second vector graph belongs, the gland elimination module 540 determines a gland elimination policy for the gland type, and executes the gland elimination policy to eliminate the mutual gland condition between the first vector graph and the second vector graph without manual operation to eliminate the gland, thereby improving the elimination efficiency and accuracy of the gland phenomenon.

In some embodiments of the present application, the gland classification module 530 is specifically configured to determine an end line segment in a contour of the first vector graphic, where the contour of the first vector graphic includes the end line segment and a side line segment; determining a mutual capping area of the first vector graphic and the second vector graphic; if the end line segment intersects with the mutual gland area, determining the gland type as that the end line segment is fully capped or the end line segment is partially capped according to the length of the intersecting line segment between the mutual gland area and the end line segment; if the end line segment is not intersected with the mutual gland area, determining that the gland type is that the end line segment is not gland.

In some embodiments of the present application, the gland removing module 540 is further configured to determine a gland depth between the first vector graphic and the second vector graphic if the gland type is that the end line segment is not gland; if the gland depth is shallow gland, judging that the second vector graph is inaccurate, and adjusting the outline of the second vector graph according to the mutual gland area so as to eliminate the mutual gland area; if the depth of the gland is the depth gland, judging that the first vector graphic and the second vector graphic are inaccurate, and adjusting the outline of the first vector graphic and the outline of the second vector graphic according to the mutual gland area so as to eliminate the mutual gland area.

In some embodiments of the present application, gland removal module 540 is also configured to determine a central region of the first vector graphic; if the central area is at least partially overlapped with the mutual capping area, determining the capping depth degree between the first vector graphic and the second vector graphic as a depth capping; and if the central area is not overlapped with the mutual capping area, determining that the capping depth degree between the first vector graphic and the second vector graphic is a shallow capping.

In some embodiments of the present application, the gland removing module 540 is further configured to determine a line segment edge intersecting the first vector graphic from a plurality of line segment edges included in the outline of the second vector graphic; determining a line segment edge to be translated from line segment edges intersected with the first vector graph; and translating the line segment edges to be translated along the orthogonal direction of the line segment edges to be translated until the mutual capping area is eliminated.

In some embodiments of the present application, gland removal module 540 is further configured to determine an intersection of the contour of the first vector graphic and the contour of the second vector graphic; determining a target line segment nearest to the intersection point from a plurality of line segments contained in the central line of the road; determining the symmetry point of the intersection point relative to the target line segment; generating a new line segment for replacing the target line segment based on the symmetry point, wherein the new line segment comprises the symmetry point; replacing a target line segment with a new line segment to obtain an adjusted road center line; and adjusting the contour of the first vector graph based on the adjusted road center line.

In some embodiments of the present application, the gland eliminating device of the electronic map element further includes a checking module, where the checking module is configured to obtain a first area of the second vector graphic after the gland eliminating policy is executed, and a second area of the second vector graphic before the gland eliminating policy is executed; determining an area ratio between the first area and the second area; and if the area ratio is larger than the preset ratio, judging that the gland eliminating strategy is qualified to execute.

In some embodiments of the present application, the gland eliminating module 540 is further configured to determine that the first vector graphic is inaccurate if the gland type is that the end line segment is fully capped, and adjust the contour of the first vector graphic according to the region of the mutual capping, so as to eliminate the region of the mutual capping.

In some embodiments of the present application, the gland removal module 540 is further configured to determine a gland depth between the first vector graphic and the second vector graphic if the gland type is that the end line segment is partially gland; if the gland depth is shallow gland, judging that the second vector graph is inaccurate, and adjusting the outline of the second vector graph according to the mutual gland area so as to eliminate the mutual gland area; if the depth of the gland is the depth gland, judging that the first vector graph is inaccurate, and adjusting the outline of the first vector graph according to the mutual gland area so as to eliminate the mutual gland area.

In some embodiments of the present application, the capping elimination module 540 is further configured to delete a portion of the first vector graphic that belongs to the region of mutual capping, so as to eliminate the region of mutual capping.

In some embodiments of the present application, the gland detection module 520 is specifically configured to determine an element category to which a feature element of each preset vector graphic in the preset vector graphic set belongs; dividing the preset vector graphic sets according to element categories to obtain a plurality of preset vector graphic subsets, wherein element categories to which feature elements of the preset vector graphics in different preset vector graphic subsets belong are different; determining a first vector graph and a second vector graph with mutual capping conditions according to whether preset vector graphs in different vector graph subsets are at least partially overlapped; wherein the first vector graphic and the second vector graphic belong to different preset vector graphic subsets.

In some embodiments of the present application, the capping device 500 of the electronic map element may be implemented in the form of a computer program that is executable on a computer device as shown in fig. 6. The memory of the computer device may store various program modules that make up the gland removal 500 of the electronic map element, such as the graph acquisition module 510, gland detection module 520, gland classification module 530, and gland removal module 540 shown in fig. 5. The computer program constituted by the respective program modules causes the processor to execute the steps in the gland eliminating method of the electronic map element of the respective embodiments of the present application described in the present specification.

For example, the computer apparatus shown in fig. 6 may perform step S101 through the graphic acquisition module 510 in the capping elimination apparatus 500 of the electronic map element as shown in fig. 5. The computer device may perform step S102 through the gland detection module 520. The computer device may perform step S103 by the gland classification module 530. The computer device may perform steps S104 and S105 through the gland removal module 540. The computer device includes a processor, a memory, and a network interface connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. 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 and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The network interface of the computer device is used for communicating with an external computer device through a network connection. The computer program when executed by a processor implements a method of gland elimination for electronic map elements.

It will be appreciated by those skilled in the art that the structure shown in fig. 6 is merely a block diagram of some of the structures associated with the present application and is not limiting of the computer device to which the present application may be applied, and that a particular computer device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.

In some embodiments of the present application, a computer device is provided that includes one or more processors; a memory; and one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to perform the steps of the above described method of gland removal of electronic map elements. The step of the method for eliminating the gland of the electronic map element may be a step in the method for eliminating the gland of the electronic map element of each of the above embodiments.

In some embodiments of the present application, a computer readable storage medium is provided, in which a computer program is stored, where the computer program is loaded by a processor, so that the processor performs the steps of the above-mentioned method for eliminating the gland of the electronic map element. The step of the method for eliminating the gland of the electronic map element may be a step in the method for eliminating the gland of the electronic map element of each of the above embodiments.

Those of ordinary skill in the art will appreciate that implementing all or part of the above-described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in the various embodiments provided herein can include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, or the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory. By way of illustration, and not limitation, RAM can take many forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), among others.

The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.

The above describes in detail the method for eliminating the gland of the electronic map element and the storage medium provided by the embodiment of the present application, and specific examples are applied to the description of the principle and the implementation of the present invention, and the description of the above embodiments is only used to help understand the method and the core idea of the present invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in light of the ideas of the present invention, the present description should not be construed as limiting the present invention.

Claims

1. A method for eliminating gland of electronic map elements, the method comprising:

determining a gland removal strategy for the gland type;

2. The method for eliminating the gland of the electronic map element according to claim 1, wherein said determining the gland type to which the mutual gland condition between the first vector graphic and the second vector graphic belongs includes:

3. The method of claim 2, wherein said executing the gland removal policy to remove a mutual gland condition between the first vector graphic and the second vector graphic comprises:

4. The method of eliminating a capping of an electronic map element of claim 3, wherein said determining a degree of capping between said first vector graphic and said second vector graphic comprises:

Determining a central region of the first vector graphic;

5. The method of eliminating the cover of the electronic map element according to claim 3, wherein the adjusting the outline of the second vector graphic includes:

6. The method for eliminating the cover of the electronic map element according to claim 3, wherein the feature element represented by the first vector graphic is a road, the first vector graphic includes a road center line of the road, the road center line is formed by splicing a plurality of line segments, and the adjusting the contour of the first vector graphic includes:

7. The method of claim 3, wherein after said executing said capping policy to remove a capping condition between said first vector graphic and said second vector graphic, further comprising:

determining an area ratio between the first area and the second area;

8. The method of claim 2, wherein said executing the gland removal policy to remove a mutual gland condition between the first vector graphic and the second vector graphic comprises:

9. The method of claim 2, wherein said executing the gland removal policy to remove a mutual gland condition between the first vector graphic and the second vector graphic comprises:

10. The method of claim 8 or 9, wherein adjusting the contour of the first vector graphic to eliminate the region of mutual capping comprises:

11. The method for eliminating the gland of the electronic map element according to claim 1, wherein the determining, in the preset vector graphic set, the first vector graphic and the second vector graphic in which the mutual gland condition exists includes:

12. A computer-readable storage medium, having stored thereon a computer program, the computer program being loaded by a processor to perform the steps in the method of gland removal of electronic map elements according to any one of claims 1 to 11.