I’d like to organize a tour around the lake with 2 objectives:
- maximise the length of shores to view
- minimise travel distance
In order to do so I can:
- Pick 2 most remote points on the lake in terms of travelling distance
- Define ‘left’ and ‘right’ shores of the lake
- Travel at equal distance between shores from A to B
What is the best way to find these 2 points?
UPDATE ON ORIGINAL Q:
The approach I am using is to place multiple random points and calculate Euclidean minimum spanning tree.
Iterate trough all pairs of points/nodes in order to find a couple with longest distance. Picture shows distance where destination is point at the North. It works but a bit cumbersome, so I am looking for ideas. Raster or vector will do.
This is about never ending discussion re polygon length.