[OSM-dev] Doing street names from aerial imagery

[Tom Hughes]

On 24/03/10 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.

It's basically just a version of the "Travelling Salesman Problem" which 
you will find discussed in detail in any Computer Science textbook. 
Wikipedia discusses it here:

   http://en.wikipedia.org/wiki/Travelling_salesman_problem

Wanting to divide the job among multiple people probably just makes it 
harder, but as it's NP-complete to start with I'm not sure that matters ;-)

Tom

-- 
Tom Hughes (tom at compton.nu)
http://compton.nu/