Compact coding of vector geometries

The unified spatial code addresses the limitations of conventional geocoding systems by providing a compact and accurate representation of vector geometries with error detection, enhancing precision and efficiency in industrial applications.

WO2026238768A1PCT designated stage Publication Date: 2026-11-19MOCK MAXIMILIAN
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/EP2026/063851
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2025-05-13
Filing Date
2026-05-12
Publication Date
2026-11-19

AI Technical Summary

Technical Problem

Conventional geocoding systems fail to comprehensively address the combined requirements of high precision, three-dimensional data representation, data compression, and error detection, particularly in industrial applications where precise location identification, variable geometries, and efficient proximity analysis are necessary.

Method used

A unified spatial code is developed to encode vector geometry data within a coordinate system, incorporating binary encoding of anchor points, shape, and size relative to an anchor point, with optional error detection, enabling compact and accurate representation of vector geometries in both two- and three-dimensional spaces.

Benefits of technology

The unified spatial code reduces storage requirements, enhances spatial accuracy, and ensures data integrity, allowing efficient transmission and human-readable communication while supporting error detection and proximity analysis, suitable for various industrial applications.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure EP2026063851_19112026_PF_FP_ABST
    Figure EP2026063851_19112026_PF_FP_ABST
Patent Text Reader

Abstract

Various implementations relate to systems, methods, and computer-readable media for encoding vector geometries as unified spatial codes. According to one aspect, geospatial data is received, including cell identifiers and vector geometry data comprising an anchor point. The anchor cell identifier and positional data relative to the anchor point are binary encoded, along with a binary code representing the geometry type. The encoded data is concatenated to form a joint binary code, and a binary error detection code is generated based on the joint binary code. The binary spatial code is mapped to a character sequence using a charset with more than two characters, producing the unified spatial code.
Need to check novelty before this filing date? Find Prior Art

Description

COMPACT CODING OF VECTOR GEOMETRIESTECHNICAL FIELD

[0001] This disclosure relates to methods, systems, and computer readable media for computing a compact encoding of vector geometry data within a coordinate system to generate a spatial code representing the vector geometry, the spatial code being configured for efficient proximity analysis, data storage, transmission, and error detection, and being both machine-readable and human-readable.BACKGROUND

[0002] Satellite-based location information is widely used in various services, ranging from navigation to asset tracking.

[0003] Many industries encounter challenges in effectively utilizing location-based data, due to inherent complexities in data representation and transmission. A majority of location data includes singular points on the surface of the earth, expressed in two-dimensional coordinates, e.g., geographic longitude and latitude coordinates, even though many applications would benefit from a three-dimensional notation which would accurately reflect real-world spatial relationships, e.g., include a further coordinate reflecting height above ground or elevation data. A smaller subset of location data to be processed includes comprehensive vector geometries such as polylines and polygons. Such data structures are represented by arrays of singular points which adds complexity to location data structures. A further concern is the size of commonly used location data structures for representing location information: a significant amount of resources is required to store and transmit large amounts of location data. Furthermore, commonly used location data structures make it impractical to reliably use, transfer, or communicate location data and the represented location information by humans.

[0004] Several publicly known location data formats or geocode systems exist which attempt to address one or more of above-mentioned issues. Some common ones are discussed in the following.

[0005] A pair specifying latitude and longitude (lat / lon) is a basic location data format identifying any singular point on earth with a set of two spherical coordinates. It is the basic two-dimensional notation of locations on earth. There are different variants of representation,e.g., N-SZE-W versus + / -, decimal notation or degrees, minutes and decimal seconds, which are often mixed up and result in incorrect location data. A third dimension can be added, but there is no standard for the unit of height, and thus it is mostly omitted. Storage of a singular point in lat / lon with a precision of approximately 1.5 m requires 5 decimals in every coordinate, which can be encoded in 51 bits for 2-diemnsional case or in 67 bits for 3 -dimensional case. A polygon of 4 vertices represented by lat / lon coordinates at the same precision would require 204 bits.

[0006] The S2 geocode system encodes a two-dimensional location into a onedimensional short string consisting of letters and digits, without encoding any height information. For storage of a singular point, S2 uses a level 19 S2 cell, which occupies 64 bits (without height information). A polygon formed by 4 vertices, each represented by an S2 cell at the same precision, would require 256 bits in total.

[0007] Similarly, the H3 geocode system also encodes a two-dimensional location as a one-dimensional string of letters and digits, again without including height information. A singular point in H3 is stored using a level 14 H3 cell, which also requires 64 bits (without height information). Representing a polygon with 4 vertices at the same level of precision would result in 256 bits.

[0008] Geohash is a geocode system that encodes a two-dimensional location into a one-dimensional short string of letters and digits without encoding any height information. Storage of a singular point in Geohash with a precision of approximately 1.5 m requires a level 10 Geohash which occupies 50 bits (without height information). A polygon of 4 vertices represented by four Geohashes at the same precision would require 200 bits.

[0009] Open Location Code (OLC), is another geocode system that encodes a two-dimensional location into a one-dimensional short string of letters and digits without encoding any height information. Storage of a singular point in OLC with a precision of approximately 1.5 m requires a level 7 OLC which occupies 60 bits (without height information). A polygon of 4 vertices represented by four OLCs at the same precision would require 240 bits.

[0010] GeoJSON is an open standard format designed for representing simple geographical features which includes points, polygons and polylines (“line strings”). GeoJSON stores each coordinate or height information in its predefined data structure. Storage of a singular point in GeoJSON with a precision of approximately 1.5 m requires approximately 56 ASCII characters at 8 bit per character totaling to 448 bits without height information and approximately 63 ASCII characters totaling 504 bits with height information. A polygonconsisting of 4 vertices represented by a GeoJSON struct at the same precision would require 800 bits.

[0011] Google Polyline-Encoding is a compression algorithm that allows storage of a series of coordinates in a single one-dimensional string. Google Polyline-Encoding cannot hold any height information. Storage of a singular point in Google Polyline-Encoding with a precision of approximately 1.5 m requires 10 ASCII characters totaling to 80 bits. A polygon consisting of 4 vertices represented by a Google Polyline-Encoding at the same precision would require approximately 216 bits.

[0012] What3Words is a geocode system designed to identify any location on earth with a resolution of approximately 3 meters. It encodes geographic coordinates into three permanently fixed dictionary words. Storage of a singular point in What3Words at the given resolution requires approximately 96 bits as an estimated minimum (each word 4 letters or more). For example, a polygon of 4 vertices represented by a What3Words array at given resolution would require 288 bits as an estimated minimum.

[0013] None of the above listed geocoding systems standardizes the encoding of the third dimension, e.g., by providing a standardized definition of the height variable, e.g., using a consistent measurement unit. Some conventional coding schemes reduce the two-dimensional point coordinate to a one-dimensional representation while also compressing information to a certain degree. Furthermore, some coding schemes focus on compact codes whereas only OLC and What3Words also enable human-readable output but at the cost of increased data size.

[0014] None of the above listed geocoding systems, with one exception, is specifically designed for encoding of geometric features and data compression.

[0015] All the above geocoding systems focus on some, but not all, features that would be necessary to meet the requirements of an industrially usable location identifier. Such requirements would be as follows:

[0016] Precision: An industrial location identifier would have to feature a certain maximal precision (i.e., minimum deviation) and ideally be customizable dependent on the respective use case; it is apparent that a maximum precision of at least some decimeters would be necessary to render the address representation viable for a lot of industrial applications.

[0017] 3 -dimensionality (3D): Our world is three-dimensional (3D), and so an industrial location identifier must accommodate 3D data to accurately represent real-world spatial relationships. Besides identifying a precise location on a (spherical) coordinate system, the ability to also encode information about elevation or height is crucial to enable full usability.

[0018] Variable geometries: All known existing location identifiers either specify a singular point on earth or a (mostly) quadrilateral small area that intends to represent a singular point to a certain precision; an industrialized location identifier ideally allows for various geometries like polygons, polylines, or others to be encoded into the same schema as it can be done with a singular point on earth.

[0019] Compressed code design: All necessary information is to be encoded into a code that is as compressed as possible; a tradeoff must be made as to what extent the code design shall serve computers, humans, or both; overly focusing on computers might make the code very error-prone for human handling, whereas focusing on humans might significantly reduce the data density, resulting in longer codes.

[0020] Location matching and proximity information: An effective location identifier should facilitate spatial analysis by enabling rapid comparison of spatial relationships between locations. When dealing with locations, very often their spatial relation is of highest interest, i.e., whether a point on earth is closer to another point as compared to a third point, or whether two different given points represent the same real-world location; any code design ideally should support reducing the effort to answer these questions. In the best case, the code enables humans to extract that information without requiring any computational support.

[0021] Error-proof manual transmission: Even though an industrialized location identification most likely will mainly be transmitted by computers or machines, human interaction and especially transmission still will always occur to a certain extent; to account for that, any code design would inherently require reducing the susceptibility to errors and would ideally feature a suitable error detection or even correction mechanism.

[0022] Location data quality: Available location data often lacks quality, as it is often derived from postal addresses and other generalized sources, and processed without deeper knowledge or due care. To overcome this, a method for an industrial location identifier should incorporate standardized mechanisms for enabling the complete and correct creation of location information and the diligent transmission to any consumer or storage location.

[0023] Encoding variability: Even though an industrial location identifier would contain a most comprehensive set of location information, there is always a chance that some users would require alternative data to be encoded; thus, the code design should allow for customized composition to also serve such use cases.

[0024] Furthermore, existing geospatial reference systems generally rely on deterministic globally decodable spatial references in which sufficient hierarchy information isretained to uniquely reconstruct a location without contextual reconstruction mechanisms. Such approaches may require longer transmitted references, increased transmission bandwidth, increased spoken transmission duration, and may be less suitable for degraded-network environments, low-bandwidth communication, verbal coordinate exchange, disconnected operation, or context-assisted spatial reconstruction.

[0025] In summary, conventional location encoding systems fail to comprehensively address the combined requirements of high precision, three-dimensional data representation, data compression, and error detection.

[0026] The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent it is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.SUMMARY

[0027] Implementations described herein relate to methods, systems, and computer-readable media for computing a compact encoding of vector geometry data within a coordinate system to generate a spatial code, called unified spatial code herein, representing the vector geometry.

[0028] Aspects of the disclosure are directed to a computer-implemented method of encoding a vector geometry as a unified spatial code for spatial data processing, the computer-implemented method comprising: receiving information corresponding to one or more cells within a geospatial area, each cell being associated with a cell identifier, wherein the one or more cells define spatial boundaries for encoding vector geometry data; receiving data corresponding to a vector geometry located within the one or more cells, wherein the vector geometry comprises an anchor point, and wherein the anchor point defines a reference location for the vector geometry within the geospatial area; binary encoding the vector geometry by: determining an anchor cell identifier of the one or more cells within which the anchor point is located, binary encoding the anchor cell identifier, and binary encoding positions, a shape, and a size of the vector geometry relative to the anchor point to obtain vector geometry binary data; binary encoding a vector geometry type to obtain a binary code of the vector geometry type; concatenating the binary encoding of the anchor cell identifier, the vector geometry binary data,and the binary code of the vector geometry type to obtain a joint binary code; computing a binary error detection code based on the joint binary code; concatenating the joint binary code and the binary error detection code to obtain a binary spatial code; and mapping the binary spatial code into a sequence of characters using a charset comprising more than two characters to obtain the unified spatial code, wherein the unified spatial code is usable for subsequent spatial data processing.

