3D Volumetric Indoor Geocoding via Discrete Element Subdivision

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional two-dimensional geocoding methods are inadequate for accurately representing locations inside buildings or venues with multiple levels, as they cannot effectively convert textual civic addresses with sub-address elements into three-dimensional volumetric geometries, limiting the precision of indoor location identification.

Innovation Solution

A computer-implemented method and system that creates a three-dimensional representation of a geographic location, subdivides it into discrete elements, and converts textual civic addresses with sub-address elements into three-dimensional volumetric geometries, allowing for precise geocoding of indoor locations by determining a list of geodetic coordinates defining a minimum bounding three-dimensional polygon.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If two-dimensional geocoding methods are used, then the system complexity is low and ease of operation is maintained, but the measurement precision for indoor locations deteriorates

Engineering Contradiction:
Improvelocation identification precisionVSAvoidgeocoding system complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent transitions from two-dimensional point-based geocoding to three-dimensional volumetric geocoding by introducing elevation/depth as a third dimension. This allows representation of indoor locations across multiple floors and vertical spaces, enabling precise location identification inside buildings while maintaining the benefits of automated geocoding processing.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If address feature database matching is used, then the ease of operation is maintained, but the adaptability to indoor locations with multiple building levels deteriorates

Engineering Contradiction:
Improvecapability to represent multi-level indoor locationsVSAvoidgeocoding processing complexity
Core Design Contradiction:
Adaptability or versatilityVSEase of operation

Solution Approach 1:

The patent segments the three-dimensional building space into discrete volumetric elements or cells, each representing a specific indoor location. This segmentation allows the system to handle multi-level indoor locations by assigning appropriate volumetric elements to different floors and spaces, while maintaining automated processing through standardized matching algorithms against the segmented database.

Inventive Principle:
Principle #1Segmentation

3Measurement precision

If address ranged road centerline interpolation is used, then the ease of manufacture is maintained, but the measurement precision for indoor locations deteriorates

Engineering Contradiction:
Improveindoor location geocoding accuracyVSAvoiddatabase construction complexity
Core Design Contradiction:
Measurement precisionVSEase of manufacture

Solution Approach 1:

The patent performs preliminary action by pre-processing and segmenting three-dimensional building data into discrete volumetric elements before geocoding operations. This pre-segmentation enables accurate indoor location representation and allows the geocoding system to efficiently match addresses to appropriate volumetric elements without complex real-time calculations, thus improving precision while maintaining ease of manufacture.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS10928202B2System and methods for three-dimensional volumetric indoor location geocoding
Publication Date: 2021.02.23 GEO COMM INC
  • US10928202B2 patent drawing
  • US10928202B2 patent drawing
  • US10928202B2 patent drawing

AI summary

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.