Efficient computation of query point visibility in polygons with holes (Q5370627): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1064092.1064140 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2010226110 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:53, 20 March 2024
scientific article; zbMATH DE number 6794177
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
