Back to results
US 2006/0215923 A1Published application
Lossless compression algorithms for spatial data
AssigneeMicrosoft Corporation
InventorBryan Beatty
Life of this patent
Estimating the term…
Loading patent…
Loading patent…
AssigneeMicrosoft Corporation
InventorBryan Beatty
Estimating the term…
The present invention is related to routines for the processing of quantized vector data into one or more arrays of integers whose values are closer to zero than the integers in the quantized vector data. The arrays are input to a compression engine resulting in compressed bytes of data that may be transferred to a computing device for the decompression of the data. The quantized vector data can include vertices expressed as a pair of integer values that may represent geometric, spatial elements, such as points, interconnected lines (polylines), and polygons. These geometric objects may be representative of information on a map. The compressed bytes may be grouped according to grids, wherein each grid represents a distinct geographic area of a map, so that a consumer can store and decompress only the portion of the map data which is of interest.
A method for compressing quantized vector data into compressed bytes, comprising:
A method for decompressing compressed bytes into quantized vector data, comprising:
A computer readable medium having computer executable instructions that, when executed in a computing device having a compression engine, carry out a method for decompressing compressed bytes into quantized vector data, the method comprising:
Dependencies are inferred from the claim text.