CN107239461B - Road island determination method and device - Google Patents
Road island determination method and device Download PDFInfo
- Publication number
- CN107239461B CN107239461B CN201610183449.5A CN201610183449A CN107239461B CN 107239461 B CN107239461 B CN 107239461B CN 201610183449 A CN201610183449 A CN 201610183449A CN 107239461 B CN107239461 B CN 107239461B
- Authority
- CN
- China
- Prior art keywords
- aggregation
- route calculation
- road
- coordinate
- point
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Abstract
The application discloses a road island determining method and device, and the method comprises the following steps: the method comprises the steps of obtaining a plurality of route calculation requests comprising a starting point coordinate and an end point coordinate, wherein the route calculation requests are route calculation requests that a route calculation engine does not successfully give a route calculation result, further carrying out point aggregation on coordinate points in a coordinate point set consisting of the starting point coordinate and the end point coordinate in the route calculation requests to obtain a plurality of aggregation points, and taking the aggregation points as candidate road islands so as to determine the road islands from the candidate road islands. Because the road calculation engine does not successfully give the road calculation request of the road calculation result, at least one of the start point coordinate and the end point coordinate of the road calculation engine is the road island, the aggregation point is used as the candidate road island, only peripheral road connectivity of the candidate road island needs to be checked, whether the candidate road island is the road island or not is determined, the query range of the road island is greatly reduced, and compared with the prior art, the road island can be determined quickly and efficiently.
Description
Technical Field
The present application relates to the field of path computation technologies, and in particular, to a method and an apparatus for determining a road island.
Background
The meaning of road island is: if the roads around a certain position have no connectivity with the external roads, the position is the road island.
The existence of the road island influences the path calculation service, and therefore the road island is expected to be found out early. However, due to the complexity of the road network, if we traverse the road conditions near each coordinate one by one in the electronic map, the island search will take a lot of time. Therefore, a scheme is urgently needed in the prior art, and the road island can be determined quickly and efficiently.
Disclosure of Invention
In view of this, the present application provides a road island determination method and apparatus, which are used for determining a road island quickly and efficiently.
In order to achieve the above object, the following solutions are proposed:
a road island determination method, comprising:
obtaining a plurality of route calculation requests containing starting point coordinates and end point coordinates, wherein the route calculation requests are route calculation requests for which a route calculation engine does not successfully give a route calculation result;
and performing point aggregation on coordinate points of the starting point coordinates and the end point coordinates in the multiple road calculation requests to obtain multiple aggregation points, and taking the multiple aggregation points as candidate road islands so as to determine the road islands from the candidate road islands.
A road island determination device, comprising:
the system comprises a route calculation request acquisition unit, a route calculation engine and a route calculation engine, wherein the route calculation request acquisition unit is used for acquiring a plurality of route calculation requests containing starting point coordinates and end point coordinates, and the route calculation requests are route calculation requests for which the route calculation engine does not successfully give a route calculation result;
and the aggregation unit is used for carrying out point aggregation on coordinate points of the starting point coordinates and the end point coordinates in the multiple road calculation requests to obtain multiple aggregation points, and taking the multiple aggregation points as candidate road islands so as to determine the road islands from the candidate road islands.
It can be seen from the foregoing technical solutions that, in the road island determination method provided in the embodiments of the present application, multiple route calculation requests including a start point coordinate and an end point coordinate are obtained, where the route calculation requests are route calculation requests in which a route calculation result is not successfully given by a route calculation engine, and further, coordinate points of the start point coordinate and the end point in the multiple route calculation requests are point aggregated to obtain multiple aggregation points, and the multiple aggregation points are used as candidate road islands, so as to determine a road island from the candidate road islands. Because the road calculation engine does not successfully give the road calculation request of the road calculation result, at least one of the start point coordinate and the end point coordinate of the road calculation engine is the road island, the aggregation point is used as the candidate road island, only peripheral road connectivity of the candidate road island needs to be checked, whether the candidate road island is the road island or not is determined, the query range of the road island is greatly reduced, and compared with the prior art, the road island can be determined quickly and efficiently.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a road island determination method disclosed in an embodiment of the present application;
fig. 2 is a flowchart of another road island determination method disclosed in the embodiment of the present application;
fig. 3 is a flowchart of another road island determination method disclosed in the embodiment of the present application;
FIG. 4 is a schematic diagram of an exemplary R-Tree according to an embodiment of the present application;
FIG. 5 is a flowchart illustrating an example of a method for constructing an R-Tree according to an embodiment of the present application;
fig. 6 is a flowchart of a method for projecting an aggregation point onto an electronic map and marking an aggregation value according to an embodiment of the present application;
7-9 are graphs of the display effect of the aggregation point of the electronic map at different zoom levels according to the embodiment of the present application;
fig. 10 is a schematic structural diagram of a road island determination device disclosed in an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart of a road island determination method disclosed in an embodiment of the present application.
As shown in fig. 1, the method includes:
step S100, obtaining a plurality of route calculation requests containing starting point coordinates and end point coordinates, wherein the route calculation requests are route calculation requests of a route calculation result which are not successfully given by a route calculation engine;
specifically, the user sends a route calculation request to a route calculation engine, the route calculation request includes a start point coordinate and an end point coordinate, and the route calculation engine is requested to give a feasible route from the start point coordinate to the end point coordinate. The route calculation engine calculates a route according to the start point coordinate and the end point coordinate, if the route meeting the condition exists in the route network, the route calculation engine gives a route calculation result, and if the route meeting the condition does not exist in the route network, the route calculation engine cannot successfully give the route calculation result.
The route calculation request obtained by the application is the route calculation request of the route calculation result which is not successfully given by the route calculation engine.
And step S110, carrying out point aggregation on coordinate points of the starting point coordinates and the end point coordinates in the route calculation requests to obtain a plurality of aggregation points, and taking the aggregation points as candidate road islands.
Specifically, the previous step obtains a plurality of route calculation requests, a coordinate point set is formed by using the start point coordinates and the end point coordinates in the plurality of route calculation requests, and then point aggregation is performed on each coordinate point in the coordinate point set to obtain a plurality of aggregation points. The point aggregation may use an existing aggregation algorithm, such as a distance-based point aggregation algorithm.
Because the road calculation engine does not successfully give a road calculation request of a road calculation result, and at least one of the start point coordinate and the end point coordinate of the road calculation engine is a road island, a plurality of aggregation points obtained by point aggregation are used as candidate road islands, and the road islands can be determined from the candidate road islands subsequently.
Determining the road island from the candidate road island may be performed by a worker, for example, the worker checks road connectivity near the candidate road island, and then determines whether the candidate road island is the road island.
The method for determining the road island includes the steps of obtaining a plurality of route calculation requests including a start point coordinate and an end point coordinate, wherein the route calculation requests are route calculation requests that a route calculation engine does not successfully provide a route calculation result, further performing point aggregation on coordinate points of the start point coordinate and the end point coordinate in the plurality of route calculation requests to obtain a plurality of aggregation points, and using the aggregation points as candidate road islands so as to determine the road island from the candidate road islands. Because the road calculation engine does not successfully give the road calculation request of the road calculation result, at least one of the start point coordinate and the end point coordinate of the road calculation engine is the road island, the aggregation point is used as the candidate road island, only peripheral road connectivity of the candidate road island needs to be checked, whether the candidate road island is the road island or not is determined, the query range of the road island is greatly reduced, and compared with the prior art, the road island can be determined quickly and efficiently.
Referring to fig. 2, fig. 2 is a flowchart of another road island determination method disclosed in the embodiment of the present application.
As shown in fig. 2, the method includes:
step S200, acquiring a service log of a route calculation engine;
specifically, the service log of the routing engine records a start coordinate, an end coordinate and a routing result of each routing request.
And when the user needs to carry out path service, the user accesses the path calculation engine and submits a path calculation request containing the starting point coordinates and the end point coordinates. The route calculation engine calculates the route according to the route calculation request and records the route calculation result of each route calculation request. The way finding result has two kinds, one is the way finding success, and the other is the way finding failure.
Step S210, screening a routing calculation request with a routing calculation result as a failure in the service log;
specifically, after a sufficient number of route calculation requests are accumulated in the service log of the route calculation engine, a route calculation request with a failed route calculation result is screened from the service log.
And step S220, carrying out point aggregation on coordinate points of the starting point coordinate and the end point coordinate in the route calculation requests to obtain a plurality of aggregation points, and taking the aggregation points as candidate road islands.
In particular, road islands may subsequently be determined from the candidate road islands.
The embodiment of the application provides a specific implementation mode for obtaining a route calculation request. That is, the service log of the route calculation engine is screened out the route calculation request with the route calculation result of failure. Of course, in addition, the route calculation request may be obtained by a third party, and the present application is not limited strictly.
Optionally, in the above embodiment, the service log of the routing engine may further record the request time of each routing request. That is, the routing engine records the following information of the routing request: 1. a request time; 2. obtaining a path result; 3. a starting point coordinate; 4. and (4) end point coordinates.
Based on this, in step S200, the process of obtaining the service log of the routing engine may be to select a routing request in the target time period according to the request time. For example, way calculation requests between 2015.1.1-2016.1.1 are obtained.
Since the map data is continuously updated, the route calculation request too long from the current time may have failed, and for the accuracy of the algorithm, the application may set a time range, and only obtain the route calculation request whose request time is within the time range.
Referring to fig. 3, fig. 3 is a flowchart of another road island determination method disclosed in the embodiment of the present application.
As shown in fig. 3, the method includes:
step S300, obtaining a plurality of route calculation requests containing starting point coordinates and end point coordinates, wherein the route calculation requests are route calculation requests of a route calculation result which are not successfully given by a route calculation engine;
specifically, the user sends a route calculation request to a route calculation engine, the route calculation request includes a start point coordinate and an end point coordinate, and the route calculation engine is requested to give a feasible route from the start point coordinate to the end point coordinate. The route calculation engine calculates a route according to the start point coordinate and the end point coordinate, if the route meeting the condition exists in the route network, the route calculation engine gives a route calculation result, and if the route meeting the condition does not exist in the route network, the route calculation engine cannot successfully give the route calculation result.
The route calculation request obtained by the application is the route calculation request of the route calculation result which is not successfully given by the route calculation engine.
Step S310, carrying out point aggregation on coordinate points of a starting point coordinate and an end point coordinate in the multiple route calculation requests to obtain multiple aggregation points, and taking the multiple aggregation points as candidate road islands;
specifically, the previous step obtains a plurality of route calculation requests, a coordinate point set is formed by using the start point coordinates and the end point coordinates in the plurality of route calculation requests, and then point aggregation is performed on each coordinate point in the coordinate point set to obtain a plurality of aggregation points.
Because the road calculation engine does not successfully give a road calculation request of a road calculation result, and at least one of the start point coordinate and the end point coordinate of the road calculation engine is a road island, a plurality of aggregation points obtained by point aggregation are used as candidate road islands, and the road islands can be determined from the candidate road islands subsequently.
Step S320, determining an aggregation value of the aggregation point, where the aggregation value represents the number of coordinate points aggregated by the aggregation point.
It can be understood that for the case of an island starting point, most of the requests with failed route calculation and similar starting points have different end points. Similarly, when the end point is an island, the starting points of most requests are different. Therefore, the polymerization points obtained after polymerization are different from each other in polymerization value. The larger the aggregate value, the greater the likelihood that the corresponding aggregate point is road island. Therefore, the judgment range of the road island can be further narrowed through the aggregation value of the aggregation point, and the troubleshooting workload of workers is reduced.
Further optionally, on the basis of the above embodiment, the application may further project the aggregation point onto the electronic map, and mark the aggregation value of the aggregation point in the electronic map.
By displaying the aggregation result on the electronic map, the situation that the aggregation value of a certain area is large and the aggregation value of other areas is scattered sporadically is small can occur on the electronic map, so that a worker can screen out the aggregation point with the large aggregation value, and then whether the aggregation point is a road island or not is determined according to the connectivity of roads around the aggregation point on the electronic map, and the speed of determining the road island by the worker is increased.
In yet another embodiment of the present application, an alternative to point aggregation of coordinate points from a plurality of start point coordinates, end point coordinates in the routing request is presented.
The method comprises the steps that a coordinate point set is formed by starting point coordinates and end point coordinates in a plurality of route calculation requests; and further carrying out multilevel aggregation on the coordinate points in the coordinate point set, and forming a space tree by aggregation results.
The hierarchy of the space tree corresponds to the scalable level of a scale of an electronic map one by one, coordinate points in a coordinate point set correspond to leaf nodes of the space tree one by one, a father node of any node in the space tree is an aggregation point obtained by aggregating all child nodes of the father node, an aggregation value is recorded in any node of a non-leaf node in the space tree, and the aggregation value is the number of all leaf nodes of a tree structure taking the node as a root node.
In the embodiment of the present invention, the spatial Tree is preferably an R-Tree, but is not limited to an R-Tree, see fig. 4, and fig. 4 is a schematic diagram of an R-Tree exemplified in the embodiment of the present application.
Assuming that the scale of the electronic map has a scalable order of 3, there are 5 coordinate points in the set of coordinate points, a1-a 5.
Referring to FIG. 4, 5 coordinate points A1-A5 in the set of coordinate points serve as the first level nodes of the R-Tree, i.e., leaf nodes.
Performing point aggregation operation on 5 nodes A1-A5 of the first layer, and aggregating the nodes A1-A3 to obtain a node A6; node A7 is obtained by aggregation of A4-A5. In the R-Tree, the node a6 is a parent node of the nodes a1-A3, the aggregate value of the node a6 is the total number of leaf nodes in the Tree structure with the node a6 as a root node, and the aggregate value F of the node a6 is 3. In the R-Tree, the node a7 is a parent node of the nodes a4-a5, the aggregate value of the node a7 is the total number of leaf nodes in the Tree structure with the node a7 as a root node, and the aggregate value F of the node a7 is 2.
Node A6 and node A7 serve as the second level nodes of the R-Tree.
And performing point aggregation operation on 2 nodes of the A6 and the A7 of the second layer, and aggregating the A6 and the A7 to obtain a node A8. In the R-Tree, the node A8 serves as a parent node of the nodes a6 and a7, the aggregate value of the node A8 is the total number of leaf nodes in the Tree structure with the node A8 as a root node, and the aggregate value F of the node A8 is 5.
Node A8 serves as the third level node of the R-Tree.
In summary, the scalable levels of the electronic map are the same as the levels of the R-Tree, and correspond to each other. The first zoom level of the electronic map corresponds to a first level of the R-Tree Tree; the second zoom level of the electronic map corresponds to a second level of the R-Tree Tree; the third zoom level of the electronic map corresponds to a third level of the R-Tree.
The first zoom level > the second zoom level > the third zoom level, and the larger the zoom level is, the higher the magnification of the electronic map is, the more detailed the displayed map information is.
The above embodiment introduces the structure of the R-Tree formed by performing multilevel aggregation on coordinate points in the coordinate point set and aggregating the results. Reference may be made to fig. 5 for the construction of an R-Tree.
As shown in fig. 5:
step S500, determining the scalable grade number of the scale of the electronic map;
step S510, determining coordinate points in the coordinate point set as points to be aggregated, and determining the points to be aggregated as nodes of the same layer in the R-Tree;
and the coordinate point set consists of a starting point coordinate and an end point coordinate in a plurality of route calculation requests.
Step S520, judging whether the hierarchy number of the R-Tree reaches the scalable hierarchy number, if so, executing step S530, and if not, executing step S540;
step S530, ending and outputting the R-Tree;
step S540, aggregating the points to be aggregated to obtain a plurality of aggregation points, determining the aggregation points as father nodes of the nodes corresponding to the aggregated points to be aggregated in the R-Tree, and recording aggregation values in the father nodes;
and the aggregation numerical value is the number of all leaf nodes of the tree structure taking the father node as the root node.
And step S550, determining the aggregation point as the point to be aggregated, and returning to execute the step S520.
Based on the process disclosed in the foregoing embodiment, the coordinate points in the coordinate point set are aggregated in multiple levels, and an R-Tree is formed by using the aggregation result.
Referring to fig. 6, fig. 6 is a flowchart of a method for projecting an aggregation point onto an electronic map and marking an aggregation value, according to an embodiment of the present application.
As shown in fig. 6, the process includes:
s600, determining the current zooming grade number of the scale of the electronic map;
in particular, the above embodiments have described that the scale of the electronic map may have a plurality of zoom levels, and the current zoom level number of the scale of the electronic map is determined in this step.
Step S610, determining a corresponding level in the R-Tree according to the current scaling level;
it has been introduced above that different zoom levels of the scale of the electronic map all have corresponding levels in the R-Tree, so that the level in the R-Tree corresponding to the current zoom level number is determined in this step.
And S620, projecting the determined nodes of the corresponding hierarchy onto the electronic map, and marking the aggregation numerical values of the projected nodes in the electronic map.
Specifically, under the current zoom level of the electronic map, the determined nodes of the corresponding hierarchy are projected to corresponding positions on the electronic map, and the aggregation values of the projected nodes are marked in the electronic map.
According to the projection method of the embodiment, the staff can control the zoom level of the electronic map, and different aggregation points and aggregation values can be seen on the electronic map with different zoom levels.
Referring to fig. 7-9, fig. 7-9 are graphs illustrating the display effect of the aggregation point of the electronic map at different zoom levels according to the embodiment of the present application.
Fig. 7 shows the display effect at the third zoom level, fig. 8 shows the display effect at the second zoom level, and fig. 9 shows the display effect at the first zoom level.
The staff can see the aggregation result of each important province in the country under the first zoom level, and the larger the aggregation value of the aggregation point is, the higher the possibility that the province contains the road island is, and conversely, the lower the possibility that the province contains the road island is.
For example, the worker selects Guangzhou City for zoom-in, and at the second zoom level, FIG. 8 locates "Baoli. Dongjiang Seffu" in Guangzhou City, which has an aggregate value of 11, representing that there are 11 coordinate points aggregated under this point.
Further zooming in on "baoli. east river first house" shows the effect as shown in fig. 9 at the third zoom level. The black flag descendant points in FIG. 9 are shown. The staff can check the road connectivity near each coordinate point in fig. 9, and then determine whether the coordinate point is a road island.
In summary, a worker can select an aggregation point with an aggregation value exceeding a threshold value from the electronic map at the minimum amplification level, and further amplify the aggregation point step by step until a coordinate point in the electronic map at the maximum amplification level is located, and determine whether the coordinate point is a road island. For the aggregation point with the aggregation value lower than the threshold value, the aggregation point is determined not to contain the road island, so that the road island is not checked, and the screening workload of the road island is reduced.
The following describes the road island determination device provided in the embodiment of the present application, and the road island determination device described below and the road island determination method described above may be referred to correspondingly.
Referring to fig. 10, fig. 10 is a schematic structural diagram of a road island determination device disclosed in the embodiment of the present application.
As shown in fig. 10, the apparatus includes:
a route calculation request obtaining unit 10, configured to obtain multiple route calculation requests including a start coordinate and an end coordinate, where the route calculation requests are route calculation requests in which a route calculation engine does not successfully provide a route calculation result;
and the aggregation unit 11 is configured to perform point aggregation on coordinate points of the start point coordinate and the end point coordinate in the multiple route calculation requests to obtain multiple aggregation points, and use the multiple aggregation points as candidate road islands so as to determine the road islands from the candidate road islands.
According to the road island determining device provided by the embodiment of the application, a route calculation request obtaining unit obtains a plurality of route calculation requests comprising a starting point coordinate and an end point coordinate, the route calculation requests are route calculation requests for a route calculation result which is not successfully given by a route calculation engine, an aggregation unit carries out point aggregation on coordinate points of the starting point coordinate and the end point coordinate in the route calculation requests to obtain a plurality of aggregation points, and the aggregation points are used as candidate road islands so as to determine the road island from the candidate road islands. Because the road calculation engine does not successfully give the road calculation request of the road calculation result, at least one of the start point coordinate and the end point coordinate of the road calculation engine is the road island, the aggregation point is used as the candidate road island, only peripheral road connectivity of the candidate road island needs to be checked, whether the candidate road island is the road island or not is determined, the query range of the road island is greatly reduced, and compared with the prior art, the road island can be determined quickly and efficiently.
Optionally, the route calculation request obtaining unit may include:
the service log acquiring unit is used for acquiring a service log of the route calculation engine, and the service log records a starting point coordinate, an end point coordinate and a route calculation result of each route calculation request;
and the route calculation request screening unit is used for screening the route calculation request with the failed route calculation result in the service log.
Optionally, the road island determining apparatus of the present application may further include:
an aggregation value determination unit configured to determine an aggregation value of the aggregation point, the aggregation value indicating a number of coordinate points at which the aggregation points are aggregated.
Optionally, the road island determining apparatus of the present application may further include:
and the projection unit is used for projecting the aggregation point onto the electronic map and marking the aggregation value of the aggregation point in the electronic map.
Optionally, the polymerization unit may include:
the first aggregation subunit is used for carrying out multilevel aggregation on coordinate points in a coordinate point set consisting of starting point coordinates and end point coordinates in the route calculation requests, and aggregation results form a space tree;
the hierarchy of the space tree corresponds to the scalable level of the scale of the electronic map one by one, coordinate points in a coordinate point set correspond to leaf nodes of the space tree one by one, a father node of any node in the space tree is an aggregation point obtained by aggregating all child nodes of the father node, an aggregation value is recorded in any node of a non-leaf node in the space tree, and the aggregation value is the number of all leaf nodes of a tree structure taking the node as a root node.
Based on the spatial tree obtained by the first aggregation subunit, the projection unit may include:
the first projection subunit is used for determining the current zoom grade number of the scale of the electronic map;
the second projection subunit is used for determining a corresponding level in the spatial tree according to the current scaling level;
and the third projection subunit is used for projecting the determined nodes of the corresponding hierarchy onto the electronic map and marking the aggregation numerical values of the projected nodes in the electronic map.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A road island determination method, wherein the road island is a position where a surrounding road has no connectivity with an external road, the method comprising:
obtaining a plurality of route calculation requests containing starting point coordinates and end point coordinates, wherein the route calculation requests are route calculation requests for which a route calculation engine does not successfully give a route calculation result;
and performing point aggregation on coordinate points of the starting point coordinates and the end point coordinates in the multiple road calculation requests to obtain multiple aggregation points, and taking the multiple aggregation points as candidate road islands so as to determine the road islands from the candidate road islands.
2. The method of claim 1, wherein obtaining a plurality of way calculation requests comprising start point coordinates and end point coordinates comprises:
acquiring a service log of a route calculation engine, wherein the service log records a start point coordinate, an end point coordinate and a route calculation result of each route calculation request;
and screening the route calculation request with the route calculation result as failure in the service log.
3. The method of claim 1, wherein point-aggregating coordinate points of start-point coordinates and end-point coordinates in the plurality of routing requests comprises:
carrying out multilevel aggregation on coordinate points of a starting point coordinate and a terminal point coordinate in the route calculation requests, and forming a space tree by aggregation results;
the hierarchy of the space tree corresponds to the scalable level of a scale of an electronic map one by one, coordinate points in a coordinate point set correspond to leaf nodes of the space tree one by one, a father node of any node in the space tree is an aggregation point obtained by aggregating each child node of the father node, an aggregation value is recorded in any node of a non-leaf node in the space tree, and the aggregation value is the number of all leaf nodes of a tree structure taking the node as a root node.
4. The method of claim 3, further comprising:
and projecting the aggregation point onto the electronic map, and marking the aggregation value of the aggregation point in the electronic map.
5. The method of claim 4, wherein projecting the aggregation point onto an electronic map and marking the aggregation value of the aggregation point in the electronic map comprises:
determining the current zoom grade number of a scale of the electronic map;
determining a corresponding level in the spatial tree according to the current scaling level;
and projecting the determined nodes of the corresponding hierarchy onto the electronic map, and marking the aggregation values of the projected nodes in the electronic map.
6. A road island determination device, the road island is a position where peripheral roads have no connectivity with external roads, the device comprises:
the system comprises a route calculation request acquisition unit, a route calculation engine and a route calculation engine, wherein the route calculation request acquisition unit is used for acquiring a plurality of route calculation requests containing starting point coordinates and end point coordinates, and the route calculation requests are route calculation requests for which the route calculation engine does not successfully give a route calculation result;
and the aggregation unit is used for carrying out point aggregation on coordinate points of the starting point coordinates and the end point coordinates in the multiple road calculation requests to obtain multiple aggregation points, and taking the multiple aggregation points as candidate road islands so as to determine the road islands from the candidate road islands.
7. The apparatus of claim 6, wherein the way calculation request obtaining unit comprises:
the service log acquiring unit is used for acquiring a service log of the route calculation engine, and the service log records a starting point coordinate, an end point coordinate and a route calculation result of each route calculation request;
and the route calculation request screening unit is used for screening the route calculation request with the failed route calculation result in the service log.
8. The apparatus of claim 6, wherein the aggregation unit comprises:
the first aggregation subunit is used for carrying out multilevel aggregation on coordinate points of a starting point coordinate and an end point coordinate in the route calculation requests, and aggregation results form a space tree;
the hierarchy of the space tree corresponds to the scalable level of a scale of an electronic map one by one, coordinate points in a coordinate point set correspond to leaf nodes of the space tree one by one, a father node of any node in the space tree is an aggregation point obtained by aggregating each child node of the father node, an aggregation value is recorded in any node of a non-leaf node in the space tree, and the aggregation value is the number of all leaf nodes of a tree structure taking the node as a root node.
9. The apparatus of claim 8, further comprising:
and the projection unit is used for projecting the aggregation point onto the electronic map and marking the aggregation value of the aggregation point in the electronic map.
10. The apparatus of claim 9, wherein the projection unit comprises:
the first projection subunit is used for determining the current zoom grade number of the scale of the electronic map;
the second projection subunit is used for determining a corresponding level in the spatial tree according to the current scaling level;
and the third projection subunit is used for projecting the determined nodes of the corresponding hierarchy onto the electronic map and marking the aggregation numerical values of the projected nodes in the electronic map.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610183449.5A CN107239461B (en) | 2016-03-28 | 2016-03-28 | Road island determination method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610183449.5A CN107239461B (en) | 2016-03-28 | 2016-03-28 | Road island determination method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107239461A CN107239461A (en) | 2017-10-10 |
| CN107239461B true CN107239461B (en) | 2020-08-07 |
Family
ID=59983114
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610183449.5A Active CN107239461B (en) | 2016-03-28 | 2016-03-28 | Road island determination method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107239461B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111861673A (en) * | 2020-07-28 | 2020-10-30 | 滴图(北京)科技有限公司 | Data processing method and device, readable storage medium and electronic equipment |
| CN112667758B (en) * | 2020-12-17 | 2023-04-07 | 佳都科技集团股份有限公司 | Interest point aggregation method, map aggregation display method and processing terminal |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5519619A (en) * | 1994-03-14 | 1996-05-21 | Motorola, Inc. | Route planning method for hierarchical map routing and apparatus therefor |
| CN101750089A (en) * | 2008-12-11 | 2010-06-23 | 北京四维图新科技股份有限公司 | Road network connectivity detection method and device based on mass e-maps |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014005979A1 (en) * | 2012-06-29 | 2014-01-09 | Tomtom Development Germany Gmbh | Apparatus and method for determining reachable area |
| CN103632532B (en) * | 2012-08-22 | 2015-09-30 | 北京掌城科技有限公司 | A kind of abductive approach of calling a taxi of taxi |
| CN104422461B (en) * | 2013-09-06 | 2017-09-05 | 上海博泰悦臻电子设备制造有限公司 | A kind of method for obtaining path of navigation system, air navigation aid |
| CN105335393B (en) * | 2014-07-11 | 2019-08-09 | 阿里巴巴集团控股有限公司 | A kind of map-indication method and device |
-
2016
- 2016-03-28 CN CN201610183449.5A patent/CN107239461B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5519619A (en) * | 1994-03-14 | 1996-05-21 | Motorola, Inc. | Route planning method for hierarchical map routing and apparatus therefor |
| CN101750089A (en) * | 2008-12-11 | 2010-06-23 | 北京四维图新科技股份有限公司 | Road network connectivity detection method and device based on mass e-maps |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107239461A (en) | 2017-10-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8930123B2 (en) | Systems and methods for determining traffic intensity using information obtained through crowdsourcing | |
| US11740102B2 (en) | Method, apparatus, device and storage medium for determining point of interest area | |
| CN107945507B (en) | Travel time prediction method and device | |
| US20150347478A1 (en) | Systems and methods for context-aware and personalized access to visualizations of road events | |
| US20220051032A1 (en) | Road event detection method, apparatus, device and storage medium | |
| CN101275841B (en) | Feature information collecting apparatus and feature information collecting method | |
| CN110765219B (en) | Geo-fence generation method and device, computer equipment and storage medium | |
| US20160102987A1 (en) | Method for inferring type of road segment | |
| CN107543553B (en) | Interest point updating method and device | |
| JP6374341B2 (en) | Crisis management information sharing apparatus, crisis management information sharing method, and crisis management information sharing program | |
| CN105509758A (en) | Route planning method and system based on mobile terminal and mobile terminal | |
| CN107239461B (en) | Road island determination method and device | |
| CN110197582A (en) | Data analysing method, device and traffic prewarning method, apparatus | |
| CN113626408B (en) | City information database construction method and map display method | |
| CN114003672B (en) | Method, device, equipment and medium for processing road dynamic event | |
| CN112985440A (en) | Method, device, storage medium and program product for detecting deviation of driving track | |
| CN109446286B (en) | Visualization method and device for highway road network map | |
| Tchuente et al. | Providing more regular road signs infrastructure updates for connected driving: A crowdsourced approach with clustering and confidence level | |
| WO2022193665A1 (en) | Detour path determination method and apparatus, and storage medium | |
| CN110661639A (en) | Cloud service network display method and device | |
| JP6509546B2 (en) | Image search system and image search method | |
| JP6928082B2 (en) | Urban road running speed processing methods, urban road running speed processing equipment, equipment, and non-volatile computer storage media | |
| CN110177339B (en) | OD matrix construction method and device | |
| CN107508925A (en) | A kind of method and apparatus for being used to determine the regional information of IP address | |
| US20230085486A1 (en) | Removing data contribution from aggregated and/or integrated geographic database |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200507 Address after: 310052 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province Applicant after: Alibaba (China) Co.,Ltd. Address before: 100080 Beijing City, Haidian District Suzhou Street No. 3 floor 16 room 2 Applicant before: AUTONAVI INFORMATION TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |