Shortest Path in a Polygon using Sublinear Space. (Q5368680)
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: Shortest Path in a Polygon using Sublinear Space. |
scientific article; zbMATH DE number 6789185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest Path in a Polygon using Sublinear Space. |
scientific article; zbMATH DE number 6789185 |
Statements
10 October 2017
0 references
shortest path
0 references
violator spaces
0 references
limited space
0 references
Shortest Path in a Polygon using Sublinear Space. (English)
0 references
0.9999998
0 references
0 references
0 references
0.91956896
0 references
0.91935897
0 references
0.9168882
0 references
0.9149688
0 references
0.90949357
0 references
