Files
iD/test
tyr 6afe3adfbe more clever splitting of closed ways
if a way is closed, iD needs to choose a second node to
split the way at.

This algorithm looks for a node that is both far away from
the initial node in terms of way segment length and nearby
in terms of beeline-distance. This assures that areas get
split on the most "natural" points (independent of the number
of nodes).

For example: bone-shaped areas get split across their waist-
line, circles across the diameter.
2013-09-29 07:43:20 -07:00
..
2013-02-10 12:31:59 -08:00
2013-04-04 10:48:13 -07:00
2013-09-29 07:43:20 -07:00
2013-03-13 17:31:25 -07:00
2013-04-22 10:50:36 -07:00
2013-08-30 19:27:21 -07:00
2013-06-03 15:48:03 -07:00