Geometric kth shortest paths: The applet
2014 (English)In: Proceedings of the thirtieth annual symposium on Computational geometry, 2014Conference paper (Refereed)Text
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 , which not only allows one to nd the short- est path between two points but also computes the \shortest path map" from a given source|a structure enabling ecient queries of shortest paths to points in the domain.
Place, publisher, year, edition, pages
IdentifiersURN: urn:nbn:se:liu:diva-128024OAI: oai:DiVA.org:liu-128024DiVA: diva2:928736