An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon (Q1114398)
From MaRDI portal
!
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 4082971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^ 3)\) algorithm for finding the minimal opaque forest of a convex polygon |
scientific article; zbMATH DE number 4082971 |
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
0.9131844639778136
0 references
0.884669303894043
0 references
0.8795388340950012
0 references
