Maps from Sparse Geospatial Data Tiles

• US 20100321399A1
• Filed: 06/18/2009
• Published: 12/23/2010
• Est. Priority Date: 06/18/2009
• Status: Abandoned Application

• Current Assignee: Carmenta AB
• Original Assignee: Carmenta AB
• Inventors: Gustafsson, Anders, Ellren, Patrik
• Application Number:
  US12/487,466
• Publication Number:
  US 20100321399A1
• Time in Patent Office: Days
• US Class Current: 345/587
• CPC Class Codes: G06F 16/29 Geographical information databases

Abstract

Existing map solutions using tiled maps with geographic data in vector format typically has such a volume of data that not all geographic data can be stored in memory. A primary bottleneck for map rendering speed in such solutions is the time needed to load all data necessary for replacing one rendered map with the next rendered map. Utilizing the structure and methods of the invention herein when loading geographic vector data, the average time to load all necessary geographic data needed for one rendered map to the next will be greatly reduced—the loading time reduction will be especially large when pan and zoom operations are the main transitions from one rendered map to the next.

Claims

1. A method of organizing computer-based map data corresponding to an area, comprising:

generating a tile-tree having a plurality of levels of tiles of the map data, wherein tiles of different levels include map data of different respective scales and tiles include respective unique identifiers; and

packing tiles of the tile-tree based on a density of map data to reduce a number of tiles in the tile-tree.

2. The method of claim 1, wherein generating the tile-tree comprises determining a first set of tiles of map data that cover the area at any scale, the first set of tiles being included in any level of the tile-tree, and determining successive sets of tiles included in adjacent levels of the tile-tree from the first set of tiles.

3. The method of claim 1, wherein generating the tile-tree comprises determining a first set of tiles of map data that cover the area at a largest scale, the first set of tiles being included in a first level of the tile-tree, and determining successive sets of tiles included in successive levels of the tile-tree from the first set of tiles

4. The method of claim 1, wherein based on the descriptions, the set of map features is certain to be included in the tiles.

5. The method of claim 1, wherein generating the tile-tree includes generalizing map data of at least one first scale to at least one second scale

6. The method of claim 5, wherein generalizing map data includes removing a feature in the map data of the first scale.

7. The method of claim 5, wherein generalizing map data includes at least one of line-thinning and polygon-thinning the map data of the first scale.

8. The method of claim 1, wherein each tile includes a respective list of detail levels.

9. The method of claim 1, wherein generating the tile-tree includes comparing a size of a tile to a maximum size and splitting the tile into separate tiles if the tile'"'"'s size exceeds the maximum size.

10. The method of claim 9, wherein the maximum size corresponds to an average size of tiles of a selected group of map data.

11. The method of claim 1, wherein tiles further include descriptions of levels for which at least one set of map features is included in the respective tiles.

12. A method of using computer-based map data, comprising:

receiving a first request for computer-based map data corresponding to an area;

organizing computer-based map data corresponding to the first request according to the method of claim 1; and

sending a response to the first request that includes only at least one tile not previously included in a response to a request corresponding to the first request.

13. The method of claim 12, wherein the response includes information about a neighborhood of a requested tile, and the information decreases a number of requests needed for sending responses that collectively include tiles sufficient for a complete map of the area.

14. The method of claim 13, wherein the request includes an operator on the map of the area, and the operator is a pan or a zoom.

15. An apparatus for organizing computer-based map data corresponding to an area, comprising:

a tile-tree generator configured to generate a tile-tree having a plurality of levels of tiles of the map data, wherein tiles of different levels include map data of different respective scales and tiles include respective unique identifiers; and

a tile packer configured to pack tiles of levels of the tile-tree based on a density of map data to reduce a number of tiles in the tile-tree.

16. A computer-readable medium having stored therein instructions that, when executed by a computer, cause the computer to carry out a method of organizing computer-based map data corresponding to an area, wherein the method comprises:

generating a tile-tree having a plurality of levels of tiles of the map data, wherein tiles of different levels include map data of different respective scales and tiles include respective unique identifiers; and

packing tiles of the tile-tree based on a density of map data to reduce a number of tiles in the tile-tree.