Abstract: Systems and methods are provided for providing improved generation of textual directions based on positional information. In an implementation, textual directions for traversing a path are generated based on positional information associated with the path. According to a method, positional information that specifies a longitude and latitude at a plurality of times is received and processed to generate a routing graph. The generated routing graph includes nodes and route links that connect the plurality of nodes. Textual directions are generated for traversing a path associated with the positional data, based in pan on link information associated with the links of the generated routing graph.

Abstract: Methods and systems are provided for generating an electronic map display. In one implementation, a method is provided for receiving route information associated with a route having an origination point and a destination point, determining a location of a reference point along the route, assigning a spatial identifier to the reference point, searching for points of interest (POIs) in a search area associated with the spatial identifier, ranking, using a processor, the POIs based on distances of POIs from the location of the reference point, and providing POI information for an electronic map display, wherein the POI information is associated with one or more POIs and selected based on the ranking of the POIs.

Abstract: Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.

Abstract: A preferred route may be determined from an origin location to a destination location. The determination is made by processing directed links (e.g., one-way edges) in a graph that includes one or more links and two or more nodes. The determination of a preferred route may include an estimate of the time required at one or more intersections along alternative. Individual routing preferences, such as a preference of a rural over an urban route, also may be considered. Techniques are described that may help reduce the time required to identify a preferred route, including the identification and removal of no outlet routes before processing the directed links and techniques using particular data formats.

Abstract: Methods and systems are provided for generating an electronic map display. In one implementation, a method is provided for determining a route distance based on information for a route, comparing the route distance with a distance threshold, defining a search area when the route distance is less than the distance threshold, the search area including boundaries, calculating, using a processor, a points of interest (POI) density of the search area, comparing the POI density with a first density threshold and a second density threshold, adjusting the boundaries of the search area based on a result of comparing the POI density with the first density threshold and the second density threshold, identifying POIs in the adjusted search area, and providing POI information for an electronic map display, the POI information being associated with one or more POIs identified in the adjusted search area.

Abstract: Methods and systems are provided for generating an electronic map display. In one implementation, a method is provided for determining a route distance based on information for a route, comparing the route distance with a distance threshold, generating a list of points of interest (POIs) when the route distance is less than the distance threshold, the list of POIs identifying POIs that are located along the route, grouping the POIs into one or more buckets based on location, calculating POI densities of the buckets based on the POIs included in each corresponding bucket, ranking the buckets based on the POI densities, providing POI information associated with the POIs included in the ranked buckets, wherein the POI information is provided based on the ranking of the buckets, and generating an electronic map display with the POI information.

Abstract: A preferred route may be determined from an origin location to a destination location. The determination is made by processing directed links (e.g., one-way edges) in a graph that includes one or more links and two or more nodes. The determination of a preferred route may include an estimate of the time required at one or more intersections along alternative. Individual routing preferences, such as a preference of a rural over an urban route, also may be considered. Techniques are described that may help reduce the time required to identify a preferred route, including the identification and removal of no outlet routes before processing the directed links and techniques using particular data formats.

Abstract: Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.

Abstract: Methods and systems are provided for generating an electronic map display. In one implementation, a method is provided for determining a route distance based on information for a route, comparing the route distance with a distance threshold, defining a search area when the route distance is less than the distance threshold, the search area including boundaries, calculating, using a processor, a points of interest (POI) density of the search area, comparing the POI density with a first density threshold and a second density threshold, adjusting the boundaries of the search area based on a result of comparing the POI density with the first density threshold and the second density threshold, identifying POIs in the adjusted search area, and providing POI information for an electronic map display, the POI information being associated with one or more POIs identified in the adjusted search area.

Abstract: Methods and systems are provided for generating an electronic map display. In one implementation, a method is provided for determining a route distance based on information for a route, comparing the route distance with a distance threshold, generating a list of points of interest (POIs) when the route distance is less than the distance threshold, the list of POIs identifying POIs that are located along the route, grouping the POIs into one or more buckets based on location, calculating POI densities of the buckets based on the POIs included in each corresponding bucket, ranking the buckets based on the POI densities, providing POI information associated with the POIs included in the ranked buckets, wherein the POI information is provided based on the ranking of the buckets, and generating an electronic map display with the POI information.

Abstract: Methods and systems are provided for decluttering icons on a map graphically presented on a display. In one implementation, a method is provided for decluttering icons representing points-of-interest on a map, wherein the method includes determining whether icons in a map view are overlapping and grouping the icons which are determined to overlap into at least one icon group. The method may also include repositioning the icons in each icon group into a decluttered icon patterns, wherein repositioning includes repositioning the icons at a predetermined distance from a common focal point. In addition, the method may include adjusting the repositioned icons to a different position in the map view when the repositioned icons overlap. Additionally, or alternatively, the method may include repositioning an icon in at least one decluttered icon pattern to a new position in the map view based on input from a user.

