[Tilesathome] Simple collision avoidance for or/p

[Adam Schreiber]

On Thu, Mar 27, 2008 at 6:01 PM, Frederik Ramm <frederik at remote.org> wrote:
>  problem, if you imagine an U shaped way and another way that connects
>  the two legs of the U, and both had the same labels - the algorithm
>  would say "start and end node within 100m of each other, so discard
>  one of the labels".

You could have a second hash table where instead of inserting the end
points of the path, the centroid is calculated and placed in the table
with the text.  If the centroids are within some tolerance and the
text matches, the second text is ignored.

Cheers,

Adam