×

Methods and systems for providing geotemporal graphs

  • US 9,341,486 B2
  • Filed: 04/24/2014
  • Issued: 05/17/2016
  • Est. Priority Date: 04/24/2013
  • Status: Active Grant
First Claim
Patent Images

1. A non-transitory computer readable memory, the computer readable memory storing instructions that, in response to being executed by a computing device, cause the computing device to perform operations for providing a geotemporal graph using travel conditions, the operations comprising:

  • obtaining a graph, wherein the graph is a spatial representation of an area;

    adding multiple nodes to the graph, wherein each node corresponds to a point in an infrastructure at an original location for that node in the area represented by the graph, wherein the infrastructure is a transportation infrastructure including a representation of one or more of;

    roadways, walkways, railways, shipping lanes, air traffic, or any combination thereof;

    adding at least two edges to the graph, wherein the edges represent sections of the infrastructure and connect nodes added to the graph;

    receiving a selection of a location within the graph;

    receiving infrastructure usage data indicating travel conditions on the infrastructure at a particular time; and

    updating a visual representation of the graph by;

    calculating, for each node of the multiple nodes added to the graph, a travel time between that node and the selected location within the graph, wherein each travel time accounts for the received usage data indicating travel conditions;

    defining, for each selected node of the multiple nodes added to the graph, a warp vector identifying a distance to move the selected node from the selected node'"'"'s original location and a direction to move the selected node from the selected node'"'"'s original location;

    wherein the direction to move the selected node corresponds to a direction defined by a location emanating line connecting the selected location with the selected node'"'"'s original location; and

    wherein the distance to move the selected node is defined such that a final distance between the selected location and the selected node, after the selected node is moved the distance to move the selected node in the direction to move the selected node, is a representation of the calculated travel time between the selected node and the selected location; and

    applying a warping algorithm to the graph, using the defined warp vectors, such that each node of the multiple nodes added to the graph is moved according the distance and direction identified in that node'"'"'s corresponding warp vector.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×