A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane (Q3092254)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5948032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nearly optimal algorithm for finding \(L _{1}\) shortest paths among polygonal obstacles in the plane |
scientific article; zbMATH DE number 5948032 |
Statements
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane (English)
0 references
16 September 2011
0 references
0.9472984075546264
0 references
0.9443451166152954
0 references
0.9396722316741944
0 references
0.9324307441711426
0 references
0.9040549993515016
0 references
