Don't know if it makes sense, but I would try v.delaunay to build a net between closest centroids (given that each centroid is roughtly centered on its area).
Vincent Le mercredi 15 avril 2009 à 08:55 +0200, Martina Schäfer a écrit : > Dear GRASS experts! > I encountered an interesting problem and am curious about solutions. > A helicopter company has got a file from a client regarding a forest > inventory. The file contains 1430 polygons representing areas to be > visited. Now we want to calculate the optimal route to visit all > polygons. In contrast to a traveling salesman , we don't have a network > of routes as the helicopter can fly everywhere. Would it be a solution > to have the distance betweeen areas as the "cost"? > I used a tool in MapInfo that connects successive closest points which > worked very nice but not optimal. > Anyone knows of other solutions? > > Regards, > Martina > > ------------------------------------------------------------------------ > _______________________________________________ > grass-user mailing list > [email protected] > http://lists.osgeo.org/mailman/listinfo/grass-user > _______________________________________________ grass-user mailing list [email protected] http://lists.osgeo.org/mailman/listinfo/grass-user
