US 2003/0158661 A1 · Programmatically computing street intersections using street geometry

Abstract

Techniques are disclosed for programmatically deriving street intersections from address data which is presented in textual format, or alternatively, from street geometry data which has been derived from such address data. Preferred embodiments leverage built-in functions and data types of a spatially-enabled object relational database system. Information about streets is analyzed to determine which streets intersect, as well as the intersection locations. This information is stored in a spatially-enabled table for subsequent retrieval. The derived street intersections data supports retrievals which do not rely on proprietary file formats or binary files, thereby enabling faster retrievals and reduced resource consumption requirements. The derived street intersection information may be used in many ways, such as to compute a path from one location to another.

Claims17

Dependent claims

A method of programmatically computing street intersections using street geometry, comprising steps of:

obtaining street geometry information for a first street;
comparing the object street geometry information for the first street to obtained street geometry information for one or more other streets to determine intersecting ones of the one or more other streets;
and
for each of the intersecting ones, storing a geographic location of a point of the intersection, along with an identification of the first street address and the identification of the intersecting one.

1 more element

A computer program product for programmatically computing street intersections using street geometry, the computer program product embodied on one or more computer-readable media and comprising:

computer-readable program code means for obtaining street geometry information for a first street;
computer-readable program code means for comparing the object street geometry information for the first street to obtained street geometry information for one or more other streets to determine intersecting ones of the one or more other streets;
for each of the intersecting ones, computer-readable program code means for storing (1) a geographic location of a point of the intersection, along with an identification of the first street address and the identification of the intersecting one, in a relational database table;
and (2) a reciprocal comprising the geographic location of a point of the intersection, along with the identification of the intersecting one and the identification of the first street address;
and
computer-readable program code means for repeating operation of the computer-readable program code means for obtaining, computer-readable program code means for comparing, and computer-readable program code means for storing, for at least one of the one or more other streets.

3 more elements

Dependencies are inferred from the claim text.

Programmatically computing street intersections using street geometry

Life of this patent

Programmatically computing street intersections using street geometry

Life of this patent

Abstract

Claims17