Scalable and efficient cutting of map tiles
US9395193B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 30, 2012 |
| Grant date | Jul 19, 2016 |
| Priority date | — |
| Expiry date | Oct 5, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T11/00
- WIPO fieldMeasurement
- WIPO sectorInstruments
Abstract
A process is provided that reduces the amount of data for a map tile that could not be displayed separately on the scale of that tile. The process generates an equivalent of the road data by rasterizing the vectors representing road segments lying within a tile and generating a connectivity mask that keeps track of which pixels are connected to which other pixels along the vectors. The process constructs an undirected graph. Each “on” pixel of the undirected graph represents a vertex and the vertices are connected by edges generated from the connectivity graph, but without a set direction. The process traces the undirected graph to generate chains of connected road segments and takes the chains and simplifies them in order to reduce the amount of data that must be stored and transmitted for the tile in order to produce all the visible roads of the tile at that scale.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.