[0029] An advantage of a unified spatial code is its very compact and unique representation of the vector geometry, which makes the unified spatial code an ideal representation for storing a vector geometry in a computer storage, e.g., in a file storage of a database. The storage size requirements are reduced compared to conventional encodings and the resolution and level of detail encoded in the unified spatial code representation are significantly enhanced compared to conventional technologies discussed hereinabove in the background section. For example, a single geospatial coordinate in decimal degrees expressed as latitude and longitude can traditionally be stored using two 32-bit integers by scaling floating-point values to fixed-point integers, yielding a 64-bit representation. In contrast, a 12-character unified spatial code can encode a point using only 60 bits in total, including a 6-bit CRC for error detection and a 2 -bit radius parameter, resulting in an actual positional encoding size of only 52 bits. Despite its compactness, the unified spatial code preserves spatial accuracy while adding data integrity and contextual radius information, enabling reliable encoding and transmission of location data in significantly less space. Furthermore, the encoding is suitable and simple, especially as a character sequence, to be handled and communicated in nonelectronic form, e.g. on paper or by humans. Another advantage is the mono-component structure of the unified spatial code, which allows for simpler database implementation, since only one field / column in the database is required for storage instead of two fields / columns to store latitude / longitude coordinates separately or, for example, 10 fields / columns to store information about a polygon or polyline with five vertices. The incorporation of binary error detection capabilities in the unified spatial code can be optional and ensures data integrity during transmission, particularly over unreliable or noisy communication channels. For example, when synchronizing geospatial data encoded as unified spatial code as described herein between cloud storage and edge devices, the checksum embedded in the unified spatial code enables verification of whether the transmitted or stored spatial data has been corrupted during transfer. In a further example, in vehicle tracking systems, an encoded location may be protected by a CRC checksum. Any unauthorized attempt to alter, e.g., a vehicle location, e.g.,to conceal an unscheduled stop or falsify a route, requires not only recalculating the spatial encoding but also generating a valid checksum. Without access to the CRC generation method and / or if the CRC generation method is secret, such manipulations could be detected automatically since an incorrect checksum would be detected and thus unveil that the unified spatial code was tampered with.

[0030] In some implementations, the anchor point is specified using a latitude / longitude coordinate of a geospatial location represented by the anchor point.

[0031] This implementation makes the unified spatial code suitable to encode and compress geocoordinates and geospatial information such as position, shape and size of points, traces, vectors, areas and other vector geometry information. The fact that the anchor point concept allows for efficient location matching and proximity detection without the necessity to decompose and / or decode the unified spatial code as location identifiers, especially when working and comparing with a large number of location identifiers. In other words, binary anchor points enable compression of vector geometries such as paths, boundaries, or geofences into binary streams that require significantly less space and processing power to store, transmit, and interpret. For example, navigation systems can use polygons encoded as unified spatial codes as described herein as geofences, e.g., restricted areas or target zones, which can be decoded locally. This allows mobile clients, such as vehicles or drones, to efficiently determine whether they are within a designated area without permanent connection to a central server via the internet.

[0032] In an embodiment, the spatial reference system further comprises a parametric geometry encoding framework, wherein spatial geometries are represented by a combination of a geospatial anchor and one or more parameterized geometric attributes. The geospatial anchor defines a reference position on or relative to the Earth's surface, and the parameterized geometric attributes define the spatial extent, orientation, or motion of the geometry relative to said anchor. Such parameterized attributes may include, but are not limited to:• radial extents,• vertical extents,• directional vectors,• scalar magnitudes,• orientation parameters, and• combinations thereof.The parameters may be encoded using compact binary representations with predefined or adaptive precision and may be interpreted relative to a local coordinate system at the anchor location.

[0033] Furthermore, binary anchor points enable fast spatial proximity lookups without a need for floating-point calculations or complex geospatial database queries common in conventional coding of geospatial information. For example, a mapping system can use a database of points of interest, POIs, e.g., fuel stations or charging points, encoded as unified spatial codes as described herein to quickly identify spatially nearby locations relative to a given anchor point, using simple binary comparisons and table lookups instead of real-time geometric distance calculations. Mobile navigation applications can store routes, network graphs, or POI clusters as vector data compactly encoded as unified spatial code as described herein, enabling offline analysis and navigation. This reduces memory usage, speeds up access, and supports operation in areas where a communication signal for mobile wireless communication is not available, e.g., in rural areas.

[0034] In some implementations, the vector geometry may further include a height information of the anchor point. This additional information makes the unified spatial code suitable for efficiently encoding not only vector geometries in a two-dimensional space but also vector geometries in a three-dimensional space.

[0035] In an embodiment, vertical positioning is encoded relative to the Earth's surface or a reference level using a surface-relative vertical encoding scheme. The vertical encoding may support multiple representations, including metric height, discrete levels such as building storeys, or standardized aviation altitude representations such as flight levels. The encoding may use dense or scaled representations and may omit explicit sign bits by mapping value ranges to positive and negative vertical offsets.

[0036] In some implementations, vector geometry further comprises information specifying a shape type parameter defining a geometric primitive located at the anchor point and a characteristic length of the geometric primitive, wherein, optionally, a shape type is a circle or sphere, and the characteristic length is a radius of the circle or the sphere. This additional information allows to represent information about simple geometric shapes, i.e. geometric primitives, at the anchor point in the unified spatial code. In an embodiment, a spatial geometry may be defined as a three-dimensional radial geometry, wherein the geometry is represented by an anchor position and a radial extent defining a spherical region around said anchor. The radial extent may be encoded as a scalar parameter representing the radius of thesphere, using a non-linear or multi-scale encoding scheme to optimize precision across different spatial ranges.

[0037] In an embodiment, a spatial geometry is defined as a directed vector, wherein the geometry is represented by:• an anchor defining the origin of the vector,• a directional component defining orientation in three-dimensional space, and• a scalar magnitude defining the extent of the vector.The directional component may be encoded using quantized angular parameters relative to a local coordinate system, and the scalar magnitude may represent distance, displacement, speed, or other spatial quantities depending on the interpretation context. In an embodiment, the interpretation of the scalar magnitude is determined by a mode indicator encoded within the spatial reference.

[0038] In an embodiment, a spatial geometry is defined as a cylindrical volume, wherein the geometry is represented by:• an anchor defining a base position,• a radial extent defining the horizontal size of the cylinder, and• a vertical extent defining the height of the cylinder.The vertical extent may be encoded relative to the anchor using a surface-relative vertical encoding, and the cylinder may be defined as extending from the base position in a defined vertical direction. In an embodiment, the radial and vertical extents may be jointly encoded using a compact combined parameter representation.

[0039] In some implementations, the method may further include calculating a circular sunflower seed arrangement pattern to obtain a defined sequence of calculated points that form the circular sunflower seed arrangement pattern. The vector geometry thereby defines one or more vertices and the calculated points are numbered in ascending order and projected onto the geospatial area where a radius of the circular sunflower seed arrangement pattern, or for a three-dimensional case the angle of the polar coordinate, is equal or larger than a largest distance of all vertices of the vector geometry from a center of the vector geometry. The nearest sunflower seed point to each vertex is identified and each respective number is binary encoded while following a logical order of the plurality of vertices. The circular seed arrangement pattern enables very compact encoding of vector geometries since it represents one of the most dense and efficient packaging / distribution of points in any given circular surface, which in turn means it is the best approximation to assign each point the exact same area around itself in a givencircular area. While simple geometric shapes are encoded using the shape type parameter and characteristic length described above, the use of the circular sunflower seed arrangement pattern enables compact encoding or complex and irregular vector geometries, i.e. geometric shapes.

[0040] Specifically, the circular sunflower seed arrangement with the defined sequence of points may be calculated usingu = n ■ (1 + 5) ■ iwhere u represents a proportional distribution along an azimuthal direction of the surface of the sphere, i is an index of a respective point in the sequence of points and / iv = arccos 1 — 2 ■ — — —\ N / pswhere v represents a proportional distribution of the point in the sequence of points along a polar direction of the spherical surface, i is the index of the point in the sequence of points, N is the total number of points to be distributed on a surface of the sphere and psis a surface ratio, representing a fraction of a selected section of the sphere that is covered by the sequence of points and a total surface area of the sphere. One advantage of using the sunflower seed arrangement is to obtain a highly dense and efficient packaging and coding of a sequence of points in a given circular area. To further enhance storage efficiency for storing large sets of tracking points, the unified spatial coding presented herein can be extended using larger codes capable of supporting expanded sunflower-based or alternative spatial point clouds. These larger codes allow the relative encoding of hundreds of spatial points in relation to a single anchor, potentially covering entire regions or countries within a single code domain. The relative encoding structure permits substantial data compaction compared to storing individual absolute coordinates.

[0041] In some implementations, the circular sunflower seed arrangement can be used to describe the plurality of the vertices of the vector geometry. This enables a highly efficient and compact representation of vertices’ positions relative to the anchor point.

[0042] In some implementations the vector geometry may be a polygon defined by a plurality of vertices representing an area of interest, wherein the anchor point equals a best fit of a center of the polygon or a center of a circle that encircles the polygon and preferably has a minimum radius.

[0043] In some implementations, the vector geometry is a polyline defined by a plurality of vertices representing a route of interest, wherein the anchor point equals a best fit of a center of the polyline.

[0044] In some implementations, the vector geometry may be a point of origin and a point of destination of interest, wherein the anchor point equals one of the point of origin or the point of destination and cell identifiers for the point of origin and / or the point of destination are determined.

[0045] In an embodiment, specific geometries may be derived from parameterized geometries by degenerate parameter configurations. For example, a cylindrical geometry with zero vertical extent may represent a circular area, and other lower-dimensional geometries may be represented as special cases of higher-dimensional parameterized forms.

[0046] In some implementations, the vector geometry may further include a directional information, which is one of a direct directional information or reverse, wherein the directional information is binary encoded.

[0047] Another aspect of the disclosure is directed to a computer-implemented method of decoding a vector geometry from a unified spatial code, comprising: receiving the unified spatial code as a sequence of characters; decoding the sequence of characters to a binary sequence, which is a binary spatial code, using a predefined charset, the predefined charset comprising more than two characters; splitting the binary spatial code into a joint binary code and a binary error detection code; computing a binary check code based on the joint binary code and verifying a validity of the joint binary code by comparing the binary check code with the binary error detection code; splitting the joint binary code into binary encoding of an anchor cell identifier, vector geometry binary data and a binary code of a vector geometry type; binary decoding the vector geometry type; binary decoding the anchor cell identifier; binary decoding the vector geometry binary data to obtain positions, shape and size of the vector geometry relative to an anchor point; calculating one or more geospatial coordinates in a given coordinate system to obtain the vector geometry based on the positions and the shape of the vector geometry relative to the anchor point. The decoding of unified spatial codes can be done efficiently, which enables real-time integration into navigation and mapping systems, where decoding of location data must be fast, lightweight, and compatible with constrained devices such as mobile phones, embedded modules, or drones.

