ot;?
Gerd
Von: mkgmap-dev im Auftrag von Ticker
Berkin
Gesendet: Donnerstag, 10. Juni 2021 10:07
An: Development list for mkgmap
Betreff: Re: [mkgmap-dev] Wrong Douglas-Peucker implementation?
Hi
Firstly, the algo for DP when the start & end points are close bu
ot;?
Gerd
Von: mkgmap-dev im Auftrag von Ticker
Berkin
Gesendet: Donnerstag, 10. Juni 2021 10:07
An: Development list for mkgmap
Betreff: Re: [mkgmap-dev] Wrong Douglas-Peucker implementation?
Hi
Firstly, the algo for DP when the start & end points are close but
other points are more
Hi
Firstly, the algo for DP when the start & end points are close but
other points are more distant should be considered - maybe preserving
the most distant points from the start & end or the points on the
bounding box.
DP using distance to line-through-points could reduce a very long line
to a
2021 21:43
An: mkgmap-dev@lists.mkgmap.org.uk
Betreff: Re: [mkgmap-dev] Wrong Douglas-Peucker implementation?
Hi Gerd,
Josm's algorithm removes some spikes, which probably aren't common for
real data and layer 0 of img. So differences aren't big. But maybe for
lower resolution it could be better
Hi Gerd,
Josm's algorithm removes some spikes, which probably aren't common for
real data and layer 0 of img. So differences aren't big. But maybe for
lower resolution it could be better, especially for polygons.
Wouldn't it be faster?
--
Best regards,
Andrzej
Hi all,
I've noticed that the line simplification in JOSM works different to the one in
mkgmap. Both implement a Douglas-Peucker algo, so I wondered why.
It turned out that JOSM calculates the distance of point `px` to the line
through(!) end-points `p1` and `p2`, while mkgmap calculates the
