[OSM-dev] Garmin maps

[Robert Hart]

> maybe not, i've seen a good technique of doing this on the list:
> rounding to grid
> take a point(x,y)
> x'=round(x/precision)*precision;
> same for y
> 
> do that for all points and remove all x' and y' which already exist
> (respectively don't create those if they exist)
> 

I'm not sure that's the best way of creating simplified data. What
matter more is how much a way, or other entity would deviate from it's
original course if you skip out a certain node.

For example, I envisage something like this.

Take a set of "n" points from a way. Create a new way using only the end
points, and any "branch" points. 

Now search through your set of points and find the point furthest from
the new way. If the distance is greater than "precision", add it to the
new way, and repeat.

Rob




This message has been scanned for viruses by MailControl - www.mailcontrol.com