Constant-work-space algorithm for a shortest path in a simple polygon (Q3404425)
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 5667850
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constant-work-space algorithm for a shortest path in a simple polygon |
scientific article; zbMATH DE number 5667850 |
Statements
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon (English)
0 references
9 February 2010
0 references
0.9633079767227172
0 references
0.877844512462616
0 references
0.8682283759117126
0 references
0.8553260564804077
0 references
0.8311306238174438
0 references
