[mkgmap-dev] splitter that generates problem list

Sun Nov 4 17:55:07 GMT 2012

Am 04.11.2012 14:05, schrieb Gerd Petermann:
> @ all: I need an algorithm that uses a list like below and fills "the 
> rest of planet" with a small number of rectangles. There is no need to 
> find the smallest number, but the result should be near.
Another idea:

detect problematic polygons or read problematic-polygons.txt

read relations and copy with way-ids and node-ids to RAM
read ways and copy node-id to RAM
read nodes
     is node in tile X?
         check in RAM: does this node belong to a way or relation?
             save this info somewhere (so you know, which ways and 
relations should be written to a tile X and which way/node-ids are missing)
read nodes again
     is node in tile X?
         write to tile X
     is node missing in tile X?
         write to tile X
read ways
     should it be written to tile X?
         write it to tile X
read relations
     should it be written to tile X?
         write it to tile X
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.mkgmap.org.uk/pipermail/mkgmap-dev/attachments/20121104/e9bba596/attachment.html