On 24 Mar 2010, at 10:52, John Smith wrote: > This is a routing problem, hopefully someone has already solved it. > > If there is a suburb of streets mapped from aerial imagery and you > have several volunteers how do you work out the most efficient path > for all the voluneteers to take to grab street names with minimal > overlap etc.
Some variant of the Chinese postman algorithm would be my guess... -- Chris Jones, SUCS Admin http://sucs.org _______________________________________________ dev mailing list [email protected] http://lists.openstreetmap.org/listinfo/dev
