IP Library Granted Patent US 7,089,109
Granted Patent B2
US 7,089,109 · App. 10/662,907 · Granted Aug 8, 2006

Comprehensive mapping data structures and methods for using the same

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,089,109
App. No.
10/662,907
Granted
Aug 8, 2006
Kind
B2
Abstract

A location data structure represents a location in a number of different ways, and may include a map view scale appropriate for rending the map. A map view data structure contains sufficient information to derive a number of independent descriptions of a map view. A route data structure may be used at any point in the route calculation and rendering process, and includes a locations field that includes the two-end points of the route, a calculated route data field representing a calculated route between the two end-points, an options field that specifies the options used or to be used to calculate the route, a driving directions field that represents driving directions for the route, and an identity data field that specifies whether the route data structure is a request to calculate a route, a response to a route calculation request, or a rendering request.

Claims (13)

1. In a computing system capable of calculating routes between two locations in response to a request from a requesting computing system, a method for calculating the route in a manner that informs the requesting computing system of what options were used to calculate the route, the method comprising the following:

an act of receiving a request to calculate a route from a requesting computing system, the request including a routing data structure;

an act of determining what options are to be used to calculate the route, wherein the options includes at least one of a snap type and a route type;

an act of calculating the route using the options;

an act of populating the routing data structure with the calculate route;

an act of populating the routing data structure with the options; and

an act of returning the routing data structure with the route and the options to the requesting computing system.

2. A method in accordance with claim 1 , wherein the options include the route type and the route type is the quickest route.

3. A method in accordance with claim 1 , wherein the options include the route type and the route type is the shortest route.

4. A method in accordance with claim 1 , wherein the options include the snap type and the snap type is a road snap.

5. A method in accordance with claim 1 , wherein the options include the snap type and the snap type is a highway or town snap type.

6. A method in accordance with claim 1 , wherein the options include the route type and the route type is specified in the request.

7. A method in accordance with claim 1 , wherein the options include the route type and the route type is not specified in the request.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 9, 2014
From: MICROSOFT CORPORATION
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 034541/0477 →