On 24/03/2010 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.
You need to bear in mind that there will be errors in the tracing anyway -- roads marked that aren't there, and some paths missed that are there. Your volunteers will need to take this into account as well, so sticking to a pre-defined route won't work very well. Use a cake. Cake is good. -- Jonathan (Jonobennett) _______________________________________________ dev mailing list dev@openstreetmap.org http://lists.openstreetmap.org/listinfo/dev
