Lossless compression algorithms for spatial data
US7668386B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Mar 25, 2005 |
| Grant date | Feb 23, 2010 |
| Priority date | — |
| Expiry date | Nov 27, 2026 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T9/00
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.