An O(n3) algorithm for finding the minimal opaque forest of a convex polygon

  • Authors:
  • P. Dublish

  • Affiliations:
  • -

  • Venue:
  • Information Processing Letters
  • Year:
  • 1988

Quantified Score

Hi-index 0.89

Visualization

Abstract