A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2007.05.021 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2007.05.021 / rank | |||
Normal rank | |||
Latest revision as of 07:39, 18 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-time 2-approximation algorithm for the watchman route problem for simple polygons |
scientific article |
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
