Hi Steve,
Date: Sun, 22 Jan 2012 15:00:27 +0000 From: steve@parabola.me.uk To: mkgmap-dev@lists.mkgmap.org.uk Subject: Re: [mkgmap-dev] mkgmap memory problem with big, nearly empty tiles
Hi
And why does mkgmap need so much memory for this tile? Is there any way to improve the mkgmap algorithm to work with this tile?
The area of the map is broken down into a number of sub areas, which have a maximum size and so there are a vast number required to cover that area.
I believe that the algorithm could be amended to skip divisions that are empty and so the out of memory problem could be avoided. Its quite possible that the resulting map would not work though.
But anyway in this case I would have thought that this is a splitter error?
Thorsten used the no-trim parameter, so I think splitter result is correct.
Even if it isn't, splitter needs to have a maximum tile size and I thought it did, or at least I thought it had at one time.
The current split algorithm stops if the tiles are too small or if they have fewer than max-nodes coords. It should be easy to implement also a maximun-size criteria. What values do you suggest to use for that?
..Steve _______________________________________________ mkgmap-dev mailing list mkgmap-dev@lists.mkgmap.org.uk http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev