Uber Technologies, Inc.

Decarta Inc.

Etak, Inc.

Other

Sony Corporation

Google Inc.

Teleatlas North America Inc

Richard Frederick Poppen

Weidong Tang

Geoffrey R Hendrey

Brian Eric Smartt

Linnea A Dunn

Daniel R Brownstone

Rodney Jude Fernandez

James L Buxton

Kenneth Alan Milnes

Eric S Wels

Darrell L Mathis

David Hunkins

Frank J Derose

Andrew Stitt

Eric Wells

High-precision local search is performed on the Internet. A map image-rendering software provider embeds spatial keys into maps, which are then provided to producers of Internet content such as map providers. For example, a homeowner may post a message on a web bulletin board advertising his house for sale, and including a map showing the location of the house. When a search engine's web crawler encounters a page having a spatial key embedded in an image, the spatial key is indexed with the other content on the page. Because the spatial key identifies a small geographic area, indexing the content with the spatial key allows search queries to be limited by area and still provide useful results. Thus, a user of a search engine searching for 'house for sale' in a specific area will be directed to web pages that meet the geographic and content search terms.

High precision internet local search

Specified streets or intersections that are within a specified distance of a specified city can be found by a search, even when they are not actually in that city. For computational efficiency, some addresses are included in search results even when they exceed the specified distance from the specified city by a small amount ('false positives'). The search method guarantees that no instance of the street name within the specified distance of the specified city is erroneously missed ('false negatives').

Geocoding locations near a specified city

A system includes a GPS module, user interface module, database and routing engine. To find nearby POIs in one embodiment the routing engine identifies POIs in the database located within a threshold distance from the planned route in Euclidean distance. The routing engine filters the results by exploring the road network to determine whether each of the POIs is within the threshold distance of the route in driving distance. The filtering may include exploring outward from the POI, until all roads within the threshold distance are explored or the route is reached; alternatively, distance to the POIs is checked by exploring outward from the route until all roads within the threshold distance of the route have been exposed. For those POIs reached in the exploration, the nearest point on the route and the distance to that point are known. Similar searches are performed based on driving time rather than distance.

Point of interest search along a route

A routing module identifies POIs that can be reached from a route with a cost less than distance m. A routing engine performs a reverse exploration on nodes in the planned route to locate POIs from which the route can be reached with a cost of less than a second cost n. POIs identified as being reachable from the route with a cost of less than m, and from which the route is reachable with a cost less than n are then further filtered to identify a subset of the POIs for which the sum of the time or distance from the route to the POI and the time or distance from the POI back to the route is less than a threshold time or distance, t.

Point of interest search along a route with return

Systems, methods, and computer-readable media for validating addresses of a settlement are provided. An address validation model for a settlement is generated from an address numbering system inferred from observed addresses located in the settlement, based on the assumption that a most settlements use a regular addressing scheme. The address validation model has a first axis and a second axis having headings determined from are generated by determining known address points and headings to matched points. A mapping is determined between the coordinates of the first axis and the address points and between the coordinates of the second axis and the address points. The address validation model having the mapping is used to validate addresses for the settlement. Invalid addresses may be flagged for further review by an operator.

Systems, methods, and computer-readable media for validating addresses

Dehydration of routes enables transmitting a description of a route requiring much less space than full specification of the route. A series of 'breadcrumbs' and hints are used for dehydration. A breadcrumb includes coordinates of a point, a heading at which the route enters the breadcrumb, and a heading at which the route leaves the breadcrumb. A dehydration module places a breadcrumb at the location marking the beginning of the route, and having a leaving heading identifying the link in the original route. The node at the end of each link in the original route is examined. If the link leaving the node is the most parallel link to the link entering the node, nothing is added to the dehydrated route. If not, a breadcrumb is added to the dehydrated route, specifying the coordinates of the point, the entering heading of the breadcrumb and the leaving heading of the breadcrumb.

Transmission of routes between client and server using route IDs

Growing community of inventors

San Jose, CA, United States of America

Richard Frederick Poppen