Generating Travel Time Data
First Claim
Patent Images
1. A server computer configured to generate travel time data, having a processor configured to:
- receive co-ordinates for a starting location;
receive a maximum travel time;
read processed graph data comprising nodes representing pre-filtered map features and edges that include representations of travel times between said nodes;
build a temporary graph of selected nodes that can be reached via selected edges within said maximum travel time;
receive candidate destinations; and
test the travel time to said candidate destinations with reference to said temporary graph.
1 Assignment
0 Petitions
Accused Products
Abstract
The generation of travel time data is disclosed in which coordinates are received for a starting location (1901). A maximum travel time is received (1903) and processed graph data is read that includes nodes representing pre-filtered map features and edges representing travel times between nodes. A temporary graph is built (1907) of selected nodes that can be reached via selected edges within the maximum travel time. Candidate destinations are received (1908) and the travel time to these candidate destinations is tested (1909) with reference to the temporary graph.
-
Citations
19 Claims
-
1. A server computer configured to generate travel time data, having a processor configured to:
-
receive co-ordinates for a starting location; receive a maximum travel time; read processed graph data comprising nodes representing pre-filtered map features and edges that include representations of travel times between said nodes; build a temporary graph of selected nodes that can be reached via selected edges within said maximum travel time; receive candidate destinations; and test the travel time to said candidate destinations with reference to said temporary graph. - View Dependent Claims (2, 3, 4, 5)
-
-
6. A method of generating travel time data, comprising the steps of:
-
receiving coordinates for a starting location; receiving a maximum travel time; reading processed graph data comprising nodes representing pre-filtered map features and edges representing travel times between said nodes; building a temporary graph of selected nodes that can be reached via selected edges within said maximum travel time; receiving candidate destinations; and testing the travel time to said candidate destinations with reference to said temporary graph. - View Dependent Claims (7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A data structure, comprising selected nodes that can be reached via selected edges within a specified maximum journey time, wherein:
-
said data structure is built from processed graph data; and said processed graph data comprises nodes that represent pre-filtered map features and edges related to travel times between nodes. - View Dependent Claims (19)
-
Specification