liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Geometric kth shortest paths: The applet
Mentor Graphics Corporation.
Linköping University, Department of Science and Technology, Communications and Transport Systems. Linköping University, Faculty of Science & Engineering.
Dep. Mathematics and Computer Science TU Eindhoven.
Helsinki Institute for IT, CS Dept University of Helsinki.
2014 (English)In: Proceedings of the thirtieth annual symposium on Computational geometry, 2014Conference paper (Refereed)Text
Abstract [en]

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 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
2014.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-128024OAI: oai:DiVA.org:liu-128024DiVA: diva2:928736
Conference
SoCG 2014
Available from: 2016-05-16 Created: 2016-05-16 Last updated: 2016-05-25

Open Access in DiVA

No full text

Other links

link

Search in DiVA

By author/editor
Polishchuk, Valentin
By organisation
Communications and Transport SystemsFaculty of Science & Engineering
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 20 hits
ReferencesLink to record
Permanent link

Direct link