An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon

@article{Dublish1988AnOA,
  title={An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon},
  author={Pratul Dublish},
  journal={Inf. Process. Lett.},
  year={1988},
  volume={29},
  pages={275-276}
}
denote the set of vertices of P. Assume that the clockwise order of the vertices of P is u,,, u,, . . , u, _ , . A triangle is said to be obtained from P if its three vertices are in V(P). In the following we use T to denote a triangle obtained from P. Since P is convex, T lies in the interior of P and, in general, it partitions P into three convex polygons P,, P2 and P3 (see Fig. 1). Akman’s algorithm finds the minimal opaque forest of P by computing a locally minimal opaque forest for each… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…