Sweeping simple polygons with the minimum number of chain guards (Q845964): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2006.11.010 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989326554 / rank | |||
Normal rank | |||
Revision as of 23:49, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sweeping simple polygons with the minimum number of chain guards |
scientific article |
Statements
Sweeping simple polygons with the minimum number of chain guards (English)
0 references
29 January 2010
0 references
computational geometry
0 references
analysis of algorithms
0 references
sweeping polygons with chain guards
0 references
link diagrams
0 references
