Inside a large polygon (say the USA boundaries) I need to find the shortest path that will encompass smaller polygons(say the following cities: Kansas city, St Louis, Memphis, Oklahoma City)By shortest I mean with the less nodes as possible. (then will the smaller inner surface)A 'not-that-bad' result will be the bounding rectangle that comprises the 4 citiesA better one will be a triangle (3 nodes < 4) New York, San Antonio, SeattleAn even better would be the triangle Minneapolis, Louisville, El Paso because surface is less than previous oneExemple For non USimagine a large rectangle 0,0 => 1000,1000inside 4 points 490,490 ; 490,510 ; 510,510 ; 510,490a good result : rectangle 490,490 => 510,510a better result : large triangle 490,0 490,490 1000,490an even better : small triangle 490,490 ; 530,490 490,530Is there a well known algorithm for this ?
Which algorithm to find the shortest (nodes count) path that encompasses all polygons inside a larger polygon?
algorithms;geometry