Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon (Q2980918)
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: Time-space trade-off for finding the k-visibility region of a point in a polygon |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon |
scientific article |
Statements
Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon (English)
0 references
5 May 2017
0 references
memory-constrained model
0 references
\(k\)-visibility region
0 references
time-space trade-off
0 references
0.9522143006324768
0 references
0.8447741270065308
0 references
0.8353057503700256
0 references
0.8247358798980713
0 references
0.8133267164230347
0 references
