Abstract: A method, an apparatus, and a computer program product may be provided for requesting traffic data. The apparatus may determine at least one map area comprising road segments, said map area having at least one map area identifier, determine road segment identifiers for the road segments of the at least one map area, send to a data service, a request for traffic data, said request identifying the map area, and receive from the data service, a subtree data structure set, the subtree data structure set comprising a plurality of subtree data structures, said subtree data structures in the set corresponding to traffic ranges. The apparatus may associate a road segment in a corresponding traffic range based on the road segment identifier satisfying one subtree data structure of the traffic range and provide the traffic range as traffic data for the road segment to a navigation application.

Abstract: Provided herein is a method of generating and communicating map version agnostic road link identifiers. Methods may include: receiving an indication of a new road link being joined to an existing road link along a length of the existing road link, where the existing road link extends between a first node and a second node, where the existing road link has a first road link identifier, and where a new node is formed where the new road link joins the existing road link; generating a first new identifier for a segment of the existing road link between the first node and the new node; generating a second new identifier for a segment of the existing road link between the new node and the second node, where the second new identifier is set equal to an XOR function of the first road link identifier and the first new identifier.

Abstract: An apparatus and method are disclosed for obtaining a simulated preview that depicts a representation of one or more user interface changes associated with an application plug-in. The approach involves, for example, rendering the simulated preview overlaid on a user interface of an application executing on a device. The rendering aligns the representation of the one or more user interface changes over the user interface to depict a preview of the one or more user interface changes that will occur after an installation of the application plug-in. The approach also involves rendering the simulated preview along with one or more simulated previews of installed plug-ins overlaid in a staked view on the user interface of the application. Addition and/or deletion of plug-ins can be managed in the stacked view.

Abstract: A network apparatus determines a route from an origin traversable map element (TME) to a target TME based on map data of a network version of a digital map. The route includes a list of route TMEs to be traveled from the origin TME to the target TME. The network apparatus accesses map version agnostic information identifying each TME of the list of route TMEs from the network version of the digital map; generates a map version agnostic identifier for each route TME of the list of route TMEs based on the accessed information; evaluates coding functions based at least on the map version agnostic identifier for each route TME to generate a coded identifier for each route TME; generates an encoding data structure based on the coded identifiers for the route TMEs; and provides the encoding data structure.

Abstract: Provided herein is a method of generating low bandwidth map format agnostic routes between origins and destinations for route communication between different map formats or versions using reduced bandwidth. Methods may include: receiving an indication of a route request between an origin and a destination; generating a route between the origin starting road segment and the destination target road segment, the route including a plurality of road segments; identifying one or more intermediate segments from the plurality of road segments, each intermediate segment having an anchor point; generating a plurality of route fragments from the route; encoding each route fragment by applying an XOR algorithm to identifiers of route fragment road segments of a respective route fragment; and providing the encoded route fragments and one or more anchor points of the one or more intermediate segments in response to the route request.

Abstract: An apparatus, a method and a computer program product are provided for updating link information on a client device. The method may include determining at least one map area comprising one or more links, the map area having at least one map area identifier, Sending to a data service, a request for at least one categorized link. Receiving, from the data service, at least one bloom filter, the at least one bloom filter encoding the at least one categorized link, determining one or more link identifiers for the one or more links in the map area and associating candidate link of the one or more links to the at least one categorized link, based on the link identifier of the at least one candidate link satisfying the at least one received bloom filter, to update the link information on the client device.

Abstract: An approach is provided for speculative navigation routing in incomplete maps. The approach involves, for example, generating an offline navigation route to a destination using offline map data cached at a device. The approach also involves transmitting a routing request to a routing server for an online navigation route to the destination. The approach further involves providing the online navigation route or a portion of the online navigation route based on determining that the online navigation route or the portion of the online navigation is received within a timeout period. The approach further involves providing the offline navigation route or a portion of the offline navigation route generated during the timeout period based on determining that the online navigation route or the portion of the online navigation route is not received before the timeout period ends.

Abstract: A mobile apparatus receives a route response comprising an encoded route and one or more delay encoding data structures. The delay encoding data structures are probabilistic data structures configured to not provide false negatives. The mobile apparatus determines a decoded route based on the encoded route and a mobile version of a digital map; determines an expected traffic delay for at least one adjacent traversable map element (TME) of the decoded route based on the one or more delay encoding data structures; and performs one or more navigation functions based at least on the expected traffic delay for the at least one adjacent segment of the decoded route. An adjacent TME is a TME of the digital map that intersects the decoded route and is not a TME of the decoded route.

Abstract: Provided herein is a method of generating low bandwidth map format agnostic routes between origins and destinations for route communication between different map formats or versions using reduced bandwidth.

Abstract: Information corresponding to one or more traversable map elements (TMEs) within a zone of interest is accessed from the geographic database. A respective category of a plurality of categories is determined for each of the one or more TMEs based at least in part on the information corresponding to the TME. A first category encoding data structure is generated based at least in part on map version agnostic identifiers corresponding to TMEs determined to be in a first category of the plurality of categories, wherein the first category encoding data structure is a probabilistic data structure configured to not provide false negatives for TMEs within the zone of interest. The first category encoding data structure is provided such that a mobile apparatus receives the first category encoding data structure.

