IP Library Granted Patent US 12,406,014
Granted Patent B2
US 12,406,014 · App. 18/207,383 · Granted Sep 2, 2025

Method and system for generating location information for an area

Inventor: Roger D. Serwy (Austin, TX)
Assignee: ROGDA L.L.C.
G06F16/9537G01C21/387G06F16/29G06F40/40
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 12,406,014
App. No.
18/207,383
Granted
Sep 2, 2025
Kind
B2
Abstract

A method and system for generating location information for an area are described. The present disclosure teaches to combine a method for progressively subdividing the earth into triangles or quadrilaterals to localize an area on map. Further, a chosen triangle indices is used to create a representation using a sequence of symbols or words from common speech. Using the representation and corresponding coordinates, location information is generated and provided to a user. This process enables easier sharing of location information in a human-friendly rather than machine-friendly manner.

Claims (38)

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 2 n area subdivisions by sub-dividing along either vertical or horizontal directions and altering the dimension at each recursive step, wherein the 2 n 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 2 n 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 2 n 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 2 n 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.

2. The computer-implemented method of claim 1 , wherein the vertical subdivision is performed twice in succession when a subdivision from a previous step is above the decision boundary and above a horizontal line across the equator, and horizontal subdivision is performed twice in success when a subdivision from a previous step is below the horizontal line.

3. The computer-implemented method of claim 1 , wherein the commonly used word to be associated with each of the plurality of tuples is selected from commonly used words in the area.

4. The computer-implemented method of claim 1 , wherein the n in the 2 n preconfigured words is an integer number selected from a group of numbers comprising 4, 5, 6, 7, 8, 9, 10, 11 and 12.

5. The computer-implemented method of claim 1 , wherein the commonly used word is selected using an edit distance metric.

6. The computer-implemented method of claim 1 , further comprises steps of converting the n-bit sequence into one or more numerical bases such that either three, four, five, or six words uniquely map to the n-bit sequence.

7. The computer-implemented method of claim 1 , wherein the 2 n area divisions are created in form of triangles or quadrilaterals.

8. The computer-implemented method of claim 1 , wherein each of the two or more words of the uniquely identifiable information is separated by a special character and one or more extra characters comprising a number, letter, and symbol is used to enable spacing between words.

9. A system for creating uniquely identifiable location information of an area on the earth, the system comprising:

a projection module, configured at one or more computing devices, to

create an octahedron representation of a sphere-shaped map of the earth;

convert 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; and

skew 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;

a subdivisional module, configured at the one or more computing devices, to subdivide areas of the plurality of 2D parallelograms recursively into 2 n area subdivisions by sub-dividing along either vertical or horizontal directions and altering the dimension at each recursive step, wherein the 2 n 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;

a bit sequence representation module to represent each of the 2 n area subdivisions as an n-bit sequence, wherein each bit of the n-bit sequence represents the direction of alternating horizontal and vertical subdivision;

a bits-word mapping module to

split each of the n-bit sequence representations of each of the 2 n area subdivisions into a plurality of tuples, wherein each of the plurality of tuples is m-bit of the n-bit sequence; and

associate a commonly used word with each of the plurality of tuples, wherein the commonly used word is selected from a set of 2 n 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; and

a location information generation module to

create the uniquely identifiable location information in the form combination of two or more words comprising the associated commonly used word, wherein the uniquely identifiable location information in combination with context information is used to enable the area of the earth to be searched by a user through a user device.

10. The system of claim 9 , wherein the vertical subdivision is performed twice in succession when a subdivision from a previous step is above the decision boundary and above a horizontal line across the equator, and horizontal subdivision is performed twice in success when a subdivision from a previous step is below the horizontal line.

11. The system of claim 9 , wherein the commonly used word to be associated with each of the plurality of tuples is selected from commonly used words in the area.

12. The system of claim 9 , wherein the n in the 2 n preconfigured words is an integer number selected from a group of numbers comprising 4, 5, 6, 7, 8, 9, 10, 11 and 12.

13. The system of claim 9 , wherein the commonly used word is selected using an edit distance metric.

14. The system of claim 9 , the n-bit sequence is converted into one or more numerical bases such that either three, four, five, or six words uniquely map to the n-bit sequence.

