<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body text="#000000" bgcolor="#FFFFFF">
Below is some output from Splitter. It knows it must return at least
two tiles but still settles with one. <br>
<br>
Commandline:<br>
java -Xmx2048M -jar ~/garmin/utils/splitter/splitter.jar
--output=o5m --keep-complete=true --mapid=63241911 --num-tiles=2
--write-kml=63240007.kml --no-trim=true 63240007.o5m<br>
<br>
The relevant Splitter output:<br>
<meta http-equiv="content-type" content="text/html;
charset=ISO-8859-1">
<title></title>
<meta name="generator" content="LibreOffice 4.2.4.2 (Linux)">
<style type="text/css"><!--
                body,div,table,thead,tbody,tfoot,tr,th,td,p { font-family:"Liberation Sans"; font-size:x-small }
                 -->
        </style>Splitter version 412 compiled 2014-06-21T13:47:04+0100<br>
boundary-tags=use-exclude-list<br>
cache=<br>
description=<br>
geonames-file=/home/lambertus/garmin/utils/cities15000.zip<br>
keep-complete=true<br>
mapid=63241911<br>
max-areas=512<br>
max-nodes=1600000<br>
max-threads=4 (auto)<br>
mixed=false<br>
no-trim=true<br>
num-tiles=2<br>
output=o5m<br>
output-dir=<br>
overlap=auto<br>
polygon-desc-file=<br>
polygon-file=<br>
precomp-sea=<br>
problem-file=<br>
problem-report=<br>
resolution=13<br>
search-limit=200000<br>
split-file=<br>
status-freq=120<br>
stop-after=dist<br>
write-kml=63240007.kml<br>
Elapsed time: 0s Memory: Current 120MB (3MB used, 117MB free) Max
1820MB<br>
Time started: Mon Jul 07 23:07:41 CEST 2014<br>
Map is being split for resolution 13:<br>
- area boundaries are aligned to 0x800 map units (0.0439453125
degrees)<br>
- areas are multiples of 0x800 map units wide and high<br>
Processing 63240007.o5m<br>
Bounding box -121.37695310000001 21.269531200000003 -117.4658203
33.9257812<br>
in 1 file<br>
Time: Mon Jul 07 23:07:42 CEST 2014<br>
Exact map coverage is (21.26953125,-121.376953125) to
(33.92578125,-117.4658203125)<br>
Rounded map coverage is (21.26953125,-121.376953125) to
(33.92578125,-117.4658203125)<br>
Splitting nodes into 2 areas<br>
Trying a max-nodes value of 557503 to split 1115006 nodes into 2
areas<br>
Best solution until now: 6 tile(s). The smallest node count is 52036
(9 %), the worst aspect ratio is near 3.94, elapsed search time: 0 s<br>
Best solution until now: 5 tile(s). The smallest node count is 71333
(12 %), the worst aspect ratio is near 3.83, elapsed search time: 0
s<br>
No good solution found, duplicated search-limit to 400000<br>
No good solution found, duplicated search-limit to 800000<br>
No good solution found, duplicated search-limit to 1600000<br>
No good solution found, duplicated search-limit to 3200000<br>
No good solution found, duplicated search-limit to 6400000<br>
Still no good solution found, trying alternate algorithm<br>
Trying to optimize parts of the best solution...<br>
Solution is not nice. Can't find a better solution with search-limit
6400000: 5 tile(s). The smallest node count is 71333 (12 %), the
worst aspect ratio is near 3.83<br>
Final solution: 5 tile(s). The smallest node count is 71333 (12 %),
the worst aspect ratio is near 3.83<br>
Area 63241911 covers (27.9931640625,-120.673828125) to
(33.3984375,-117.4658203125) and contains 71333 nodes (12 %)<br>
Area 63241912 covers (33.3984375,-120.673828125) to
(33.92578125,-118.2568359375) and contains 147444 nodes (26 %)<br>
Area 63241913 covers (33.3984375,-118.2568359375) to
(33.92578125,-117.9931640625) and contains 175164 nodes (31 %)<br>
Area 63241914 covers (33.3984375,-117.9931640625) to
(33.7060546875,-117.4658203125) and contains 308932 nodes (55 %)<br>
Area 63241915 covers (33.7060546875,-117.9931640625) to
(33.92578125,-117.4658203125) and contains 412133 nodes (73 %)<br>
Trying a max-nodes value of 1393758 to split 1115006 nodes into 2
areas<br>
Highest node count in a single grid element is 83,854<br>
Solving partition (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) with 1,115,006 nodes<br>
Trying to find nice split for (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) with 1,115,006 nodes<br>
searching for split with min-nodes 69687, learned 0 good partial
solutions<br>
Best solution until now: 1 tile(s). The smallest node count is
1115006 (79 %), the worst aspect ratio is near 2.09, elapsed search
time: 0 s<br>
This can't be improved.<br>
Solution is nice. Can't find a better solution with search-limit
200000: 1 tile(s). The smallest node count is 1115006 (79 %), the
worst aspect ratio is near 2.09<br>
Final solution: 1 tile(s). The smallest node count is 1115006 (79
%), the worst aspect ratio is near 2.09<br>
This seems to be nice.<br>
Area 63241916 covers (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) and contains 1115006 nodes (79 %)<br>
Trying a max-nodes value of 975630 to split 1115006 nodes into 2
areas<br>
Highest node count in a single grid element is 83,854<br>
Solving partition (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) with 1,115,006 nodes<br>
Trying to find nice split for (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) with 1,115,006 nodes<br>
searching for split with min-nodes 48781, learned 0 good partial
solutions<br>
Best solution until now: 5 tile(s). The smallest node count is 52036
(5 %), the worst aspect ratio is near 3.94, elapsed search time: 0 s<br>
searching for split with min-nodes 325210, learned 0 good partial
solutions<br>
searching for split with min-nodes 188623, learned 0 good partial
solutions<br>
searching for split with min-nodes 120329, learned 0 good partial
solutions<br>
searching for split with min-nodes 86182, learned 0 good partial
solutions<br>
searching for split with min-nodes 69109, learned 0 good partial
solutions<br>
Best solution until now: 4 tile(s). The smallest node count is 71333
(7 %), the worst aspect ratio is near 3.83, elapsed search time: 0 s<br>
searching for split with min-nodes 325210, learned 0 good partial
solutions<br>
searching for split with min-nodes 198271, learned 0 good partial
solutions<br>
searching for split with min-nodes 134802, learned 0 good partial
solutions<br>
searching for split with min-nodes 103067, learned 0 good partial
solutions<br>
searching for split with min-nodes 87200, learned 0 good partial
solutions<br>
searching for split with min-nodes 79266, learned 0 good partial
solutions<br>
searching for split with min-nodes 75299, learned 0 good partial
solutions<br>
searching for split with min-nodes 73316, learned 0 good partial
solutions<br>
searching for split with min-nodes 72324, learned 0 good partial
solutions<br>
searching for split with min-nodes 71828, learned 0 good partial
solutions<br>
searching for split with min-nodes 71580, learned 0 good partial
solutions<br>
searching for split with min-nodes 71456, learned 0 good partial
solutions<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
No good solution found, duplicated search-limit to 400000<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
No good solution found, duplicated search-limit to 800000<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
No good solution found, duplicated search-limit to 1600000<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
No good solution found, duplicated search-limit to 3200000<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
No good solution found, duplicated search-limit to 6400000<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
Still no good solution found, trying alternate algorithm<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
Trying to optimize parts of the best solution...<br>
searching for split with min-nodes 71334, learned 0 good partial
solutions<br>
Solution is not nice. Can't find a better solution with search-limit
6400000: 4 tile(s). The smallest node count is 71333 (7 %), the
worst aspect ratio is near 3.83<br>
Final solution: 4 tile(s). The smallest node count is 71333 (7 %),
the worst aspect ratio is near 3.83<br>
Area 63241917 covers (27.9931640625,-120.673828125) to
(33.3984375,-117.4658203125) and contains 71333 nodes (7 %)<br>
Area 63241918 covers (33.3984375,-120.673828125) to
(33.92578125,-118.2568359375) and contains 147444 nodes (15 %)<br>
Area 63241919 covers (33.3984375,-118.2568359375) to
(33.92578125,-117.9931640625) and contains 175164 nodes (17 %)<br>
Area 63241920 covers (33.3984375,-117.9931640625) to
(33.92578125,-117.4658203125) and contains 721065 nodes (73 %)<br>
Trying a max-nodes value of 1184694 to split 1115006 nodes into 2
areas<br>
Highest node count in a single grid element is 83,854<br>
Solving partition (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) with 1,115,006 nodes<br>
Trying to find nice split for (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) with 1,115,006 nodes<br>
searching for split with min-nodes 59234, learned 0 good partial
solutions<br>
Best solution until now: 1 tile(s). The smallest node count is
1115006 (94 %), the worst aspect ratio is near 2.09, elapsed search
time: 0 s<br>
This can't be improved.<br>
Solution is very nice. No need to search for a better solution: 1
tile(s). The smallest node count is 1115006 (94 %), the worst aspect
ratio is near 2.09<br>
Final solution: 1 tile(s). The smallest node count is 1115006 (94
%), the worst aspect ratio is near 2.09<br>
This seems to be nice.<br>
Area 63241921 covers (27.9931640625,-120.673828125) to
(33.92578125,-117.4658203125) and contains 1115006 nodes (94 %)<br>
Creating the initial areas took 706 ms<br>
Writing KML file to ./63240007.kml<br>
1 areas:<br>
Area 63241911: 1304576,-5623808 to 1581056,-5474304 covers
(0x13e800,0xffaa3000) to (0x182000,0xffac7800) US-Long Beach<br>
Generating problem list for 1 distinct areas<br>
Processing 1 areas in a single pass<br>
Pseudo-Writers:<br>
Pseudo area -2 covers (33.92578125,-180.0) to (90.0,180.0)<br>
Pseudo area -3 covers (-90.0,-180.0) to (27.9931640625,180.0)<br>
Pseudo area -4 covers (27.9931640625,-180.0) to
(33.92578125,-120.673828125)<br>
Pseudo area -5 covers (27.9931640625,-117.4658203125) to
(33.92578125,180.0)<br>
cached 6 combinations of areas that form rectangles.<br>
WriterGridTree [512][512] for grid area (-90.0,-180.0) to
(90.0,180.0) requires max. 3 checks for each node (0 sub grid(s))<br>
Grid(s) created in 156 ms<br>
Starting problem-list-generator pass(es) for partition 1<br>
<br>
<br>
<div class="moz-cite-prefix">On 07/03/2014 08:41 PM, Lambertus
wrote:<br>
</div>
<blockquote cite="mid:53B5A3C1.9050406@na1400.info" type="cite">There
is a ~20MB o5m file that needs to be split. But Splitter returns:
<br>
<br>
"Cannot find a good split with exactly 2 areas"
<br>
<br>
I hope a (the) dev can have a look at this? Thanks!
<br>
<br>
The tile is here:
<a class="moz-txt-link-freetext" href="http://osm.pleiades.uni-wuppertal.de/garmin/20140703/63240007.o5m">http://osm.pleiades.uni-wuppertal.de/garmin/20140703/63240007.o5m</a>
<br>
<br>
See for more info and a link to the o5m file:
<br>
<a class="moz-txt-link-freetext" href="http://forum.openstreetmap.org/viewtopic.php?pid=434024#p434024">http://forum.openstreetmap.org/viewtopic.php?pid=434024#p434024</a>
<br>
_______________________________________________
<br>
mkgmap-dev mailing list
<br>
<a class="moz-txt-link-abbreviated" href="mailto:mkgmap-dev@lists.mkgmap.org.uk">mkgmap-dev@lists.mkgmap.org.uk</a>
<br>
<a class="moz-txt-link-freetext" href="http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev">http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev</a>
<br>
</blockquote>
<br>
</body>
</html>