An O(n3) algorithm for finding the minimal opaque forest of a convex polygon
Author:
- 24 November 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 29 (5) , 275-276
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- An algorithm for determining an opaque minimal forest of a convex polygonInformation Processing Letters, 1987