Version 1101 was commited by markb on 2009-07-24 00:02:50 +0100 (Fri, 24 Jul
2009)
Further work on loop splitting code.
Two changes:
1 - the recent commit that changed the test to see whether splitting a
way would introduce a short arc was too strict in that it checked
to see if the candidate splitting point was too close to its nearest
neighbour points but as they may not be nodes it doesn't matter how
close it is to them, what matters is that it isn't too close to any
nodes in the way so this commit now adds method safeToSplitWay() that
decides whether adding a node at a given point in a way does not
introduce any short arcs.
2 - In the situation where the looped way cannot be split without
introducing a short arc, it now aggressively prunes the way to
remove the loop without producing a short arc. It removes the point
that completes the loop and then, if it was the last point in the way,
keeps removing the new last point until either no short arc will be
created or all the points back to the start of the loop have been
removed.
_______________________________________________
mkgmap-dev mailing list
[email protected]
http://www.mkgmap.org.uk/mailman/listinfo/mkgmap-dev