[0048] Another aspect of the disclosure is directed to a computing device for encoding a vector geometry as a unified spatial code for spatial data processing, the computing device comprising: one or more processors; and memory coupled to the one or more processors storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: receiving information corresponding to one ormore cells within a geospatial area, each cell being associated with a cell identifier, wherein the one or more cells define spatial boundaries for encoding vector geometry data; receiving data corresponding to a vector geometry located within the one or more cells, wherein the vector geometry comprises an anchor point, and wherein the anchor point defines a reference location for the vector geometry within the geospatial area; binary encoding the vector geometry by: determining an anchor cell identifier of the one or more cells within which the anchor point is located, binary encoding the anchor cell identifier, and binary encoding positions and a shape of the vector geometry relative to the anchor point to obtain vector geometry binary data; binary encoding a vector geometry type to obtain a binary code of the vector geometry type; concatenating the binary encoding of the anchor cell identifier, the vector geometry binary data, and the binary code of the vector geometry type to obtain a joint binary code; computing a binary error detection code based on the joint binary code; concatenating the joint binary code and the binary error detection code to obtain a binary spatial code; and mapping the binary spatial code into a sequence of characters using a charset comprising more than two characters to obtain the unified spatial code, wherein the unified spatial code is usable for subsequent spatial data processing.

[0049] Another aspect of the disclosure is directed to a non-transitory computer-readable medium for encoding a vector geometry as a unified spatial code for spatial data processing, with instructions stored thereon that, when executed by a processor, cause the processor to perform operations comprising: receiving information corresponding to one or more cells within a geospatial area, each cell being associated with a cell identifier, wherein the one or more cells define spatial boundaries for encoding vector geometry data; receiving data corresponding to a vector geometry located within the one or more cells, wherein the vector geometry comprises an anchor point, and wherein the anchor point defines a reference location for the vector geometry within the geospatial area; binary encoding the vector geometry by: determining an anchor cell identifier of the one or more cells within which the anchor point is located, binary encoding the anchor cell identifier, and binary encoding positions and a shape of the vector geometry relative to the anchor point to obtain vector geometry binary data; binary encoding a vector geometry type to obtain a binary code of the vector geometry type; concatenating the binary encoding of the anchor cell identifier, the vector geometry binary data, and the binary code of the vector geometry type to obtain a joint binary code; computing a binary error detection code based on the joint binary code; concatenating the joint binary code and the binary error detection code to obtain a binary spatial code; and mapping the binaryspatial code into a sequence of characters using a charset comprising more than two characters to obtain the unified spatial code, wherein the unified spatial code is usable for subsequent spatial data processing.

[0050] According to yet another aspect, portions, features, and implementation details of the systems, methods, and non-transitory computer-readable media may be combined to form additional aspects, including some aspects which omit and / or modify some or portions of individual components or features, include additional components or features, and / or other modifications, and all such modifications are within the scope of this disclosure.

[0051] In some embodiments, the unified spatial code system further supports context-assisted reconstruction modes in which a hierarchical spatial identifier is intentionally truncated by removing higher-order hierarchy information while retaining lower-order hierarchy information preserving local spatial structure. The truncated spatial reference may subsequently be reconstructed using contextual geographic information, candidate hierarchy generation, hierarchy validity filtering, redundancy filtering, and contextual geographic filtering. Such embodiments may enable reduced transmission size, degraded-network operation, low-bandwidth geospatial communication, verbal coordinate exchange, and context-bounded spatial reconstruction.

[0052] In some embodiments, reconstruction of the truncated spatial reference provides practical context-bounded uniqueness without requiring deterministic global uniqueness.LIST OF FIGURES

[0053] Figure 1 shows a flow diagram of a method for generating unified spatial codes from a vector geometry input.

[0054] Figure 2 shows a sunflower seed arrangement pattern with 64 points, excluding the center point (origin) and a spiral trace evolving from the origin until sunflower seed arrangement pattern point 32.

[0055] Figure 3 shows a sunflower seed arrangement pattern with 256 points, including the center point which is marked with an X (“cross”).

[0056] Figure 4 shows a polygon, defined by the pattern of Figure 3, where the polygon’s five vertices are represented by sunflower seed arrangement pattern point IDs 100, 152, 57, 14 and 140 and where the polygon’s defined anchor point equals the origin of the sunflower seed arrangement pattern and is marked by an X.

[0057] Figure 5 shows a polyline, defined by the pattern of Figure 3, where the polyline’s five vertices are represented by sunflower seed arrangement pattern point IDs 150, 100, 50, 57 and 170 and where the polyline’s defined anchor point equals the origin of the sunflower seed arrangement pattern and is marked by an X.

[0058] Figure 6 shows an example section of a street map with some buildings, streets and a junction. An example grid is overlaid.

[0059] Figure 7 shows the example street map section of Figure 6 zoomed in focusing on the “BMW Vierzylinder” building with a refined example grid overlaid. A “Point” geometry with radius and floor level information is depicted.

[0060] Figure 8 provides a flowchart outlining the process of generating binary data from a vector geometry of type “Point” to then be concatenated as described and shown in Figure 1.

[0061] Figure 9 shows an example code scheme, explaining how all information about a vector geometry “Point” could be first codified into a joint binary code and subsequently in a binary unified spatial code.

[0062] Figure 10 shows the example street map section zoomed in focusing on the “BMW Vierzylinder” building with an adjusted example grid overlaid. A “Polygon” geometry and a sunflower seed arrangement pattern are depicted.

[0063] Figure 11 provides a flowchart outlining the process of generating binary data from a vector geometry of type “Polygon” to then be concatenated as described and shown in Figure 1.

[0064] Figure 12 shows an example code scheme, explaining how all information about a vector geometry “Polygon” could be first codified into a joint binary code and subsequently in a binary unified spatial code.

[0065] Figure 13 shows the example street map section with an adjusted example grid overlaid. A “Polyline” geometry and a sunflower seed arrangement pattern are depicted.

[0066] Figure 14 provides a flowchart outlining the process of generating binary data from a vector geometry of type “Polyline” to then be concatenated as described and shown in Figure 1.

[0067] Figure 15 shows an example code scheme, explaining how all information about a vector geometry “Polyline” could be first codified into a joint binary code and subsequently in a binary unified spatial code.

[0068] Figure 16 shows the example street map section with an adjusted example grid overlaid. An “Origin-Destination” is depicted.

[0069] Figure 17 provides a flowchart outlining the process of generating binary data from a vector geometry of type “Origin-Destination” to then be concatenated as described and shown in Figure 1.

[0070] Figure 18 shows an example code scheme, explaining how all information about a vector geometry “Origin-Destination” could be first codified into a joint binary code and subsequently in a binary unified spatial code.

[0071] Figure 19 shows an example process for generating a truncated spatial reference from a canonical hierarchical spatial identifier by removing higher-order hierarchy information while retaining lower-order hierarchy information preserving local spatial structure.

[0072] Figure 20 shows an example process for generating and filtering candidate hierarchy identifiers during contextual reconstruction of a truncated spatial reference.

[0073] Figure 21 shows an example process for reducing candidate ambiguity using redundancy filtering and contextual geographic filtering to obtain a reconstructed canonical spatial identifier.

[0074] Figure 22 shows a schematic view of an example computing device that may be used to implement the systems and methods described herein.DETAILED DESCRIPTION

[0075] In the following detailed description, reference is made to the accompanying drawings, which form a part hereof. In the drawings, similar symbols typically identify similar components, unless context dictates otherwise. The illustrative implementations described in the detailed description, drawings, and claims are not meant to be limiting. Other implementations may be utilized, and other changes may be made, without departing from the scope of the subject matter presented herein. Aspects of the present disclosure, as generally described herein, and illustrated in the Figures, can be arranged, substituted, combined, separated, and designed in a wide variety of different configurations, all of which are contemplated herein.

[0076] A computer implemented method is provided for generating a unified spatial code. A unified spatial code encodes a vector geometry in a given geospatial domain. For example, a unified spatial code encodes the geographical location of an anchor point. In additionto the anchor point, further information may be encoded about the vector geometry, which can be one of a (single) point, an angle (defined by three points, or defined by length of a circular arc and its orientation, or defined by two vectors), a direction (defined by two points or defined by a vector), also called Origin-Destination in the following, a sequence of points forming a polyline, a shape, an area, a body, a mesh or other geometries that can be defined by a sequence of points. In addition, further information may be encoded such as a unit, a size or generic information, e.g. a number of floors, an elevation or height of a structure, an altitude of an aircraft, a length of a measurement, a direction of a movement, a speed or an acceleration of an object, or any other spatially related information. For example, this information could be used to indicate, for an aircraft, ship, similar vehicle, or any object, a current position, speed, and direction. In addition, an acceleration could be encoded, which would indicated if a vehicle or object is braking, accelerating, or simply maintaining its speed. Yet in addition, a unified spatial code may include a type information and additional information enabling error detection and / or error correction. The length of a unified spatial code can vary, depending on the information encoded therein. For example, the unified spatial code can be a base32 encoding of length 16 characters (equivalent to 80 binary bits); alternatively, the encoding can 12 characters base32 (equivalent to 60 binary bits) if only a single point and no further type information is encoded. Examples will be described in more detail in the following.

[0077] To enable a consistent interpretation of the encoded spatial information, various spatial references used herein will first be defined more precisely. The term point refers to an abstract location in space. The term vertex denotes a specific point that forms part of a higher-level structure, for example the corners of a polygon or polyline. The term position refers to the location of an object in space. Unlike a point, a position is always associated with a specific object and may vary as the object moves. The term shape refers to the geometric form of an object or spatial structure, as defined by a set of connected vertices. Shapes can be two-dimensional, such as lines, polygons, or polylines or three-dimensional, such as meshes or polyhedral surfaces. Shapes may also include geometric primitives such as circles or spheres, rectangles or cubes, or triangles or polyhedrons, depending on the encoded structure. The term geometry, in contrast, refers to a shape together with its specific dimensions, proportions, and spatial measurements, typically defined within a coordinate system. In this context, the center of a geometry - such as the center of a polygon or polyline - refers to a representative point, data is particularly suitable for spatial placement of the geometry within a given area. This center may, for example, correspond to the center of gravity of the geometry, also known ascentroid, or to the center of the smallest enclosing circle or sphere that fully contains the geometry.

[0078] The computation of a unified spatial code can be understood as compressing vector geometry data in a given coordinate system by relative referencing and while maintaining high precision. The vector geometry data can represent location information on earth. The unified spatial code is both database and human-friendly allowing for proximity analysis and enabling transmission error detection. A concrete vector geometry encoded as a unified spatial code can be utilized as versatile and very compact location identifier or location designator. More generally, the methods and principles for representing vector geometries as unified spatial code might well serve as an industry standard.

