Memory-constrained algorithms for simple polygons (Q2391542)
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 6193438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Memory-constrained algorithms for simple polygons |
scientific article; zbMATH DE number 6193438 |
Statements
Memory-constrained algorithms for simple polygons (English)
0 references
31 July 2013
0 references
space-time trade-off
0 references
constant workspace
0 references
triangulation
0 references
shortest path
0 references
simple polygon
0 references
algorithm
0 references
0 references
0 references
0.88314134
0 references
0.88197374
0 references
0.88197374
0 references
0.87323344
0 references
0.8722616
0 references
0.8707012
0 references
0.87049365
0 references
