Geometric kth Shortest Paths: the Applet

Computing shortest paths in a polygonal do- main is a classic problem in computational geometry. Ecient algorithms for computing such paths use the continuous Dijk- stra paradigm [2], which not onl ...