[0079] For example, a unified spatial code can be used in different application domains, some of which are described in the following: A unified spatial code can be an address designator for logistic deliveries or pick-ups. In other applications, the unified spatial code can be used as a precise area designator for, emergency medical service, EMS, fire or law-enforcement agencies in volatile scenarios. In yet other applications, a unified spatial code can be used as a precise route designator for military operators to transmit sequences or waypoints in highly contested environments. In other application the unified spatial code is used as origindestination designator to integrate drone operations in existing air traffic control procedures.

[0080] The generation of a unified spatial code includes the following steps: Initially, an array of cells is defined across a geospatial area, each cell having a unique cell identifier, wherein the cells partition the area into smaller areas, the cells typically having the similar shape and similar size, covering the entire geospatial area; after receiving information about a vector geometry located within one or more cells, a suitable anchor point of the vector geometry is defined, the cell identifier best representing the anchor point is identified and the cell identifier is binary encoded. Then further geometry data is binary encoded, depending on the type of the vector geometry, different methods of geometry representation are used. After generating a unified spatial code, the unified spatial code may be stored in a computer storage such as volatile or non-volatile storage or a database.

[0081] FIG. 1 shows a flowchart breaking down the general process of generating a unified spatial code in a charset with more than two characters from a given vector geometry. In an initial step 105, the specific vector geometry is provided to the system. In a general step 110 the vector geometry’s data is processed and encoded. This will be specifically described in detail in following figures. In a step 115 the type parameter of the vector geometry is binaryencoded. In a step 120 all binary data obtained so far is concatenated to a joint binary code. In a step 125 a binary CRC error detection code is generated from the joint binary code, e.g., using the CRC-6 algorithm. The use of other error detection and / or correction codes is possible. In a step 130 the binary error detection code and the joint binary code are concatenated to the binary spatial code. In a final step 135 a unified spatial identifier is obtained by translating the joint binary code using a charset of more than two characters. Step 125 and the inclusion of an error detection or correction code through concatenation 130 in the unified spatial code is optional.

[0082] In some embodiments, vector geometries are represented relative to an anchor point using a deterministic spatial point distribution pattern defining a plurality of reference points distributed around the anchor point. Geometry vertices may be represented by identifiers associated with reference points nearest to the respective geometry vertices. The deterministic spatial point distribution pattern comprises:• a sunflower seed arrangement pattern,• a rectangular point grid,• an orthogonal point distribution,• a triangular point distribution,• a hexagonal point distribution,• a quasi-uniform point distribution,• a hierarchical point distribution,• a multi-resolution point distribution, or• other deterministic or pseudo-deterministic spatial point arrangements.In other words, the technology presented herein is not limited to sunflower-based point distributions. Any deterministic point distribution suitable for compact relative encoding of geometry vertices relative to an anchor point may be utilized.

[0083] In the example shown in FIG. 2, a sunflower seed arrangement pattern comprising only 64 sunflower seed points is shown where each sunflower seed point is numbered, e.g. 201 sunflower seed point #58. The pattern is created utilizing a mathematical equation describing a spiral trace evolving from the diagrams origin with a constantly increasing azimuthal angle and a constantly increasing radius position. The spiral 202 is depicted from origin of the coordinate system until point number 32 to show the process of generating and numbering the sunflower seed points. The spiral shown in FIG. 2 is generated using an equation suitable for 2-dimensional space using a Cartesian coordinate system forsimplicity and better display. For a spherical and 3-dimensional coordinate system, the circular sunflower seed point arrangement with a defined sequence of points is calculated usingu = n ■ (1 + 5) ■ iwhere u represents a proportional distribution along an azimuthal direction of the spherical surface, i is an index of a respective point in the sequence of points and / iv = arccos 1 — 2 - —\ N / pswhere v represents a proportional distribution of a point along a polar direction of the spherical surface, i is the index of the point in the sequence of points, N is the total number of points to be distributed on the surface and psis a surface ratio, representing a fraction of the sphere’s selected section that is covered by the sequence of points and the sphere’s total surface area. A sphere concerns the three-dimensional case where the vector geometry is defined in three-dimensional space. If the vector geometry is defined in two-dimensional space, then the sphere of the three-dimensional case corresponds to a circle in the two-dimensional case.

[0084] FIG. 3 shows a sunflower seed arrangement pattern with 256 points, which will be utilized for further figures and examples for practicability. The center point 301 of the sunflower seed arrangement pattern is marked with an “X”.

[0085] In the example shown in FIG. 4, a polygon 401 defined by 5 vertices in total is displayed. The vertices are all positioned such that they correlate with the points of the sunflower seed arrangement pattern, e.g. upper right polygon vertex 402 which also can be identified by sunflower seed arrangement point #57.

[0086] The example shown in FIG. 5, displays a polyline 501 defined by 5 vertices in total. The vertices are all positioned such that they correlate with the points of the sunflower seed arrangement pattern, e.g. rightmost polyline vertex 502 which also can be identified by sunflower seed arrangement point #57.

[0087] The sunflower seed arrangement pattern fits especially an underlying grid structure defining the array of cells across the geospatial area that utilizes hexagonal cell shapes. In addition to that, other patterns can also be used, such as hexagonal point pattern, triangular point pattern, rectangular point pattern, or any other pattern that suits the underlying grid structure defining the array of cells across the geospatial area.

[0088] FIG. 6 shows an example section of a street map with some buildings 601, streets 602 and a bigger junction 603. An example grid 604 is overlaid on the map defining an array of cells. The geospatial area 600 shown in the map is partitioned into 98 rectangular grid cells.While FIG. 6 shows rectangular cells, the cells could have a different shape. Each cell, e.g. cell #54, 605 might serve as a representation for an anchor point to derive further geometry data from. In the example, each cell has a unique cell identifier 606, ranging from number 1 to 98, also indicated as #1 to #98 herein.

[0089] In the example shown in FIG. 7, the example street map section is further zoomed in onto building 601 ’’BMW Vierzylinder”. The example grid is further refined allowing for higher resolution. Example grid cell #149701 is used to represent the anchor point of a vector geometry of type “point” 702. Additionally, geometric primitive 703 is depicted with a dotted line, whereas the geometric primitive represents a circle with a radius as its characteristic length, as well as a height information indicating the 8thfloor of the building 704.

[0090] FIG. 8 provides a flowchart outlining the process of generating binary data from a vector geometry of type “Point” to then be concatenated as described in FIG. 1, step 120 above. Starting with provided vector geometry data in step 105, and if the vector geometry is of type “Point” as outlined in step 805, first the cell ID 701 of a grid 604 with applicable resolution is found in step 810 that best matches the vector geometry of type “Point” latitude / longitude position. In step 815, the point cell ID is binary encoded. In step 820 the floor number provided is binary encoded. In step 825, the height measure / floor number type parameter is binary encoded. In step 830, the shape characteristic length is binary encoded. In step 835, the shape type parameter is binary encoded.

[0091] An example code scheme is shown in FIG. 9, explaining how all information about a vector geometry “Point” is first codified into a joint binary code and subsequently in a binary unified spatial code. As displayed in the table, all binary encoded information of vector geometry type, anchor cell ID, height value, height type, shape characteristic length and shape type parameter are concatenated to the joint binary code in an initial step. The vector geometry type describes which type of vector geometry is encoded in the particular unified spatial code. In the figure, a “point” is encoded, which is indicated by a value of 1 encoded in the four-bit field vector geometry type. Other vector geometry types are described below. The disclosure should be understood as limiting the vector geometry type to the particular vector geometry types described herein. A suggested length of four bits enables 16 different vector geometry types. The vector geometry type implies and defines how subsequent bits in the unified spatial code are to be interpreted, i.e., which filed follow in the encoding sequence and how they should be interpreted to define a particular vector geometry. The height value specifies an absolute value of the height information, e.g. the value 8 in the figure. In the example, the height typespecies how to interpret the height value, e.g., in terms a number of floors (bit value 0) or as metric unit (bit value 1). In summary the give unified spatial code specifies a height information as eighth floor of the building. The shape characteristic indicates a circle (bit value 0). The shape characteristic length field indicates a radius of the circle with value 5 out of 256 values resulting from the 8 possible bits. The binary encoded information is shown in the figure in a particular order. Other orders are possible. In a second step a CRC-6 error detection code is generated from the joint binary code. In the last step, the error detection code and the joint binary code are concatenated to the binary spatial code. In the figure, the error detection and / or correction code is shown at the beginning of the bit sequence. Alternatively, the error detection and correction code could be injected anywhere into the sequence.

[0092] Structurally similar to the example of the circle represented by the unified spatial code in FIG. 9, a speed or an acceleration of an object, or any other spatially related information could be encoded. To encode such information, a different vector geometry type may be defined with fields encoded in the unified spatial code that represent height information and additional information representing a direction of movement and acceleration.

[0093] In the example shown in FIG. 10, building 601 is represented by a polygon vector geometry 1001. A different grid resolution was selected. The polygons center is best represented by cell #26 1002 and its center which is marked with a star 1003. A sunflower arrangement pattern was created with its origin exactly matching cell #26’ s center, and some points of that sunflower arrangement pattern are indicated in the figure with reference numeral 1004.

[0094] FIG. 11 provides a flowchart outlining the process of generating binary data from a vector geometry of type “Polygon” to then be concatenated as described in step 120 above. Starting with provided vector geometry data in step 105 and if the vector geometry is of type “Polygon” as outlined in step 1105, the center of the polygon is calculated in step 1110 and used as an anchor point. In step 1115 the cell ID number best matching the polygon’ s center is identified. In step 1120 the maximum distance of all of the polygon’s vertices to its own center is calculated allowing for determination of necessary dimensions, i.e., the sunflower size parameter, of the sunflower seed arrangement pattern. Unlike encoding the example of a point or circle shown in FIG. 9, the vector geometry “Polygon” and subsequent geometries described herein are complex geometric shapes and thus are encoded using the sunflower seed arrangement pattern. In step 1125, the sunflower seed arrangement pattern is calculated and positioned with is origin exactly at the center of identified best matching cell 1002. In step 1130each polygon vertex is snapped to its nearest sunflower seed arrangement pattern point. In step 1135 the anchor point cell ID is binary encoded. In step 1140, all sunflower seed arrangement point indices to which a polygon vertex was snapped are binary encoded. In step 1145 the sunflower seed arrangement pattern size parameter is binary encoded.

[0095] An example code scheme is shown in FIG. 12, explaining how all information about a vector geometry “Polygon”, encoded as vector geometry type 2, could be first codified into a “joint binary code” and subsequently in a binary unified spatial code, also simply indicated as “binary spatial code” in the figures. The vector geometry type “Polygon” implies that four vertices are encoded following the anchor cell ID field in the unified spatial code. The is not intended to be limiting and other kind of polygon may be defined as vector geometries that imply additional fields to hold information for 6 or more vertices, for example. In a situation where a vector geometry provides more vector fields than points to be encoded for the polygon to be represented by the unified spatial code, some point is encoded multiple times. As displayed in the table all binary encoded information of vector geometry type, anchor cell ID, all of the polygon’s vertex IDs and sunflower seed arrangement pattern size parameter are concatenated to the joint binary code in an initial step. The sunflower size parameter is chosen according to the overall size of the vector geometry to be encode and determines the scale of the sunflower seed arrangement pattern and accordingly the precision with which the position of individual points of the vector geometry can be encoded as vertices. In a second step a CRC-6 error detection code is generated from the joint binary code. In the last step, the error detection code and the joint binary code are concatenated to the binary spatial code.

