An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon (Q1114398): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:32, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon |
scientific article |
Statements
An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon (English)
0 references
1988
0 references
An \(O(n^ 6)\) algorithm for computing the minimal opaque forest of a convex polygon has been proposed by \textit{V. Akman} [ibid. 24, 193-198 (1987; Zbl 0653.68030)]. We show that a simple modification improves the running time of this algorithm to \(O(n^ 3)\).
0 references
computational geometry
0 references
minimal opaque forest
0 references
convex polygon
0 references
