An efficient algorithm for computing least cost paths with turn constraints (Q293389)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for computing least cost paths with turn constraints |
scientific article; zbMATH DE number 6590766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for computing least cost paths with turn constraints |
scientific article; zbMATH DE number 6590766 |
Statements
An efficient algorithm for computing least cost paths with turn constraints (English)
0 references
9 June 2016
0 references
Dijkstra's algorithm
0 references
shortest paths
0 references
least cost paths
0 references
range searching
0 references
routing
0 references
turn constraints
0 references
computational complexity
0 references
0.7853792309761047
0 references
0.7816907167434692
0 references
0.7792436480522156
0 references
0.761084794998169
0 references
