Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_14 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1920319052 / rank | |||
Normal rank | |||
Revision as of 19:32, 19 March 2024
scientific article; zbMATH DE number 5578469
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Space–Query-Time Tradeoff for Computing the Visibility Polygon |
scientific article; zbMATH DE number 5578469 |
Statements
Space–Query-Time Tradeoff for Computing the Visibility Polygon (English)
0 references
14 July 2009
0 references
visibility polygon
0 references
logarithmic query time
0 references
space-query-time tradeoff
0 references
\((1/r)\)-cutting
0 references
