Reprint of: Memory-constrained algorithms for simple polygons (Q390167): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:25, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Reprint of: Memory-constrained algorithms for simple polygons |
scientific article |
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