Reprint of: Memory-constrained algorithms for simple polygons (Q390167)
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 6249163
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reprint of: Memory-constrained algorithms for simple polygons |
scientific article; zbMATH DE number 6249163 |
Statements
Reprint of: Memory-constrained algorithms for simple polygons (English)
0 references
22 January 2014
0 references
space-time trade-off
0 references
constant workspace
0 references
triangulation
0 references
shortest path
0 references
simple polygon
0 references
0 references
0 references
0.9816722869873048
0 references
0.8741050958633423
0 references
0.8705385327339172
0 references
0.8402808308601379
0 references
0.8226446509361267
0 references
