[Openstreetmap] more distributed ideas

[Erik Johansson]

On 2/3/06, Richard Fairhurst <richard at systemed.net> wrote:
> Quoting Erik Johansson <erjohan at gmail.com>:
> If you've got a good enough algorithm (like the one in Illustrator) and
> a client
> capable of rendering beziers (again, Flash or SVG), you can simplify a
> path into
> beziers. This is amazingly efficient - 90%+ savings aren't uncommon.

Ups sorry didn't mean to send that first mail.

We want to reduce a graph not just a polyline, simple line reduction
can be found at:
http://geometryalgorithms.com/Archive/algorithm_0205/

But I have been thinking can you reduce it by doing this:
1. Transform  all nodes in the bbox to x/y of the current tile
2. pick a (random/or someother way) point
3. simplify all nodes that are in a 3x3 square around this point to a new node
5. connect all the old segments that linked to the deleted nodes to this node.
6. go to 2

This would work for the first zoomlevels.


--
/Erik
PS. I'm not much for Beziers, but that's just because I grew sick of
them in my Numerical Methods course.