Computing a shortest weakly externally visible line segment for a simple polygon

Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint

Research output: Contribution to journalArticlepeer-review


A simple polygon P is said to be weakly externally visible from a line segment L if it lies outside P and for every point p on the boundary of P there is a point q on L such that no point in the interior of pq lies inside P. In this paper, a linear time algorithm is proposed for computing a shortest line segment from which P is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.

Original languageEnglish (US)
Pages (from-to)81-96
Number of pages16
JournalInternational Journal of Computational Geometry and Applications
Issue number1
StatePublished - Feb 1999


  • External visibility
  • Polygon
  • Shortest visible line segment
  • Weak visibility

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Computing a shortest weakly externally visible line segment for a simple polygon'. Together they form a unique fingerprint.

Cite this