Abstract: A preferred route may be determined from an origin location to a destination location. The determination is made by processing directed links (e.g., one-way edges) in a graph that includes one or more links and two or more nodes. The determination of a preferred route may include an estimate of the time required at one or more intersections along alternative. Individual routing preferences, such as a preference of a rural over an urban route, also may be considered. Techniques are described that may help reduce the time required to identify a preferred route, including the identification and removal of no outlet routes before processing the directed links and techniques using particular data formats.

Abstract: Methods and systems are provided for decluttering icons on a map graphically presented on a display. In one implementation, a method is provided for decluttering icons representing points-of-interest on a map, wherein the method includes determining whether icons in a map view are overlapping and grouping the icons which are determined to overlap into at least one icon group. The method may also include repositioning the icons in each icon group into a decluttered icon patterns, wherein repositioning includes repositioning the icons at a predetermined distance from a common focal point. In addition, the method may include adjusting the repositioned icons to a different position in the map view when the repositioned icons overlap. Additionally, or alternatively, the method may include repositioning an icon in at least one decluttered icon pattern to a new position in the map view based on input from a user.

Abstract: A preferred route may be determined from an origin location to a destination location. The determination is made by processing directed links (e.g., one-way edges) in a graph that includes one or more links and two or more nodes. The determination of a preferred route may include an estimate of the time required at one or more intersections along alternative. Individual routing preferences, such as a preference of a rural over an urban route, also may be considered. Techniques are described that may help reduce the time required to identify a preferred route, including the identification and removal of no outlet routes before processing the directed links and techniques using particular data formats.

Abstract: A preferred route may be determined from an origin location to a destination location. The determination is made by processing directed links (e.g., one-way edges) in a graph that includes one or more links and two or more nodes. The determination of a preferred route may include an estimate of the time required at one or more intersections along alternative. Individual routing preferences, such as a preference of a rural over an urban route, also may be considered. Techniques are described that may help reduce the time required to identify a preferred route, including the identification and removal of no outlet routes before processing the directed links and techniques using particular data formats.

Abstract: Systems and methods are provided for collecting and using user-contributed map data. In one implementation, a computer-implemented method is provided for collecting maneuver-specific annotations. According to the method, a user is presented with a set of computer-generated driving directions comprising a plurality of maneuvers. In association with presenting to the user the set of driving directions, the method presents to the user an option to submit an annotation for one of the plurality of maneuvers. In response to presenting the option to the user, the annotation is received from the user and stored in association with an identification of the one of the plurality of maneuvers. The stored annotation may be incorporated in the set of computer-generated driving directions.

Abstract: A preferred route may be determined from an origin location to a destination location. The determination is made by processing directed links (e.g., one-way edges) in a graph that includes one or more links and two or more nodes. The determination of a preferred route may include an estimate of the time required at one or more intersections along alternative. Individual routing preferences, such as a preference of a rural over an urban route, also may be considered. Techniques are described that may help reduce the time required to identify a preferred route, including the identification and removal of no outlet routes before processing the directed links and techniques using particular data formats.

Abstract: Systems and methods are provided for providing improved generation of textual directions based on positional information. In an implementation, textual directions for traversing a path are generated based on positional information associated with the path. According to a method, positional information that specifies a longitude and latitude at a plurality of times is received and processed to generate a routing graph. The generated routing graph includes nodes and route links that connect the plurality of nodes. Textual directions are generated for traversing a path associated with the positional data, based in pan on link information associated with the links of the generated routing graph.

Abstract: According to one aspect of the present disclosure, a computer-implemented method is provided for processing a query for points of interest (POIs) using a hierarchical grid structure representing a geographic area. The method includes receiving a query for POIs; defining a query footprint for the query based on a location corresponding to the query, wherein the query footprint comprises query spatial identifiers for a plurality of levels of the hierarchical grid structure; matching the query spatial identifiers with one or more POI spatial identifiers organized into a plurality of indexes, wherein each one of the plurality of indexes comprises an index of the POI spatial identifiers for one of the plurality of levels; and providing an output specifying one or more POIs corresponding to the matched POI spatial identifiers.

Abstract: Systems and methods are provided for collecting and using user-contributed map data. In one implementation, a computer-implemented method is provided for collecting maneuver-specific annotations. According to the method, a user is presented with a set of computer-generated driving directions comprising a plurality of maneuvers. In association with presenting to the user the set of driving directions, the method presents to the user an option to submit an annotation for one of the plurality of maneuvers. In response to presenting the option to the user, the annotation is received from the user and stored in association with an identification of the one of the plurality of maneuvers. The stored annotation may be incorporated in the set of computer-generated driving directions.