Generating travel time data
First Claim
Patent Images
1. 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,wherein coordinates of each candidate destination are transformed to a modified destination at the location of a node in said processed graph data,wherein coordinates of each candidate destination are transformed with reference to a binary space partitioning tree data structure produced by dividing a region of interest repeatedly until each sub-region contains only one of said graph nodes.
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
11 Claims
-
1. 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, wherein coordinates of each candidate destination are transformed to a modified destination at the location of a node in said processed graph data, wherein coordinates of each candidate destination are transformed with reference to a binary space partitioning tree data structure produced by dividing a region of interest repeatedly until each sub-region contains only one of said graph nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
Specification