[0096] In the example shown in FIG. 13, the example map shown in FIG. 6 was used again and a polyline vector geometry 1301 connecting two buildings, e.g. as a route description from one building to the other, is provided. The resolution of the grid underlying the map in FIG. 13 is different from, i.e. coarser than, the resolution of the grid shown in FIG. 6. In other words, a different grid resolution was selected. In the example, the polyline’s center is best represented by cell #9 1302 and its center which is marked with a star 1303. A sunflower arrangement pattern was created with its origin exactly matching grid cell #9’s center, and some points of that sunflower seed arrangement pattern are marked with 1304.

[0097] FIG. 14 shows a flowchart outlining the process of generating binary data from a vector geometry of type “Polyline” to then be concatenated as described in step 120 above. Starting with provided vector geometry data in step 105 and if the vector geometry is of type “Polyline” as outlined in step 1405, the center of the polyline is calculated in step 1410 andused as an anchor point. In step 1415 the cell ID number best matching the polyline’s center is identified. In step 1420 the maximum distance of all of the polyline’s vertices to its own center is calculated allowing for determination of necessary dimensions of the sunflower seed arrangement pattern. In step 1425, the sunflower seed arrangement pattern is calculated and positioned with is origin exactly at the center of identified best matching cell 1302. In step 1430, each polyline vertex is snapped to its nearest sunflower seed arrangement pattern point. In step 1435, the anchor point cell ID is binary encoded. In step 1440, all sunflower seed arrangement point indices to which a polygon vertex was snapped are binary encoded. In step 1145 the sunflower seed arrangement pattern size parameter is binary encoded.

[0098] An example code scheme is shown in FIG. 15, explaining how all information about a vector geometry “Polyline” could be first codified into a joint binary code and subsequently in a binary unified spatial code. The vector geometry type “Polyline” implies that four vertices are encoded following the anchor cell ID field in the unified spatial code. The is not intended to be limiting and other kind of polylines may be defined as vector geometries that imply additional field to hold information for 6 or more vertices, for example. As displayed in the table all binary encoded information of vector geometry type, anchor cell ID, all of the polyline’s vertex IDs and sunflower seed arrangement pattern size parameter are concatenated to the joint binary code in an initial step. In a second step a CRC-6 error detection code is generated from the joint binary code. In the last step, the error detection code and the joint binary code are concatenated to the binary spatial code.

[0099] In the example shown in FIG. 16, an Origin-Destination vector geometry 1601, e.g., representing a flight path of a drone, is provided. In this example, the map and the grid resolution are the same as the one of FIG. 6. The point of origin of this vector geometry is best represented by cell #26 1602 and its center which is marked with a star 1603 and which represents the start point of the specific Origin-Destination geometry shown in the FIG. 16. The point of destination of this vector geometry is best represented by grid cell #30 1604 and its center which is marked with a star 1605, which also represents the end point of the Origin-Destination geometry.

[0100] FIG. 17 provides a flowchart outlining specifically the process of generating binary data from a vector geometry of type “Origin-Destination” to then be concatenated as described in step 120 above. Starting with provided vector geometry data in step 105 and if the vector geometry is of type “Origin-Destination” as outlined in step 1705, the cell ID number best matching the point of origin is identified in step 1710. In step 1715 the cell ID number bestmatching the point of destination is identified. In step 1720 the point of origin cell ID number is binary encoded. In step 1725 the point of destination cell ID number is binary encoded. In step 1730 the direction type parameter is binary encoded.

[0101] An example code scheme is shown inf FIG. 18, explaining how all information about a vector geometry “Origin-Destination” could be first codified into a joint binary code and subsequently in a binary unified spatial code. As displayed in the table all binary encoded information of vector geometry type, point of origin cell ID, point of destination cell ID and direction type parameter are concatenated to the joint binary code in an initial step. In a second step, a CRC-6 error detection code is generated from the joint binary code. In the last step, the error detection code and the joint binary code are concatenated to the binary spatial code.

[0102] In some implementations, the binary spatial code is translated to the unified spatial code utilizing a suitable non-binary charset. A suitable charset would, for example, be base32. Other charsets are possible.

[0103] In some implementations, the unified spatial codes generated using the abovedescribed methods may be alpha-numeric, case-insensitive, can, for example, be 16 base32 characters short and would overcome all shortcomings of currently existing encodings:• Precision: The method allows for precision of less than 1 meter.• 3 -dimensionality (3D): Floor level or elevation can be encoded.• Variable geometries: a unified spatial code is “unified” in the sense that it can represent points, polygons, polylines and more.• Compact code design: 16-digit code alpha-numeric code.• Location matching and proximity information: Even without use of a Geospatial Information System (GIS), any database can quickly sort lists of unified spatial codes, where proximity in the sorted list refers to relative proximity in real world. To facilitate such proximity estimation and comparison, the anchor point can be represented at the beginning of the binary sequence and the CRC can be appended at the end. The order of such example encoding can thus differ from what is shown in the example of FIG. 18.• Error-proof manual transmission: When faulty codes are entered into the system, they can be identified using the error detection code.• Location data quality: As a computer system must be used to generate unified spatial codes any address to be converted, e.g. postal address, latitude / longitude, UTM, or others, must be entered into a device and will be displayed on a digital map for further enrichment and potential correction, ensuring no unified spatial code is generated unchecked.• Encoding variability: Further vector geometries can be encoded using the principles of the methods described herein to satisfy the requirements of specific application domains. FIG.18 shows 4 bits for the encoding of the vector geometry type, which results in 16 different possible vector geometries. Some example vector geometries have been illustrated herein, such as Point, Polygon, Polyline and Origin-Destination. Other custom geometries are possible.

[0104] In an embodiment, a computer-implemented method for encoding spatial information into a compact machine-readable code definiens a geospatial anchor representing a reference location and encodes one or more parameterized geometric attributes relative to that anchor. These attributes describe spatial properties including at least one of a radial extent, a vertical extent, a directional component, or a scalar magnitude, all of which are encoded using a compact representation with a limited bit-length to generate a spatial reference code. The method further includes generating a spatial reference code comprising the encoded geospatial anchor and the encoded parameterized geometric attributes, wherein the spatial reference code represents a spatial geometry defined relative to the geospatial anchor.

[0105] In some embodiments, spatial geometries are represented using a parametric geometry encoding framework where each geometry is defined by its geospatial anchor and parameterized geometric attributes describing spatial extent, orientation, or motion relative to said anchor. For instance, a spatial geometry may comprise a spherical region defined by the anchor and a scalar parameter representing a radial extent.

[0106] In some embodiments, the spatial geometry is defined as a cylindrical volume. This volume is characterized by a geospatial anchor defining a base position, a radial extent defining a horizontal dimension, and a vertical extent defining a height relative to the base position. To further optimize the code, the radial and vertical extents may be jointly encoded using a combined parameter representation.

[0107] In some embodiments, a spatial geometry comprises a directed vector. This vector is defined by the geospatial anchor, a directional component encoded using quantized angular parameters, and a scalar magnitude parameter. The directional component of the vector may be defined relative to a local coordinate system associated with the geospatial anchor. Furthermore, the scalar magnitude parameter is interpreted based on a mode indicator, allowing the magnitude to represent at least one of a distance, a displacement, a range, or a speed.

[0108] In some embodiments, scalar parameters within the USC are encoded using a non-linear, multi-scale encoding scheme. This scheme allocates higher precision to lower value ranges and lower precision to higher value ranges, ensuring accuracy where it is most needed.Additionally, vertical positioning may be encoded using a surface-relative vertical encoding scheme where values are represented relative to a reference surface and correspond to at least one of metric height, discrete building levels (floors), or aviation altitude levels.

[0109] In some embodiments, the framework allows for geometric flexibility where lower-dimensional geometries are represented as degenerate cases of higher-dimensional parameterized geometries. For example, a circular area may be represented as a cylindrical geometry having zero vertical extent.

[0110] In some embodiments, a fixed-length spatial reference code is used which allocates bits between anchor precision and geometric parameter precision. This allocation is configurable, such that different geometry types utilize different bit distributions to optimize encoding efficiency for specific use cases. Finally, multiple spatial geometries may be combined or sequenced to represent movement or complex trajectories.[oni] The unified spatial code (USC) presented herein provides a comprehensive and cohesive encoding framework that integrates multiple technical functions. While many conventional geospatial encoding schemes focus on solving isolated problems — such as compressed latitude / longitude representation, polyline encoding, 3D point handling, or improved human readability, the USC offers a unified solution that addresses all of these challenges concurrently.

[0112] In some implementations, a vector geometry is obtained by decoding a unified spatial code using the following steps: receiving the unified spatial code as a sequence of characters; decoding the sequence of characters to a binary sequence, which is a binary spatial code, using a predefined charset, the predefined charset comprising more than two characters; splitting the binary spatial code into a joint binary code and a binary error detection code; computing a binary check code based on the joint binary code and verifying a validity of the joint binary code by comparing the binary check code with the binary error detection code; splitting the joint binary code into binary encoding of an anchor cell identifier, vector geometry binary data and a binary code of a vector geometry type; binary decoding the vector geometry type; binary decoding the anchor cell identifier; binary decoding the vector geometry binary data to obtain positions, shape and size of the vector geometry relative to an anchor point; calculating one or more geospatial coordinates in a given coordinate system to obtain the vector geometry based on the positions and the shape of the vector geometry relative to the anchor point.

[0113] In some implementations, the binary check code is computed according to the CRC-6 or other predefined algorithm used when the unified spatial code was generated. If comparing the binary check code with the binary error detection code determines that the binary check code and the binary error detection code are not the same, the unified spatial code is determined as invalid and the decoding method stops with no result; if an error correction code is used and the error is determined as a correctable bit error, the unified spatial code is corrected and the decoding method continues with subsequent steps. If the comparison succeeds, further steps of the decoding method follow as described above.

[0114] In some implementations, in addition to verifying the validity of the joint binary code, the method can optionally also include a step of correcting the joint binary code if the binary error detection code is suitable not only to determine the presence of an error but also capable to reconstruct joint binary code, e.g. for the case of 1 -bit error. The capability to correct errors in the joint binary code of one or more bits typically depends on the length, i.e., a number of bits, of the error detection code, which would in such case be called “error correction code”. Commonly known codes for binary error detection and corrections can be used.

[0115] In some embodiments, the unified spatial code system further supports context-assisted reconstruction modes as illustrated in FIGS. 19-21, in which a spatial reference is intentionally truncated to reduce transmission size while remaining reconstructable using contextual geographic information.

