Sweeping simple polygons with the minimum number of chain guards (Q845964)
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: Sweeping simple polygons with the minimum number of chain guards |
scientific article; zbMATH DE number 5664780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sweeping simple polygons with the minimum number of chain guards |
scientific article; zbMATH DE number 5664780 |
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
0.8578349947929382
0 references
0.8449978232383728
0 references