15. The system of claim 9 , wherein the 2 n area divisions are created in form of triangles or quadrilaterals.

16. The system of claim 9 , wherein each of the two or more words of the uniquely identifiable information is separated by a special character, and one or more extra characters comprising a number, letter, and symbol is used to enable spacing between words.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 8, 2023
From: SERWY, ROGER D.
To: ROGDA L.L.C.
Reel/Frame 063896/0503 →
Continuity (2)
Provisional Application 63351633 · Jun 13, 2022
Related Publication 20230401270A1 · Dec 14, 2023
References Cited (75)
US 6466696B1 · Politis · 2002 [cited by examiner]
US 6606584B1 · Junkins · 2003 [cited by examiner]
US 7328211B2 · Bordner et al. · 2008 [cited by applicant]
US 7840586B2 · Hakala et al. · 2010 [cited by applicant]
US 7925677B2 · Sheridan · 2011 [cited by applicant]
US 9175965B2 · Inakoshi et al. · 2015 [cited by applicant]
US 9418152B2 · Nissan et al. · 2016 [cited by applicant]
US 9563721B2 · Anderson · 2017 [cited by applicant]
US 9674683B2 · Hatton · 2017 [cited by applicant]
US 9740767B2 · Quinion et al. · 2017 [cited by applicant]
US 9797328B2 · Martinez et al. · 2017 [cited by applicant]
US 9883333B2 · Ganesalingam et al. · 2018 [cited by applicant]
US 10013434B2 · Sato · 2018 [cited by applicant]
US 10095808B2 · Bodziony et al. · 2018 [cited by applicant]
US 10380210B1 · Lai et al. · 2019 [cited by applicant]
US 10380248B1 · Lai · 2019 [cited by applicant]
US 10409803B1 · Lai · 2019 [cited by applicant]
US 10909318B2 · Ganesalingam et al. · 2021 [cited by applicant]
US 20020035609A1 · Lessard · 2002 [cited by examiner]
US 20020116123A1 · Lampe et al. · 2002 [cited by applicant]
US 20040179006A1 · Wardetzky · 2004 [cited by examiner]
US 20090096784A1 · Wardetzky · 2009 [cited by examiner]
US 20120284528A1 · Orovitz · 2012 [cited by applicant]
US 20130297639A1 · Bobik et al. · 2013 [cited by applicant]
US 20160350652A1 · Min et al. · 2016 [cited by applicant]
US 20210183378A1 · Gharpure et al. · 2021 [cited by applicant]
AU 2015201799B2 · 2016 [cited by applicant]
BR 102020000282A2 · 2021 [cited by applicant]
CN 104899254A · 2015 [cited by applicant]
CN 106302610A · 2017 [cited by applicant]
CN 107194744A · 2017 [cited by applicant]
CN 108009253A · 2018 [cited by applicant]
CN 105447160B · 2018 [cited by applicant]
CN 108932310A · 2018 [cited by applicant]
CN 109325089A · 2019 [cited by applicant]
CN 110807135A · 2020 [cited by applicant]
CN 111209447A · 2020 [cited by applicant]
CN 111323025A · 2020 [cited by applicant]
CN 111339230A · 2020 [cited by applicant]
CN 106980620B · 2020 [cited by applicant]
CN 111563080A · 2020 [cited by applicant]
CN 111563139B · 2020 [cited by applicant]
CN 111988746A · 2020 [cited by applicant]
CN 112347310A · 2021 [cited by applicant]
CN 112804645A · 2021 [cited by applicant]
CN 112818216A · 2021 [cited by applicant]
CN 111862162B · 2021 [cited by applicant]
EP 2507763A4 · 2015 [cited by applicant]
EP 2987344A1 · 2016 [cited by applicant]
EP 3243141A1 · 2017 [cited by applicant]
EP 3243142A1 · 2017 [cited by applicant]
EP 3701446A1 · 2020 [cited by applicant]
JP H09288495A · 1997 [cited by applicant]
JP 2020087150A · 2020 [cited by applicant]
WO WO2007003721 · 2007 [cited by applicant]
Ao, Xiang et al.; Crossmodal Error Correction of Continuous Handwriting Recognition by Speech; https://dl.acm.org/doi/pdf/10.1145/1216295.1216339; https://sci-hub.mksa.top/10.1145/1216295.1216339; Jan. 28, 2007. [cited by applicant]
Banu, R.S.D. Wahida et al.; Using Selectional Restrictions for Real Word Error Correction; https://link.springer.com/chapter/10.1007/978-3-540-30176-9_17; https://sci-hub.mksa.top/10.1007/978-3-540-30176-9_17. [cited by applicant]
Bard, Gregory V.; Spelling-Error Tolerant, Order-Independent Pass-Phrases via the Damerau-Levenshtein String-Edit Distance Metric; https://dl.acm.org/doi/pdf/10.5555/1274531.1274545. [cited by applicant]
Dutton, Geoffrey, Zenithial Orthotriangular Projection, A useful if unesthetic polyhedral map projection to a peculiar plane; Spatial Effects. [cited by applicant]
Dutton, Geoffrey; Planetary Modelling via Hierarchical Tessellation; Prime Computer, Inc. [cited by applicant]
Geohash; Cycle Map; http://geohash.co/; https://github.com/davetroy/geohash-js. [cited by applicant]
Google; Google Plus Map Codes; https://maps.google.com/pluscodes/; https://www.placekey.io/blog/google-maps-plus-codes-location-keys; Apr. 11, 2021. [cited by applicant]
Hussein, Sari Haj; The Hush Cryptosystem; https://arxiv.org/pdf/1205.3021.pdf; May 14, 2012. [cited by applicant]
Jiang, Wen et al.; WHAT3WORDS Geocoding Extensions; https://sci-hub.se/https://link.springer.com/article/10.1007/s41651-018-0014-x; Feb. 15, 2018. [cited by applicant]
MAPCODE; https://www.mapcode.com/about; 2001. [cited by applicant]
.NET Microsoft Learn; How to use character encoding classes in .NET; https://docs.microsoft.com/en-us/dotnet/standard/base-types/character-encoding; Nov. 8, 2021. [cited by applicant]
Rubin, Frank; Experiments in Text File Compression; https://dl.acm.org/doi/pdf/10.1145/360363.360368; https://sci-hub.se/10.1145/360363.360368; Nov. 1, 1976. [cited by applicant]
Samatha et al.; Performance Improvement of MONCRYPT SSA Over Data Obfuscation in Cloud Security; https://www.ijeat.org/wp-content/uploads/papers/v9i2/B2916129219.pdf; Dec. 2019. [cited by applicant]
Snyder, John P.; An Equal-Area Map Projection for Polyhedral Globes; CARTOGRAPHICA, vol. 29, No. 1, Spring 1992, pp. 10-21. [cited by applicant]
Stefanakis, Emmanuel; Location Encoding Systems—Could Geographic Coordinates Be Replaced and at What Cost?; https://gogeomatics.ca/location-encoding-systems-could-geographic-coordinates-be-replaced-and-at-what-cost/; Ma… [cited by applicant]
Transactions in GIS; Advances in Geocoding Research and Practice; https://sci-hub.se/https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-9671.2011.01298.x; 2011. [cited by applicant]
Van Altena, Vincent et al.; Spatial Analysis of New Testament Textual Emendations Utilizing Confusion Distances; https://www.degruyter.com/document/doi/10.1515/opth-2019-0004/html; https://sci-hub.se/10.1515/opth-2019-0… [cited by applicant]
Van Snyder; Quaternary Triangular Mesh: A Hierarchical Coordinate System for Geoprocessing and Cartography; Jet Propulsion Laboratory; California Institute of Technology; Aug. 10, 2016. [cited by applicant]
Zandbergen, Paul A.; A Comparison of Address Point, Parcel and Street Geocoding Techniques; https://sci-hub.se/https://www.sciencedirect.com/science/article/pii/S0198971507000890?via%3Dihub; Jan. 11, 2007. [cited by applicant]
Zhou, Liangchen et al.; Efficient Encoding and Decoding Algorithm for Triangular Discrete Global Grid Based on Hybrid Transformation Strategy; Computer, Environment and Urban Systems; 2017. [cited by applicant]