Abstract: A method is disclosed for determining and displaying an area comprising a plurality of locations that can be reached by a person or vehicle from a departure node or current position while still reaching a destination node or home location given the initial value at the departure node or current position of a parameter that constrains the distance travelable by the person or vehicle. The method may be implemented on a mobile device such as a portable navigation device and/or on a server or computer, or may be provided as a computer program product.

Abstract: A method is disclosed for determining and displaying an area comprising a plurality of locations that can be reached by a person or vehicle from a departure node or current position while still reaching a destination node or home location given the initial value at the departure node or current position of a parameter that constrains the distance travelable by the person or vehicle. The method may be implemented on a mobile device such as a portable navigation device and/or on a server or computer, or may be provided as a computer program product.

Abstract: A method is disclosed for generating a route in an area covered by an electronic map. The map comprises a plurality of segments representing navigable elements of a navigable network in the area covered by the electronic map. A selection of a profile is received, e.g. from a user, the profile including data identifying one or more segments of the electronic map. A route is generated between an origin and a destination in the electronic map using a routing process in which each of the one or more segments identified by the selected profile is penalised. Any segments in the generated route that are segments identified by the selected profile are detected, and data representative of the generated route and the detected segments are output, e.g. for provision to a user.

Abstract: A method is disclosed for generating a route in an area covered by an electronic map. The map comprises a plurality of segments representing navigable elements of a navigable network in the area covered by the electronic map. A selection of a profile is received, e.g. from a user, said profile comprising data identifying one or more segments of the electronic map. A route is generated between an origin and a destination in the electronic map using a routing process in which each of the one or more segments identified by the selected profile is penalised. Any segments in the generated route that are segments identified by the selected profile are detected, and data representative of said generated route and said detected segments are output, e.g. for provision to a user.

Abstract: A method and system for generating a route through a navigable network in a geographic area is disclosed, the navigable network being represented by an electronic map comprising a plurality of segments each having a traversal direction associated therewith. An area is defined around a location represented by the electronic map, and at least some of the outgoing segments from the area are determined. A first optimum cost route from an origin is determined to each of the determined outgoing segments, and these routes are ranked according to their cost. At least one of the first optimum cost routes is selected based on the ranking, and a second optimum cost route is determined from the outgoing segment from the area of the selected route to a destination. The generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route.

Abstract: A method is disclosed for determining and displaying an area comprising a plurality of locations that can be reached by a person or vehicle from a departure node or current position while still reaching a destination node or home location given the initial value at the departure node or current position of a parameter that constrains the distance travelable by the person or vehicle. The method may be implemented on a mobile device such as a portable navigation device and/or on a server or computer, or may be provided as a computer program product.

Abstract: Embodiments of the present invention provide a one-to-many route searching method comprising searching map data to select links to form a plurality of routes from a departure node according to a cost function, and determining an extent of each route according to an objective function, wherein the searching of the map data is performed to a search boundary based upon a cost of an unreachable node.

Abstract: A method and system for generating a route reconstructing a track through a navigable network in an area covered by an electronic map is disclosed, wherein the track is represented by an ordered series of point locations. One or more of the point locations are selected and an area is defined and associated with each of the one or more selected point locations. The ordered series of point locations and the defined areas are used to determine a plurality of polylines, and, for each of the polylines, a first route is generated based on the respective polyline. A second route is generated through each of the defined areas connecting the respective first generated routes. The route reconstructing the track comprises the generated first routes and the one or more generated second routes.

Abstract: A method and system for generating a route through a navigable network in a geographic area is disclosed, the navigable network being represented by an electronic map comprising a plurality of segments each having a traversal direction associated therewith. An area is defined around a location represented by the electronic map, and at least some of the outgoing segments from the area are determined. A first optimum cost route from an origin is determined to each of the determined outgoing segments, and these routes are ranked according to their cost. At least one of the first optimum cost routes is selected based on the ranking, and a second optimum cost route is determined from the outgoing segment from the area of the selected route to a destination. The generated route from the origin to the destination comprises the selected first optimum cost route and the second optimum cost route.

Abstract: A method and system for generating a route reconstructing a track through a navigable network in an area covered by an electronic map is disclosed, wherein the track is represented by an ordered series of point locations. One or more of the point locations are selected and an area is defined and associated with each of the one or more selected point locations. The ordered series of point locations and the defined areas are used to determine a plurality of polylines, and, for each of the polylines, a first route is generated based on the respective polyline. A second route is generated through each of the defined areas connecting the respective first generated routes. The route reconstructing the track comprises the generated first routes and the one or more generated second routes.

Abstract: Embodiments of the present invention provide a one-to-many route searching method comprising searching map data to select links to form a plurality of routes from a departure node according to a cost function, and determining an extent of each route according to an objective function, wherein the searching of the map data is performed to a search boundary based upon a cost of an unreachable node.