[0116] FIG. 19 illustrates an example process for generating a truncated spatial reference from a canonical hierarchical spatial identifier. In step 1905, a canonical hierarchical spatial identifier is received. In step 1910, higher-order hierarchy information is removed while lower-order hierarchy information preserving local spatial structure is retained. In step 1915, the resulting truncated spatial reference is transmitted or stored for subsequent contextual reconstruction.

[0117] In such embodiments, a hierarchical spatial identifier is processed such that a first subset of hierarchy information is removed while a second subset of hierarchy information is retained, as illustrated in FIG. 19. Preferably, higher-order hierarchy information is removed while lower-order hierarchy information preserving local spatial structure is retained. The inventors recognized that retaining lower-order hierarchy information while removing higher-order hierarchy information creates sparse candidate distributions over large geographic areas, enabling efficient contextual reconstruction of omitted hierarchy information, as further illustrated in FIGs. 20 and 21.

[0118] In contrast, retaining higher-order hierarchy information while removing lower-order hierarchy information creates locally dense candidate distributions that significantly reduce contextual reconstruction efficiency.

[0119] Reconstruction of the truncated spatial reference may comprise, as illustrated in FIGS. 20 and 21, the following steps:• generating candidate hierarchy identifiers,• applying hierarchy validity constraints,• applying optional redundancy filtering,• applying contextual geographic filtering,• ranking remaining candidates,• and selecting one or more reconstructed spatial references.

[0120] FIG. 20 illustrates an example candidate reconstruction process. In step 2005, retained hierarchy information or a truncated spatial reference is received. In step 2010, candidate hierarchy identifiers are generated based on the retained hierarchy information. In step 2015, hierarchy validity filtering is applied to eliminate structurally invalid candidate hierarchy identifiers.

[0121] The contextual geographic filtering as illustrated in FIG. 21 may utilize one or more of:• approximate GNSS position,• cellular network information,• emergency location services information,• satellite communication beam information,• tactical operation region information,• rescue region information,• map viewport information,• dead-reckoning estimates,• last-known-position information,• operator-selected regions, or• combinations thereof.

[0122] In some embodiments, the reconstruction process provides context-bounded uniqueness as enabled by the reconstruction and filtering processes illustrated in FIGs. 20 and 21 rather than deterministic global uniqueness, such that a truncated spatial reference mayremain globally ambiguous while being practically unique within a contextual geographic region.

[0123] In some embodiments, the truncated spatial reference further comprises redundancy information configured to reduce candidate ambiguity during reconstruction as illustrated in FIG. 21. The redundancy information may comprise parity bits, CRC-derived bits, hash-derived bits, folded XOR bits, or deterministic redundancy functions. In some embodiments, the redundancy information primarily supports candidate-space reduction during reconstruction rather than deterministic integrity validation.

[0124] FIG. 21 illustrates an example contextual reconstruction and candidate reduction process. In step 2105, redundancy filtering is applied to reduce candidate ambiguity. In step 2110, contextual geographic filtering is applied using contextual geographic information. In step 2115, one or more reconstructed canonical spatial identifiers are obtained.

[0125] In some embodiments, the truncated spatial references are configured for: • degraded-network communication,• verbal coordinate exchange,• radio communication,• low-bandwidth transmission,• disconnected operation,• delay-tolerant messaging,• emergency communication, and• offline geospatial synchronization.

[0126] In some embodiments, the truncated spatial references are transport-layer abstractions distinct from canonical deterministic unified spatial codes as illustrated in FIGS.19-21, wherein the truncated spatial references are reconstructed into canonical unified spatial codes before subsequent spatial processing. In some embodiments, the reconstruction principles disclosed herein are applicable to:• point geometries,• vector geometries,• polygons,• routes,• trajectories,• volumetric geometries,• and airspace geometries.

[0127] The unified spatial code described herein is designed for efficient binary encoding and decoding of geospatial coordinates and vector geometries, with practical applications in a wide range of real-world systems. It provides specific technical advantages in scenarios constrained by limited bandwidth, restricted storage, low energy availability, and minimal computational capacity. These characteristics make the unified spatial code particularly well-suited for a variety of practical applications, some of which are described in the following examples:• In satellite-based systems, such as wildlife trackers and emergency beacons, communication is intermittent and expensive, so that compact and robust encoding of geolocation data is a requirement.• Networks like Low-Power Wide-Area Networks (LPWAN) including LoRaWAN, Sigfox, and NB-IoT, are commonly used in smart agriculture, smart cities, and environmental monitoring. Such networks are often constrained to payloads as small as 12-50 bytes per transmission.• Fleet tracking and vehicle telematics, where data such as vehicle position, route, or motion vectors must be transmitted periodically with minimal bandwidth usage to reduce cellular costs and energy consumption. Geospatial databases that store movement data, e.g., fleet tracking or logistics applications, can use the error detection and / or correction code embedded in geospatial information encoded as unified spatial code as described to verify the integrity of individual position records, ensuring reliability even during read / write operations;• loT sensor networks are deployed in remote or signal-degraded environments, e.g., forests, offshore platforms, underground systems, where consistent data transmission cannot be guaranteed, and compact, self-contained codes, like the unified spatial code, improve data and storage and transmission resilience.• In offline GPS logging applications, such as wearable tracking devices, asset loggers, or drones, storage of high-resolution movement paths must be achieved with minimal memory usage so that it is beneficial to use the unified spatial code.• In spatial Extract, Transform, Load, (ETL) workflows, the error detection and / or correction code embedded in geospatial information encoded as unified spatial code as described herein, allows systems to detect changes or anomalies between datasets without needingfull geometric comparisons, e.g., polygon equality checks, increasing processing speed and reducing compute load.

[0128] In some embodiments, unified spatial codes are utilized for emergency response, rescue coordination, and disaster-management systems operating under degraded communication conditions. Unified spatial codes may be transmitted verbally, via radio communication, via low-bandwidth messaging systems, or through delay-tolerant communication networks. Example applications include wilderness rescue operations, avalanche rescue coordination, maritime distress localization, underground rescue operations, confined-space rescue, emergency helicopter landing references, disaster-zone localization, and search-area perimeter exchange. Compact spatial encoding may further support communication scenarios involving partial message loss, delayed synchronization, intermittent connectivity, or high-noise communication environments.

[0129] In some embodiments, unified spatial codes are utilized for human-transmittable geospatial communication. Unified spatial codes may be optimized for verbal transmission, manual transcription, radio communication, SMS exchange, or emergency shorthand encoding. Such embodiments may reduce cognitive load during coordinate exchange and improve reliability of human-to-human geospatial communication under stress conditions. In some implementations, shortened or partially reconstructed unified spatial codes may be confirmed verbally between operators prior to full reconstruction.

[0130] In some embodiments, unified spatial codes are utilized in tactical, military, or contested-environment operations. Unified spatial codes may support low-signature geospatial communication, disconnected operations, GPS-denied navigation, tactical route exchange, convoy coordination, temporary operational zones, and battlefield geospatial synchronization. Compact encoded geometries may reduce transmission size and transmission duration while enabling resilient operation under constrained communication conditions or contested electromagnetic environments.

[0131] In some embodiments, unified spatial codes are utilized for aviation, unmanned aerial systems, and airspace coordination. Parameterized spatial geometries represented by unified spatial codes may define aircraft tracks, temporary flight restrictions, airspace exclusion regions, glide paths, UAV operational corridors, airborne search patterns, or air-defense engagement regions. Compact encoded movement abstractions may support low-bandwidth telemetry exchange, airspace deconfliction, disconnected airborne operations, and compact airspace synchronization between aircraft, drones, control systems, or edge devices.

[0132] In some embodiments, unified spatial codes are utilized in robotics, autonomous systems, and machine-to-machine coordination environments. Unified spatial codes may encode robot operating envelopes, autonomous vehicle routes, swarm separation regions, collaborative mapping data, machine-vision anchor references, warehouse robot navigation paths, autonomous search trajectories, or distributed sensor geometries. Compact binary spatial encoding may enable low-latency synchronization between edge devices, autonomous platforms, robotic control systems, or distributed sensor systems.

[0133] In some embodiments, unified spatial codes are utilized for warehousing, fulfillment, inventory-management, logistics coordination, and transportation systems. Unified spatial codes may represent rack-level storage positions, warehouse shelf references, pallet locations, storage-bin identifiers, fulfillment picking references, loading positions, cargo staging regions, delivery handoff locations, material-flow destinations, or final consumptionpoint references. In some implementations, such spatial references may be associated with positioning information obtained from indoor positioning systems, real-time location systems (RTLS), ultra-wideband systems (UWB), RFID systems, machine-vision systems, warehouse automation systems, or combinations thereof. Compact spatial encoding may support efficient synchronization of inventory and logistics state information across handheld devices, warehouse automation systems, autonomous systems, edge devices, or constrained communication networks.

[0134] In some embodiments, unified spatial codes are utilized for compact localization of physical objects within multi-level storage environments, industrial facilities, transportation systems, or distributed logistics networks. Unified spatial codes may encode spatial references associated with individual stored objects, containers, pallets, equipment, consumables, replacement parts, tools, or transported goods. Such embodiments may support compact machine-readable location exchange and resilient operational coordination across large-scale logistics and industrial systems.

[0135] In some embodiments, unified spatial codes are utilized for industrial infrastructure, energy systems, utility networks, construction environments, and facility management. Unified spatial codes may represent industrial process units, utility corridors, pipeline segments, crane operating regions, hazardous exclusion zones, construction staging regions, industrial maintenance references, substations, underground infrastructure, offshore facilities, or confined operational volumes. Compact spatial encoding may support infrastructure indexing, operational safety coordination, and resilient field communication.

[0136] In some embodiments, unified spatial codes are utilized for digital twin systems, infrastructure abstraction, and compact facility synchronization. Unified spatial codes may encode simplified building geometries, volumetric abstractions, infrastructure layouts, semantic facility references, structural surfaces, or compact topology representations. Such embodiments may enable lightweight synchronization of digital twin information between edge devices, mobile devices, cloud systems, or disconnected systems while reducing computational overhead, storage requirements, and transmission bandwidth.

[0137] In some embodiments, unified spatial codes are utilized in geospatial synchronization systems and delay-tolerant networking environments. Unified spatial codes may be exchanged using store-and-forward communication systems, opportunistic mesh networking, edge-to-edge synchronization, or infrastructure-independent communication systems. Such embodiments may support resilient geospatial synchronization in disconnected, partitioned, intermittent, degraded, or disaster-affected communication environments.

[0138] In some embodiments, unified spatial codes are utilized for environmental monitoring, wildlife tracking, and sensor-network coordination. Unified spatial codes may represent wildlife movement trajectories, environmental hazard regions, flood extents, wildfire perimeters, atmospheric measurement regions, sensor coverage zones, or distributed monitoring infrastructure. Compact geometry encoding may enable large-scale spatial synchronization across constrained sensor networks or low-power communication systems.

