Efficient computation of query point visibility in polygons with holes (Q5370627)
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 6794177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of query point visibility in polygons with holes |
scientific article; zbMATH DE number 6794177 |
Statements
Efficient computation of query point visibility in polygons with holes (English)
0 references
20 October 2017
0 references
polygon with holes
0 references
visibility decomposition
0 references
visibility polygon
0 references
0.9807485342025756
0 references
0.8475210666656494
0 references
0.8235800266265869
0 references
0.7945945858955383
0 references
0.7945944666862488
0 references
