[mkgmap-dev] City search problem
From Gerd Petermann gpetermann_muenchen at hotmail.com on Thu Oct 4 17:05:37 BST 2018
Hi Valentin, there is no such limit. The polygon can be very complex. Splitter just uses a different algo if this happens. The problem here is that splitter tries to find rectangles that fit into the polygon AND don't have more than the given nodes AND are not too empty AND they have to be on the selected raster. The more complex the polygon the less likely it is to find a solution for this. You can change the limit in the source and try what happens. Gerd ________________________________________ Von: mkgmap-dev <mkgmap-dev-bounces at lists.mkgmap.org.uk> im Auftrag von ValentinAK <valentin_k at inbox.ru> Gesendet: Donnerstag, 4. Oktober 2018 14:51 An: mkgmap-dev at lists.mkgmap.org.uk Betreff: Re: [mkgmap-dev] City search problem Hi Andrzej. Earlier, I also wanted to use the --polygon-file Splitter option, but found it unusable. Only 40 vertices are allowed in the poly file. This is extremely small for repeating the border for a background polygon. Why this restriction? Very lacking the ability of unlimited poly file! Best regards, Valentin -- Sent from: http://gis.19327.n8.nabble.com/Mkgmap-Development-f5324443.html _______________________________________________ mkgmap-dev mailing list mkgmap-dev at lists.mkgmap.org.uk http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev
- Previous message: [mkgmap-dev] City search problem
- Next message: [mkgmap-dev] City search problem
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the mkgmap-dev mailing list