IP Library Granted Patent US 10,928,202
Granted Patent B2
US 10,928,202 · App. 15/856,690 · Granted Feb 23, 2021

System and methods for three-dimensional volumetric indoor location geocoding

Inventors: John T. Brosowsky (Albany, MN); Avery Penniston (Sartell, MN); Steven Henningsgard (St. Cloud, MN)
Assignee: Geo-Comm Inc.
G01C21/206G06F16/29H04W4/023G06F16/487G06F16/50G09B29/003
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 10,928,202
App. No.
15/856,690
Granted
Feb 23, 2021
Kind
B2
Abstract

A computer implemented method for three-dimensional volumetric indoor location geocoding relative to a geographic location is provided. The method includes: creating a three-dimensional representation of the geographic location; notionally subdividing the three-dimensional representation into an array of discrete elements; receiving an address and converting the address into geographic coordinates; querying the array of discrete elements representing the geographic location; determining a list of all discrete elements with at least one of a matching address and sub-address element attribute; generating a notional minimum bounding three-dimensional polygon containing the matched discrete elements with the at least one matched address and matched sub-address element attribute; determining a list of geodetic coordinates defining the minimum bounding three-dimensional polygon; and presenting the list of geodetic coordinates defining the minimum bounding three-dimensional polygon.

Claims (51)

1. A computer implemented method for three-dimensional volumetric indoor location geocoding relative to a geographic location, the method comprising:

creating a three-dimensional representation of the geographic location;

notionally subdividing the three-dimensional representation into an array of discrete element cubes, wherein the discrete element cubes are in a plurality of layers and wherein each layer comprises a plurality of rows of the discrete element cubes and a plurality of columns of the discrete element cubes;

receiving an address and converting the address into geographic coordinates;

querying the array of discrete element cubes representing the geographic location;

determining a list of all discrete element cubes with at least one of a matching address and sub-address element attribute;

generating a notional minimum bounding three-dimensional polygon containing the matched discrete element cubes with the at least one matched address and matched sub-address element attribute;

determining a list of geodetic coordinates defining the minimum bounding three-dimensional polygon; and

presenting the list of geodetic coordinates defining the minimum bounding three-dimensional polygon.

2. The computer implemented method of claim 1 wherein each discrete element cube of the array of discrete element cubes comprises a three-dimensional polygon shape representing the geographic location.

3. The computer implemented method of claim 2 wherein the three-dimensional polygon comprises a three-dimensional cube having a plurality of geodetic coordinate pairs.

4. The computer implemented method of claim 3 wherein the plurality of geodetic coordinate pairs comprises eight geodetic pairs.

5. The computer implemented method of claim 3 wherein the three-dimensional cube comprises an array of location information, wherein each element of the array includes increasing refinement of location.

6. The computer implemented method of claim 5 wherein the increasing refinement of location comprises at least one of a street address, a building name, a place type, a unit, a room, and a seat.

7. The computer implemented method of claim 1 wherein receiving the address comprises receiving at least one of a textual address, an audible address, and a digital address.

8. The computer implemented method of claim 1 further comprising mapping and displaying a textual street address of the geodetic pairs in a three-dimensional map display.

9. The computer implemented method of claim 8 further comprising validating the text address with a sub-address element.

10. The computer implemented method of claim 9 further comprising validating the text address with a sub-address element to verify an existence of the geographic location.

11. The computer implemented method of claim 9 further comprising validating the text address with a sub-address element to verify a correct spelling and notation for address elements.

12. The computer implemented method of claim 1 further comprising returning three-dimensional geodetic geocoding of varying size and volume based at least on the number and type of sub-address elements included a text of a civic address.

13. The computer implemented method of claim 1 , wherein the discrete element cubes are evenly spaced.

14. The computer implemented method of claim 1 , wherein the discrete element cubes are equally sized.

15. A computer device for three-dimensional volumetric indoor location geocoding relative to a geographic location, the computer device comprising:

a memory device configured to store the geographic location;

an interface device coupled to the memory device and configured to receive input instructions;

a processor coupled to the memory device and the interface device, the processor programmed to:

create a three-dimensional representation of the geographic location;

notionally subdivide the three-dimensional representation into an array of discrete element cubes, wherein the discrete element cubes are in a plurality of layers and wherein each layer comprises a plurality of rows of the discrete element cubes and a plurality of columns of the discrete element cubes;

receive an address and converting the address into geographic coordinates;

query the array of discrete element cubes representing the geographic location;

determine a list of all discrete element cubes with at least one of a matching address and sub-address element attribute;

generate a notional minimum bounding three-dimensional polygon containing the matched discrete element cubes with the at least one matched address and matched sub-address element attribute;

determine a list of geodetic coordinates defining the minimum bounding three-dimensional polygon; and

present the list of geodetic coordinates defining the minimum bounding three-dimensional polygon.

16. The computer device of claim 15 wherein the processor is further programmed to receive at least one of a textual address, an audible address, and a digital address.

17. The computer device of claim 15 wherein the processor is further programmed to map and display a textual street address of the geodetic pairs in a three-dimensional map display.

18. The computer device of claim 17 wherein the processor is further programmed to validate the text address with a sub-address element.

19. The computer device of claim 18 wherein the processor is further programmed to validate the text address with a sub-address element to verify an existence of the geographic location.

20. The computer device of claim 18 wherein the processor is further programmed to validate the text address with a sub-address element to verify a correct spelling and notation for address elements.

21. The computer device of claim 15 wherein the processor is further programmed to return three-dimensional geodetic geocoding of varying size and volume based at least on the number and type of sub-address elements included a text of a civic address.

22. The computer device of claim 15 , wherein the discrete element cubes are evenly spaced.

23. The computer device of claim 15 , wherein the discrete element cubes are equally sized.

24. One or more non-transitory computer-readable media having computer-executable instructions embodied thereon for three-dimensional volumetric indoor location geocoding relative to a geographic location using a computer device having a memory and a processor, wherein when executed by the processor, the computer-executable instructions cause the processor to:

create a three-dimensional representation of the geographic location;

notionally subdivide the three-dimensional representation into an array of discrete element cubes, wherein the discrete element cubes are in a plurality of layers and wherein each layer comprises a plurality of rows of the discrete element cubes and a plurality of columns of the discrete element cubes;

receive an address and converting the address into geographic coordinates;

query the array of discrete element cubes representing the geographic location;

determine a list of all discrete element cubes with at least one of a matching address and sub-address element attribute;

generate a notional minimum bounding three-dimensional polygon containing the matched discrete element cubes with the at least one matched address and matched sub-address element attribute;

determine a list of geodetic coordinates defining the minimum bounding three-dimensional polygon; and

present the list of geodetic coordinates defining the minimum bounding three-dimensional polygon.

Assignments (5)
AN ASSIGNMENT OF PATENT & TRADEMARK SECURITY INTEREST WHEREIN A LENDER IS BEING ASSIGNED THE IP SECURITY INTERESTS FROM ANOTHER LENDER. Recorded May 31, 2024
From: JPMORGAN CHASE BANK, N.A.
To: BELL BANK
Reel/Frame 067622/0975 →
RELEASE OF SECURITY INTEREST Recorded Dec 6, 2022
From: BMO HARRIS BANK N.A.
To: GEO-COMM, INC.
Reel/Frame 061998/0789 →
SECURITY INTEREST Recorded Dec 1, 2022
From: GEO-COMM, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 061943/0217 →
SECURITY INTEREST Recorded Dec 31, 2019
From: GEO-COMM, INC.
To: BMO HARRIS BANK N.A.
Reel/Frame 051394/0983 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 16, 2018
From: BROSOWSKY, JOHN T.; PENNISTON, AVERY; HENNINGSGARD, STEVEN
To: GEO-COMM INC.
Reel/Frame 044626/0968 →
Continuity (2)
Provisional Application 62440443 · Dec 30, 2016
Related Publication 20180188035A1 · Jul 5, 2018