A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287)
From MaRDI portal
!
WARNING
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 5196812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-time 2-approximation algorithm for the watchman route problem for simple polygons |
scientific article; zbMATH DE number 5196812 |
Statements
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (English)
0 references
28 September 2007
0 references
computational geometry
0 references
approximation algorithms
0 references
watchman route problem
0 references
essential cuts
0 references
polygon visibility
0 references
0 references
0.991995096206665
0 references
0.9099102020263672
0 references
0.904686152935028
0 references
0.9030898809432985
0 references
0.8947173357009888
0 references