[0139] In some embodiments, the unified spatial code system supports context-assisted reconstruction of truncated unified spatial codes. A unified spatial code may intentionally omit portions of hierarchy information while retaining lower-order spatial structure information configured for subsequent reconstruction using contextual geographic information. Reconstruction inputs may include approximate GNSS information, emergency location services information, cellular-network information, tactical region information, map viewport information, dead-reckoning information, last-known-position information, operator-selected geographic constraints, or combinations thereof. Context-assisted reconstruction may enable shortened spatial representations while preserving context-bounded recoverability within an operational region.

[0140] In some embodiments, context-assisted reconstruction is utilized for degraded-network communication, emergency messaging, verbal coordinate exchange, radio communication, delay-tolerant synchronization, or low-bandwidth telemetry transmission. Shortened unified spatial codes may reduce transmission size, spoken transmission duration,cognitive load, transcription complexity, or communication-channel utilization while maintaining practical operational usability. Such embodiments may support communication environments involving intermittent connectivity, communication disruption, partial message loss, high-noise communication channels, infrastructure degradation, or contested electromagnetic environments.

[0141] In some embodiments, probabilistic candidate filtering is utilized during reconstruction of truncated unified spatial codes. Candidate hierarchy identifiers may be generated and filtered using hierarchy validity constraints, redundancy filtering, contextual geographic filtering, regional constraints, probabilistic ranking, operational metadata, or combinations thereof. Reconstruction processes may iteratively reduce candidate ambiguity using progressively available contextual information while maintaining reduced transmission size relative to globally deterministic spatial references.

[0142] In some embodiments, unified spatial codes are utilized for compact machine-readable geospatial abstraction across heterogeneous systems. A unified spatial code may represent points, vectors, routes, polygons, trajectories, volumetric geometries, airspace geometries, infrastructure abstractions, or combinations thereof within a common encoding framework. Such embodiments may improve interoperability between geospatial systems, autonomous systems, logistics systems, industrial systems, mapping systems, communication systems, or edge-computing systems while reducing storage complexity and transmission overhead.

[0143] FIG. 22 illustrates a schematic view of an example computing device 2200 that can be utilized to implement the systems and methods described herein. The computing device 2200 represents various types of digital computers, including laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other suitable computers. The components, their connections, relationships, and functions shown here are intended to be exemplary and not restrictive of the implementations of the inventions described and / or claimed in this document.

[0144] The computing device 2200 comprises a processor 2210, memory 2220, a storage device 2230, a high-speed interface / controller 2240 connected to the memory 2220 and high-speed expansion ports 2250, and a low-speed interface / controller 2260 connected to a low-speed bus 2270 and the storage device 1930. The components 2210, 2220, 2230, 2240, 2250, and 2260 are interconnected using various buses and may be mounted on a common motherboard or in other suitable manners. The processor 2210 processes instructions forexecution within the computing device 2200, including instructions stored in the memory 2220 or on the storage device 2230 to display graphical information for a graphical user interface (GUI) on an external input / output device, such as display 2280 coupled to the high-speed interface / controller 2240. In other implementations, multiple processors and / or multiple buses may be used, along with multiple memories and types of memory. Additionally, multiple computing devices 2200 may be connected, with each device providing portions of the necessary operations (e.g., as a server bank, a group of blade servers, or a multi-processor system).

[0145] The memory 2220 stores information non-transitorily within the computing device 2200. The memory 2220 may be a computer-readable medium, a volatile memory unit(s), or non-volatile memory unit(s). The non-transitory memory 2220 may be physical devices used to store programs (e.g., sequences of instructions) or data (e.g., program state information) on a temporary or permanent basis for use by the computing device 2200. Examples of non-volatile memory include flash memory and read-only memory (ROM) / programmable read-only memory (PROM) / erasable programmable read-only memory (EPROM) / electronically erasable programmable read-only memory (EEPROM) (e.g., typically used for firmware, such as boot programs). Examples of volatile memory include random access memory (RAM), dynamic random-access memory (DRAM), static randomaccess memory (SRAM), phase change memory (PCM) as well as disks or tapes.

[0146] The storage device 2230 provides mass storage for the computing device 2200. In some implementations, the storage device 2230 is a computer-readable medium. The storage device 2230 may be a floppy disk device, a hard disk device, an optical disk device, a tape device, a flash memory or other similar solid-state memory device, or an array of devices, including devices in a storage area network or other configurations. In additional implementations, a computer program product is tangibly embodied in an information carrier. The computer program product contains instructions that, when executed, perform one or more methods, such as those described above. The information carrier is a computer- or machine-readable medium, such as the memory 2220, the storage device 2230, or memory on processor 2210.

[0147] The high-speed controller 2240 manages bandwidth-intensive operations for the computing device 2200, while the low-speed controller 2260 manages lower bandwidthintensive operations. This allocation of duties is exemplary only. In some implementations, the high-speed controller 2240 is coupled to the memory 2220, the display 2280 (e.g., through agraphics processor or accelerator), and to the high-speed expansion ports 2250, which may accept various expansion cards (not shown). In some implementations, the low-speed controller 2260 is coupled to the storage device 2230 and a low-speed expansion port 2290. The low-speed expansion port 2290, which may include various communication ports (e.g., USB, Bluetooth, Ethernet, wireless Ethernet), may be coupled to one or more input / output devices, such as a keyboard, a pointing device, a scanner, or a networking device such as a switch or router, e.g., through a network adapter.

[0148] The computing device 2200 may be implemented in various forms, e.g., as a standard server or multiple times in a group of such servers, as a laptop computer, or as part of a rack server system.

[0149] Various implementations of the systems and techniques described herein can be realized in digital electronic and / or optical circuitry, integrated circuitry, specially designed ASICs (application-specific integrated circuits), computer hardware, firmware, software, and / or combinations thereof. These implementations can include one or more computer programs that are executable and / or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.

[0150] These computer programs (also known as programs, software, software applications, or code) include machine instructions for a programmable processor and can be implemented in a high-level procedural and / or object-oriented programming language, and / or in assembly / machine language. The terms “machine-readable medium” and “computer-readable medium” refer to any computer program product, non-transitory computer-readable medium, apparatus, and / or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and / or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term “machine-readable signal” refers to any signal used to provide machine instructions and / or data to a programmable processor.

[0151] The processes and logic flows described in this specification can be performed by one or more programmable processors, also referred to as data processing hardware, executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by special-purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specificintegrated circuit). Processors suitable for executing a computer program include both general and special-purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random-access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, one or more mass storage devices for storing data, e.g., magnetic, magnetooptical disks, or optical disks. However, a computer need not have such devices. Computer-readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media, and memory devices, including semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special-purpose logic circuitry.

[0152] To provide for interaction with a user, one or more aspects of the disclosure can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube), LCD (liquid crystal display) monitor, or touch screen for displaying information to the user and optionally a keyboard and a pointing device, e.g., a mouse or a trackball, by which the user can provide input to the computer. Other kinds of devices can be used to provide interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, or tactile input. Additionally, a computer can interact with a user by sending documents to and receiving documents from a device used by the user; for example, by sending web pages to a web browser on a user's client device in response to requests received from the web browser.

[0153] In this specification, the phrase “configured to” is used in different contexts related to computer systems, hardware, or part of a computer program. When a system is said to be configured to perform one or more operations, this means that the system has appropriate software, firmware, and / or hardware installed on the system that, when in operation, causes the system to perform the one or more operations. When some hardware is said to be configured to perform one or more operations, this means that the hardware includes one or more circuits that, when in operation, receive input and generate output according to the input and corresponding to the one or more operations. When a computer program is said to be configuredto perform one or more operations, this means that the computer program includes one or more program instructions, that when executed by one or more computers, causes the one or more computers to perform the one or more operations.

[0154] Unless otherwise stated, the foregoing alternative examples are not mutually exclusive, but may be implemented in various combinations to achieve unique advantages. In the foregoing description, the provision of the examples described, as well as clauses phrased as "such as," "including" and the like, should not be interpreted as limiting embodiments to the specific examples; rather, the examples are intended to illustrate only one of many possible embodiments.

[0155] In an embodiment, the allocation of bits between anchor precision and parameter precision is configurable, allowing trade-offs between positional accuracy and geometric detail within a fixed-length encoded spatial reference. Different geometry types may use different allocations to optimize encoding efficiency for their intended use cases.

Claims

CLAIMS1. A computer-implemented method of encoding a vector geometry as a unified spatial code for spatial data processing, the method comprising:receiving information corresponding to one or more cells (605) within a geospatial area (600), each cell being associated with a cell identifier (606), wherein the one or more cells define spatial boundaries for encoding vector geometry data;receiving (105) data corresponding to a vector geometry located within the one or more cells, wherein the vector geometry comprises an anchor point, and wherein the anchor point defines a reference location for the vector geometry within the geospatial area;binary encoding (110) the vector geometry by:determining an anchor cell identifier (606) of the one or more cells within which the anchor point is located;binary encoding the anchor cell identifier (606); andbinary encoding positions, a shape and a size of the vector geometry relative to the anchor point to obtain vector geometry binary data;binary encoding (115) a vector geometry type to obtain a binary code of the vector geometry type;concatenating (120) the binary encoding of the anchor cell identifier, the vector geometry binary data and the binary code of the vector geometry type to obtain a joint binary code;computing (125) a binary error detection code based on the joint binary code; concatenating (130) the joint binary code and the binary error detection code to obtain a binary spatial code; andmapping (135) the binary spatial code into a sequence of characters using a charset comprising more than two characters to obtain the unified spatial code, wherein the unified spatial code is usable for subsequent spatial processing.

2. The computer-implemented method of claim 1, wherein the anchor point is specified using a latitude and longitude coordinate of a geospatial location represented by the anchor point.

3. The computer-implemented method of claim 2, wherein the vector geometry further comprises a height information of the anchor point.

4. The computer-implemented method of claim 2 or 3, wherein vector geometry further comprises information specifying a shape type parameter defining a geometric primitive located at the anchor point and a characteristic length of the geometric primitive, wherein, optionally, a shape type is a circle or sphere and the characteristic length is a radius of the circle or the sphere.

5. The computer-implemented method of one of claims 1 to 3, further comprising:calculating a spatial point distribution pattern to obtain a defined sequence of calculated reference points,wherein:the vector geometry defines one or more vertices,the calculated reference points are projected onto the geospatial area, a nearest calculated reference point to each vertex is identified, and identifiers associated with the nearest calculated reference points are binary encoded according to a logical order of the plurality of vertices.

6. The computer-implemented method of claim 5, further comprising:calculating a circular sunflower seed arrangement pattern to obtain a defined sequence of calculated points that form the circular sunflower seed arrangement pattern,wherein:the vector geometry defines one or more vertices;the calculated points are numbered in ascending order and projected onto the geospatial area where a radius of the circular sunflower seed arrangement pattern is equal to or larger than a largest distance of all vertices of the vector geometry from a center of the vector geometry; and a nearest sunflower seed point to each vertex is identified and each respective number is binary encoded while following a logical order of the plurality of vertices.

