US 12,406,014 B2
Method and system for generating location information for an area
Roger D. Serwy, Austin, TX (US)
Assigned to ROGDA L.L.C., Austin, TX (US)
Filed by ROGDA L.L.C., Austin, TX (US)
Filed on Jun. 8, 2023, as Appl. No. 18/207,383.
Claims priority of provisional application 63/351,633, filed on Jun. 13, 2022.
Prior Publication US 2023/0401270 A1, Dec. 14, 2023
Int. Cl. G06F 16/9537 (2019.01); G01C 21/00 (2006.01); G06F 16/29 (2019.01); G06F 40/40 (2020.01)
CPC G06F 16/9537 (2019.01) [G01C 21/387 (2020.08); G06F 16/29 (2019.01); G06F 40/40 (2020.01)] 16 Claims
OG exemplary drawing
 
1. A computer-implemented method for creating uniquely identifiable location information of an area on the earth, the computer-implemented method comprising:
creating, at one or more computing devices, an octahedron representation of a sphere-shaped map of the earth;
converting the octahedron representation of the sphere-shaped map of the earth into a set of triangles in a two-dimensional (2D) plane, wherein the set of triangles comprises a first subset of triangles and a second subset of triangles, wherein a first vertex indicating a top triangle of the first subset of triangles represents the northernmost point of the earth, a second vertex indicating a top triangle of the second subset of triangles represents the southernmost point of the earth and one line of each of triangle of the set of triangles is along the equator;
skewing the set of triangles clockwise to form a plurality of 2D parallelograms, wherein the first vertex of the first subset of triangles is skewed toward the east and the second vertex of the second subset of triangles is skewed toward the west;
subdividing areas of the plurality of 2D parallelograms recursively into 2n area subdivisions by sub-dividing along either vertical or horizontal directions and altering the dimension at each recursive step, wherein the 2n area subdivisions are created by selectively performing either a vertical subdivision or a horizontal subdivision twice in succession depending on a relative position of a subdivision from a decision boundary, followed by its complement twice to overcome potential side-imbalance, wherein the decision boundary is a diagonal line across each of the plurality of 2D parallelograms;
representing each of the 2n area subdivisions as an n-bit sequence, wherein each bit of the n-bit sequence represents the direction of alternating horizontal and vertical subdivision;
splitting each of the n-bit sequence representations of each of the 2n area subdivisions into a plurality of tuples, wherein each of the plurality of tuples is m-bit of the n-bit sequence;
associating a commonly used word with each of the plurality of tuples, wherein the commonly used word is selected from a set of 2n preconfigured words;
storing, in a memory connected with the one or more computing devices, the commonly used word associated with the respective tuple of the plurality of tuples;
creating the uniquely identifiable location information in the form combination of two or more words comprising the associated commonly used word; and
enabling the area of the earth to be searched using the uniquely identifiable location information in combination with context information to locate an area of the earth.