COMPUTING TRANSITIONS BETWEEN CAPTURED DRIVING RUNS
First Claim
1. A computer-implemented method comprising:
- receiving, with a computing device, an input path;
utilizing a transition algorithm to compute an output path associated with the input path, wherein the transition algorithm;
receives, as input, at least two captured runs and a description of an intersection associated with the input path; and
computes the output path as a function of cost associated with a transition within the intersection between said at least two captured runs.
2 Assignments
0 Petitions
Accused Products
Abstract
Various embodiments provide a global approach for computing transitions between captured runs through an intersection. In accordance with one or more embodiments, a transition algorithm receives as input various runs that have been captured through an intersection and an input path through the intersection. The transition algorithm processes its inputs and provides, as an output, a set of points and data such as a direction associated with each of the points. The set of points includes points from different captured runs. The output set of points and associated data indicate which images to obtain from a database and which field of view to create a simulated turn for the user.
19 Citations
20 Claims
-
1. A computer-implemented method comprising:
-
receiving, with a computing device, an input path; utilizing a transition algorithm to compute an output path associated with the input path, wherein the transition algorithm; receives, as input, at least two captured runs and a description of an intersection associated with the input path; and computes the output path as a function of cost associated with a transition within the intersection between said at least two captured runs. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A computer-implemented method comprising:
-
receiving, with a computing device, a user-specified path; computing costs associated with making a transition between different captured runs associated with the user-specified path; selecting an output path having a lowest cost; and obtaining images associated with a selected output path. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. One or more computer-readable storage media embodying computer-executable instructions which, when executed, implement a method comprising:
-
receiving an input path; building a weighted, edge-directed graph associated with the input path; computing transition costs associated with the weighted, edge-directed graph; selecting an output path having a lowest computed transition cost; obtaining 360°
panoramic view images associated with the output path; andcausing the 360°
panoramic view images to be displayed. - View Dependent Claims (14, 15, 16, 17, 18, 19, 20)
-
Specification