Generation of intersection information by a mapping service

• US 8,983,778 B2
• Filed: 09/30/2012
• Issued: 03/17/2015
• Est. Priority Date: 06/05/2012
• Status: Active Grant

• Current Assignee: Apple Inc.
• Original Assignee: Apple Inc.
• Inventors: McCarthy, Paul S.
• Primary Examiner(s): Tarcza, Thomas
• Assistant Examiner(s): GOLDMAN, RICHARD A
• Application Number:
  US13/631,995
• Publication Number:
  US 20130325339A1
• Time in Patent Office: 898 Days
• Field of Search: None
• US Class Current: 701/532
• CPC Class Codes: G01C 21/26 specially adapted for navigation in a road network
• CPC Class Codes: G01C 21/28 with correlation of data from several navigational instruments
• CPC Class Codes: G01C 21/3635 Guidance using 3D or perspective road maps
• CPC Class Codes: G01C 21/3638 including 3D objects and buildings three dimensional [3D] modelling, e.g. data description of 3D objects G06T17/00; geographic models G06T17/05
• CPC Class Codes: G06F 16/2291 User-Defined Types; Storage management thereof
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06T 15/005 General purpose rendering architectures
• CPC Class Codes: G06T 19/20 Editing of 3D images, e.g. changing shapes or colours, aligning objects or positioning parts
• CPC Class Codes: G06T 2219/2016 Rotation, translation, scaling
• CPC Class Codes: G06T 2219/2024 Style variation
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

Some embodiments provide a method for generating intersection data for paths in a map region. The method receives a set of junctions at which paths intersect in the map region. For a particular junction of at least two paths, the method automatically determines whether any of the other junctions in the map region satisfy criteria to be part of a single intersection with the particular junction. When at least one of the other junctions satisfies the criteria, the method automatically combines the other junctions that satisfy the criteria with the particular junction into a single intersection for use in performing mapping operations.

Claims

1. A machine readable medium storing a program which when executed by at least one processing unit generates intersection data for paths in a map region, the program comprising sets of instructions for:

receiving a set of junctions in a map region, each of a plurality of the junctions comprising at least two received paths that intersect with each other in the map region at the junction;

for a particular junction of at least two intersecting paths, automatically determining whether any of the other junctions in the map region satisfy criteria to be part of a single intersection with the particular junction; and

when at least one of the other junctions satisfies the criteria, automatically combining the other junctions that satisfy the criteria with the particular junction into a single intersection for use in performing mapping operations, the single intersection replacing multiple received junctions in a definition of the map region used for performing the mapping operations.

2. The machine readable medium of claim 1, wherein the mapping operations comprise generating a route in response to a user request.

3. The machine readable medium of claim 1, wherein the particular junction comprises a first dual carriageway path intersecting a second dual carriageway path.

4. The machine readable medium of claim 3, wherein the other junctions that satisfy the criteria comprise (i) a junction between the first dual carriageway path and a third dual carriageway path that corresponds to the second dual carriageway path, (ii) a junction between the second dual carriageway path and a fourth dual carriageway path that corresponds to the first dual carriageway path, and (iii) a junction between the third dual carriageway path and the fourth dual carriageway path.

5. The machine readable medium of claim 4, wherein the criteria for all four junctions to be part of the single intersection comprises the first dual carriageway path and the fourth dual carriageway path being within a threshold distance of each other and a threshold angular range of each other.

6. The machine readable medium of claim 5, wherein the threshold distance and the threshold angular range are greater when the first dual carriageway path and the fourth dual carriageway path have at least one name in common.

7. The machine readable medium of claim 5, wherein the criteria for all four junctions to be part of the single intersection further comprises the second dual carriageway path and the third dual carriageway path being within the threshold distance of each other and the threshold angular range of each other.

8. A method for generating intersection data for paths in a map region, the method comprising:

for a map region, identifying a first junction of road segments, at least one of the road segments tagged with data indicating that the tagged road segment is part of a dual carriageway;

determining whether a second junction of road segments, at least one of which is tagged with data indicating that the road segment is also part of a dual carriageway, satisfies criteria to be part of a single intersection with the first identified junction; and

when the second junction satisfies the criteria, automatically combining the first and second junctions into a single defined intersection.

9. The method of claim 8, wherein a first road segment that is part of the first junction and a second road segment that is part of the second junction are tagged as single direction paths of dual carriageways, wherein the determination comprises determining that the first road segment and second road segment are corresponding single direction paths in opposite directions of the same dual carriageway.

10. The method of claim 9, wherein a third road segment is a connector road that intersects with the first road segment at the first junction and the second road segment at the second junction, wherein the first and second junction are combined into a single U-turn intersection.

11. The method of claim 8, wherein the defined intersection is stored in a mapping service data storage for use in generating navigation instructions in response to user requests.

12. A method for generating intersection data for paths in a map region, the method comprising:

receiving a set of junctions in a map region, each of a plurality of the junctions comprising at least two received paths that intersect with each other in the map region at the junction;

for a particular junction of at least two intersecting paths, automatically determining whether any of the other junctions in the map region satisfy criteria to be part of a single intersection with the particular junction; and

when at least one of the other junctions satisfies the criteria, automatically combining the other junctions that satisfy the criteria with the particular junction into a single intersection for use in performing mapping operations, the single intersection replacing multiple received junctions in a definition of the map region used for performing the mapping operations.

13. The method of claim 12, wherein the mapping operations comprise generating a route in response to a user request.

14. The method of claim 12, wherein the particular junction comprises a first dual carriageway path intersecting a second dual carriageway path.

15. The method of claim 14, wherein the other junctions that satisfy the criteria comprise (i) a junction between the first dual carriageway path and a third dual carriageway path that corresponds to the second dual carriageway path, (ii) a junction between the second dual carriageway path and a fourth dual carriageway path that corresponds to the first dual carriageway path, and (iii) a junction between the third dual carriageway path and the fourth dual carriageway path.

16. The method of claim 15, wherein the criteria for all four junctions to be part of the single intersection comprises the first dual carriageway path and the fourth dual carriageway path being within a threshold distance of each other and a threshold angular range of each other.

17. The method of claim 16, wherein the threshold distance and the threshold angular range are greater when the first dual carriageway path and the fourth dual carriageway path have at least one name in common.

18. The method of claim 16, wherein the criteria for all four junctions to be part of the single intersection further comprises the second dual carriageway path and the third dual carriageway path being within the threshold distance of each other and the threshold angular range of each other.

19. A computer readable medium storing a program which when executed by at least one processing unit generates intersection data for paths in a map region, the program comprising sets of instruction for:

for a map region, identifying a first junction of road segments, at least one of the road segments tagged with data indicating that the tagged road segment is part of a dual carriageway;

determining whether a second junction of road segments, at least one of which is tagged with data indicating that the road segment is also part of a dual carriageway, satisfies criteria to be part of a single intersection with the first identified junction; and

when the second junction satisfies the criteria, automatically combining the first and second junctions into a single defined intersection.

20. The computer readable medium of claim 19, wherein a first road segment that is part of the first junction and a second road segment that is part of the second junction are tagged as single direction paths of dual carriageways, wherein the set of instructions determining comprises a set of instructions determining that the first road segment and second road segment are corresponding single direction paths in opposite directions of the same dual carriageway.

21. The computer readable medium of claim 20, wherein a third road segment is a connector road that intersects with the first road segment at the first junction and the second road segment at the second junction, wherein the first and second junction are combined into a single U-turn intersection.

22. The computer readable medium of claim 19, wherein the defined intersection is stored in a mapping service data storage for use in generating navigation instructions in response to user requests.