Files
iD/test/spec
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-06-18 12:21:56 -07:00
2013-08-30 13:59:29 -07:00
2013-08-30 19:27:21 -07:00
2013-06-21 20:10:35 -07:00
2013-06-03 15:48:03 -07:00
2013-08-22 14:30:27 -07:00
2013-08-27 11:46:24 -07:00
2013-08-30 14:23:05 -07:00
2013-07-25 19:24:07 -07:00
2013-05-08 09:12:16 -04:00
2013-04-02 13:31:08 -04:00
2013-04-26 17:33:01 -07:00
2013-02-26 15:03:20 -05:00
2013-05-08 09:09:42 -04:00