Gieno Shortest Path Algorithm -- Polyline Routing |
||
Suppose you have to build a road to connect two cities on different sides of a lake. How would you plan the road to make it as short as possible? To simplify the problem statement, a lake is sufficiently well modeled by a polygon, and the cities are just two points. The polygon does not have self-intersections and the endpoints are both outside the polygon. If you have Silverlight installed, you can use drag and drop on the points below to experiment: Link Here |
||
![](https://img2024.cnblogs.com/blog/35695/202407/35695-20240713070336838-1837943664.jpg)