Abstract: A method and an apparatus are disclosed for providing navigation instructions. The method may include receiving, from a user apparatus, a first location and a destination location; calculating a first route from the first location to the destination location; generating, for a predetermined time period, a first set of maneuvering data corresponding to the first route, the first set of maneuvering data comprising playback cues based on a predicted user apparatus location; transmitting the first set of maneuvering data to the user apparatus; receiving, from the user apparatus, a second location; generating, for a subsequent predetermined time period, a second set of maneuvering data, the second set of maneuvering data comprising playback cues based on a further predicted user apparatus location; calculating an update set of maneuvering data based on the first and second set of maneuvering data; and transmitting the update set of maneuvering data to the user apparatus.

Abstract: A method, a system, and a computer program product may be provided for providing traffic data to a client device. The system may receive from the client device, a request for traffic data corresponding to road segments of at least one map area, said request identifying the at least one map area and determine road segment identifiers corresponding to each of the road segments of the at least one map area and determine traffic data for at least a portion of the road segment identifiers, said traffic data obtained from a traffic data source. The system may further determine a plurality of traffic ranges based on the obtained traffic data and generate a subtree data structure set, each subtree data structure of the subtree data structure set corresponding to a traffic range of the plurality of traffic ranges, wherein each subtree data structure encodes road segment identifiers corresponding to the respective traffic range.

Abstract: An apparatus, method and computer program product are provided for generating map data of categorized links. The method may include receiving a request for at least one categorized link in a map area and obtaining at least one categorized link in the map area, based on the request. The method may further include determining link identifiers corresponding to each link of the at least one categorized link, and generating at least one bloom filter, wherein the at least one bloom filter encodes link identifiers corresponding to each link of the at least one categorized link.

Abstract: An apparatus and method are disclosed for obtaining a simulated preview that depicts a representation of one or more user interface changes associated with an application plug-in. The approach involves, for example, rendering the simulated preview overlaid on a user interface of an application executing on a device. The rendering aligns the representation of the one or more user interface changes over the user interface to depict a preview of the one or more user interface changes that will occur after an installation of the application plug-in. The approach also involves rendering the simulated preview along with one or more simulated previews of installed plug-ins overlaid in a staked view on the user interface of the application. Addition and/or deletion of plug-ins can be managed in the stacked view.

Abstract: Provided herein is a method of generating and communicating map version agnostic road link identifiers. Methods may include: receiving an indication of a new road link being joined to an existing road link along a length of the existing road link, where the existing road link extends between a first node and a second node, where the existing road link has a first road link identifier, and where a new node is formed where the new road link joins the existing road link; generating a first new identifier for a segment of the existing road link between the first node and the new node; generating a second new identifier for a segment of the existing road link between the new node and the second node, where the second new identifier is set equal to an XOR function of the first road link identifier and the first new identifier.

Abstract: A parking cruise request is received. A network version starting segment is identified and a route determination algorithm is expended starting at the network version starting segment. When the route determination algorithm is expanded to a new segment, a cost value is determined for the new segment based at least on the likelihood of finding parking on the new segment. Responsive to determining that the likelihood of finding parking along the cruise route does satisfy the threshold probability requirement, map version agnostic identifiers for each segment of the cruise route are generated. Each of the map version agnostic identifiers are coded using at least one coding function to generate coded map version agnostic identifiers. A bloom filter having the coded map version agnostic identifiers as members is generated. A parking cruise route response comprising the bloom filter is provided such that a mobile apparatus receives the parking cruise route response.

Abstract: A POI request comprising query criteria and information identifying a starting location is received. A network version starting segment is identified based on the information identifying the starting location. A route determination algorithm is expanded, starting at the starting segment. When the route determination algorithm is expanded to a new segment, it is determined whether any POIs associated with the new segment match the query criteria. Responsive to determining that a POI associated with the new segment satisfies the query criteria, a POI route from the starting segment to the POI is extracted. Map version agnostic identifiers are generated for each segment of the POI routes. Each of the map version agnostic identifiers are coded using at least one coding function. A bloom filter having the coded map version agnostic identifiers as members is generated. The bloom filter is provided such that a mobile apparatus receives the bloom filter.

Abstract: An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises determining an update candidate node, wherein the update candidate node is associated with a node identifier and a first node digest; sending the node identifier and the first node digest to an update data service; and receiving, from the update data service, a response containing one of node digests of the child nodes of the update candidate node at the update data service; or updated content corresponding to the update candidate node. The method may further include updating the map database based on the received response.

Abstract: An approach is provided for dynamic obstacle data in a collision probability map. The approach, for example, involves monitoring a flight of an aerial vehicle through a three-dimensional (3D) space that is partitioned into 3D shapes of varying resolutions. The approach also involves detecting an entry of the aerial vehicle into one 3D shape of the plurality of 3D shapes. The approach further involves, on detecting an exit of the aerial vehicle form the one 3D shape, recording a 3D shape identifier (ID) of the one 3D shape and at least one of a first timestamp indicating the entry, a second timestamp indicating the exit, a duration of stay in the one 3D shape, dimensions of the aerial vehicle, or a combination thereof as a dynamic obstacle observation record. The approach further involves transmitting the dynamic obstacle observation record to another device (e.g., a server for creating the collision probability map).

Abstract: Provided herein is a method of generating and communicating map version agnostic road link identifiers. Methods may include: receiving an indication of a new road link being joined to an existing road link along a length of the existing road link, where the existing road link extends between a first node and a second node, where the existing road link has a first road link identifier, and where a new node is formed where the new road link joins the existing road link; generating a first new identifier for a segment of the existing road link between the first node and the new node; generating a second new identifier for a segment of the existing road link between the new node and the second node, where the second new identifier is set equal to an XOR function of the first road link identifier and the first new identifier.