> I have committed a program that compiles a diff for the coverage of
> boundaries in the boundary tiles.
>
> Start it with:
> java -cp mkgmap.jar
> uk.me.parabola.mkgmap.reader.osm.boundary.BoundaryDiff
>
>
> The diff is created as a set of gpx files that shows removed areas
> (contained in bound
I have committed a program that compiles a diff for the coverage of
boundaries in the boundary tiles.
Start it with:
java -cp mkgmap.jar
uk.me.parabola.mkgmap.reader.osm.boundary.BoundaryDiff
The diff is created as a set of gpx files that shows removed areas
(contained in boundsdir1 but not
.. can be downloaded from
http://www.navmaps.eu/wanmil/europe_bounds_20110515.zip
The format has slightly changed so you need to use the latest jar file
from the locator branch.
WanMil
___
mkgmap-dev mailing list
mkgmap-dev@lists.mkgmap.org.uk
http://w
On Sun, 2011-05-15 at 15:42 +0200, WanMil wrote:
> Am 15.05.2011 15:10, schrieb Jon Burgess:
> > On Sun, 2011-05-15 at 14:31 +0200, WanMil wrote:
> >> Hi all,
> >>
> >> I am thinking about how to reduce the processing time of the locator
> >> branch. One time consuming task is the check if a point,
Version 1946 was commited by marko on 2011-05-15 14:58:42 +0100 (Sun, 15 May
2011)
Translate man_made=~".*pipe.*" as lines.
___
mkgmap-dev mailing list
mkgmap-dev@lists.mkgmap.org.uk
http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev
Am 15.05.2011 15:10, schrieb Jon Burgess:
> On Sun, 2011-05-15 at 14:31 +0200, WanMil wrote:
>> Hi all,
>>
>> I am thinking about how to reduce the processing time of the locator
>> branch. One time consuming task is the check if a point, a line or a
>> polygon lies inbetween, cuts or lies outside
On Sun, 2011-05-15 at 14:31 +0200, WanMil wrote:
> Hi all,
>
> I am thinking about how to reduce the processing time of the locator
> branch. One time consuming task is the check if a point, a line or a
> polygon lies inbetween, cuts or lies outside another polygon.
>
> Processing time for this
Hi Wanmil
I don't propose spending too much time working on efficiency. First of
all: a boundary is a boundary. All elements inside should exactly match
the 'real world' boundary in order to avoid highways to be found in the
next city. Second: there's still some quality problems in the locator
Hi all,
I am thinking about how to reduce the processing time of the locator
branch. One time consuming task is the check if a point, a line or a
polygon lies inbetween, cuts or lies outside another polygon.
Processing time for this check is directly related to the number of
nodes that defin
> Just wondering, maybe we can use the locator rules also for country or state
> specific routing?
> For instance in some countries (like Germany (?) according to the access
> rules on osm, see
> http://wiki.openstreetmap.org/wiki/OSM_tags_for_routing/Access-Restrictions#Germany)
> one is allow
10 matches
Mail list logo