7. The computer-implemented method of claim 5, wherein the spatial point distribution pattern comprises:a sunflower seed arrangement pattern,a rectangular point grid,an orthogonal point distribution,a triangular point distribution,a hexagonal point distribution,a quasi-uniform point distribution,a hierarchical point distribution, ora multi-resolution point distribution.

8. The computer-implemented method of claim 6, wherein the circular sunflower seed arrangement with the defined sequence of points is calculated usingu = n ■ (1 + 5) ■ iwhere u represents a proportional distribution along an azimuthal direction of the surface of a sphere, i is an index of a respective point in the sequence of points and / i \v = arccos 1 — 2 ■ — — —V N / psJwhere v represents a proportional distribution of the point in the sequence of points along a polar direction of a spherical surface, i is the index of the point in the sequence of points, N is the total number of points to be distributed on a surface of the sphere and psis a surface ratio, representing a fraction of a selected section of the sphere that is covered by the sequence of points and a total surface area of the sphere.

9. The computer-implemented method of claim 8,wherein the circular sunflower seed arrangement is used to describe the plurality of the vertices of the vector geometry.

10. The computer-implemented method of claim 5 or 6,wherein the vector geometry is a polygon defined by a plurality of vertices representing an area of interest, andwherein the anchor point equals a best fit of a center of the polygon.

11. The computer-implemented method of claim 5 or 6,wherein the vector geometry is a polyline defined by a plurality of vertices representing a route of interest, andwherein the anchor point equals a best fit of a center of the polyline.

12. The computer-implemented method of claim 5 or 6,wherein the vector geometry is a point of origin and a point of destination of interest, wherein the anchor point equals one of the point of origin or the point of destination, andwherein a cell identifier for the point of origin and a cell identifier for the point of destination are determined.

13. The computer-implemented method of claim 11 or 12, wherein the vector geometry further comprises directional information, and wherein the directional information comprises one of direct or reverse directional information.

14. The computer-implemented method of claim 13, wherein the directional information is binary encoded.

15. A computer-implemented method of decoding a vector geometry from a unified spatial code, comprising:receiving the unified spatial code as a sequence of characters;decoding the sequence of characters to a binary sequence, which is a binary spatial code, using a predefined charset, the predefined charset comprising more than two characters;splitting the binary spatial code into a joint binary code and a binary error detection code;computing a binary check code based on the joint binary code and verifying a validity of the joint binary code by comparing the binary check code with the binary error detection code;splitting the joint binary code into binary encoding of an anchor cell identifier, vector geometry binary data, and a binary code of a vector geometry type;binary decoding the vector geometry type;binary decoding the anchor cell identifier;binary decoding the vector geometry binary data to obtain positions, shape and size of the vector geometry relative to an anchor point; andcalculating one or more geospatial coordinates in a given coordinate system to obtain the vector geometry based on the positions and the shape of the vector geometry relative to the anchor point.

16. A computing device for encoding a vector geometry as a unified spatial code for spatial data processing, the computing device comprising:one or more processors; andmemory coupled to the one or more processors storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:receiving information corresponding to one or more cells within a geospatial area, each cell being associated with a cell identifier, wherein the one or more cells define spatial boundaries for encoding vector geometry data;receiving data corresponding to a vector geometry located within the one or more cells, wherein the vector geometry comprises an anchor point, and wherein the anchor point defines a reference location for the vector geometry within the geospatial area;binary encoding the vector geometry by:determining an anchor cell identifier of the one or more cells within which the anchor point is located,binary encoding the anchor cell identifier, andbinary encoding positions and a shape of the vector geometry relative to the anchor point to obtain vector geometry binary data;binary encoding a vector geometry type to obtain a binary code of the vector geometry type;concatenating the binary encoding of the anchor cell identifier, the vector geometry binary data, and the binary code of the vector geometry type to obtain a joint binary code;computing a binary error detection code based on the joint binary code; concatenating the joint binary code and the binary error detection code to obtain a binary spatial code; andmapping the binary spatial code into a sequence of characters using a charset comprising more than two characters to obtain the unified spatial code, wherein the unified spatial code is usable for subsequent spatial data processing.

17. The computing device of claim 16, wherein the anchor point is specified using a latitude and longitude coordinate of a geospatial location represented by the anchor point.

18. The computing device of claim 17, wherein the vector geometry further comprises a height information of the anchor point.

19. The computing device of claim 17 or 18, wherein vector geometry further comprises information specifying a shape type parameter defining a geometric primitive located at the anchor point and a characteristic length of the geometric primitive, wherein, optionally, a shape type is a circle or sphere and the characteristic length is a radius of the circle or the sphere.

20. A non-transitory computer-readable medium for encoding a vector geometry as a unified spatial code for spatial data processing, with instructions stored thereon that, when executed by a processor, cause the processor to perform operations comprising:receiving information corresponding to one or more cells within a geospatial area, each cell being associated with a cell identifier, wherein the one or more cells define spatial boundaries for encoding vector geometry data;receiving data corresponding to a vector geometry located within the one or more cells, wherein the vector geometry comprises an anchor point, and wherein the anchor point defines a reference location for the vector geometry within the geospatial area;binary encoding the vector geometry by:determining an anchor cell identifier of the one or more cells within which the anchor point is located,binary encoding the anchor cell identifier, andbinary encoding positions and a shape of the vector geometry relative to the anchor point to obtain vector geometry binary data;binary encoding a vector geometry type to obtain a binary code of the vector geometry type;concatenating the binary encoding of the anchor cell identifier, the vector geometry binary data, and the binary code of the vector geometry type to obtain a joint binary code; computing a binary error detection code based on the joint binary code; concatenating the joint binary code and the binary error detection code to obtain a binary spatial code; andmapping the binary spatial code into a sequence of characters using a charset comprising more than two characters to obtain the unified spatial code, wherein the unified spatial code is usable for subsequent spatial data processing.

21. The non-transitory computer-readable medium of claim 20, wherein the instructions cause the processor to perform further operations comprising:calculating a spatial point distribution pattern to obtain a defined sequence of calculated reference points, wherein:the vector geometry defines one or more vertices,the calculated reference points are projected onto the geospatial area, a nearest calculated reference point to each vertex is identified, and identifiers associated with the nearest calculated reference points are binary encoded according to a logical order of the plurality of vertices; andwherein the spatial point distribution pattern comprises one or more of:a sunflower seed arrangement pattern,a rectangular point grid,an orthogonal point distribution,a triangular point distribution,a hexagonal point distribution,a quasi-uniform point distribution,a hierarchical point distribution,or a multi -re solution point distribution.

22. The non-transitory computer-readable medium of claim 21, wherein the deterministic spatial point distribution pattern comprises a circular sunflower seed arrangement, and wherein the circular sunflower seed arrangement is used to describe the plurality of the vertices of the vector geometry.

23. A computer-implemented method for encoding spatial information into a compact machine-readable code, the method comprising:defining a geospatial anchor representing a reference location;encoding one or more parameterized geometric attributes relative to the geospatial anchor, the attributes describing spatial properties including at least one of:a radial extent,a vertical extent,a directional component, ora scalar magnitude;wherein the parameterized geometric attributes are encoded using a compact representation with limited bit-length; andgenerating a spatial reference code comprising the encoded geospatial anchor and the encoded parameterized geometric attributes, wherein the spatial reference code represents a spatial geometry defined relative to the geospatial anchor.

24. The computer-implemented method of claim 23, wherein spatial geometries are represented using a parametric geometry encoding framework, wherein each geometry is defined by the geospatial anchor and one or more parameterized geometric attributes describing spatial extent, orientation, or motion relative to the geospatial anchor.

25. The computer-implemented method of claim 23 or 24, wherein the spatial geometry comprises a spherical region defined by the geospatial anchor and a scalar parameter representing a radial extent from said geospatial anchor.

26. The computer-implemented method of claim 23 or 24, wherein the spatial geometry comprises a cylindrical volume defined by:the geospatial anchor defining a base position,the radial extent defining a horizontal dimension, andthe vertical extent defining a height relative to said base position.

27. The computer-implemented method of claim 26, wherein the radial extent and the vertical extent are jointly encoded using a combined parameter representation.

28. The computer-implemented method of claim 23 or 24, wherein the spatial geometry comprises a directed vector defined by:the geospatial anchor,the directional component encoded using quantized angular parameters, and a scalar magnitude parameter defining an extent of the directed vector.

29. The computer-implemented method of claim 28, wherein the scalar magnitude parameter is interpreted based on a mode indicator, such that the scalar magnitude parameter represents at least one of:a distance,a displacement,a range, ora speed.

30. The computer-implemented method of one of claims 23 to 28, wherein scalar parameters are encoded using a non-linear, multi-scale encoding scheme that allocates higher precision to lower value ranges and lower precision to higher value ranges.

31. The computer-implemented method of one of claims 23 to 28, wherein vertical positioning is encoded using a surface-relative vertical encoding scheme, wherein vertical values are represented relative to a reference surface and may correspond to at least one of:metric height,discrete building levels, oraviation altitude levels.

32. The computer-implemented method of one of claims 23 to 31, wherein lowerdimensional geometries are represented as degenerate cases of higher-dimensional parameterized geometries, including representing a circular area as a cylindrical geometry having zero vertical extent.

33. The computer-implemented method of one of claims 23 to 32, wherein a fixed-length spatial reference code allocates bits between anchor precision and geometric parameterprecision, such that different geometry types utilize different allocations to optimize encoding efficiency.

34. The computer-implemented method of one of claims 23 to 33, wherein the directional component of a vector is defined relative to a local coordinate system associated with the geospatial anchor.

35. The computer-implemented method of one of claims 23 to 34, wherein multiple spatial geometries are combined or sequenced to represent movement or trajectories.

36. A computer-implemented method for generating a context-assisted reconstruction spatial reference, the method comprising:receiving a hierarchical spatial identifier associated with a geospatial location; removing a first subset of hierarchy information from the hierarchical spatial identifier while retaining a second subset of hierarchy information preserving local spatial structure;generating a truncated spatial reference comprising the retained hierarchy information; andtransmitting or storing the truncated spatial reference for subsequent context- assisted reconstruction.

37. The computer-implemented method of claim 36, wherein the removed hierarchy information comprises higher-order hierarchy information and the retained hierarchy information comprises lower-order hierarchy information.

38. The computer-implemented method of claim 36 or 37, wherein reconstructing the hierarchical spatial identifier comprises:generating candidate hierarchy identifiers,applying hierarchy validity constraints,applying contextual geographic filtering, andselecting one or more reconstructed candidates.

39. The computer-implemented method of claim 38, wherein the contextual geographic filtering utilizes one or more of:approximate GNSS information,cellular network information,emergency location services information,satellite beam information,map viewport information,tactical operation region information,dead-reckoning information,or last-known-position information.

40. The computer-implemented method of claim 36, wherein the truncated spatial reference is globally ambiguous but locally reconstructable within a context region.

41. The computer-implemented method of claim 38, wherein candidate ambiguity is reduced probabilistically during contextual reconstruction using contextual filtering and redundancy information, wherein the redundancy information comprises one or more of:parity bits,CRC-derived bits,hash-derived bits,folded XOR bits, ordeterministic redundancy functions.