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

Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried Toussaint

Research output: Contribution to journalArticle

Abstract

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
Volume9
Issue number1
DOIs
StatePublished - Jan 1 1999

Fingerprint

Simple Polygon
Line segment
Linear-time Algorithm
Computing
Convex polygon
Interior

Keywords

  • 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

Cite this

Computing a shortest weakly externally visible line segment for a simple polygon. / Bhattacharya, Binay K.; Mukhopadhyay, Asish; Toussaint, Godfried.

In: International Journal of Computational Geometry and Applications, Vol. 9, No. 1, 01.01.1999, p. 81-96.

Research output: Contribution to journalArticle

@article{9a277266338248f696750f4a64bbb114,
title = "Computing a shortest weakly externally visible line segment for a simple polygon",
abstract = "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.",
keywords = "External visibility, Polygon, Shortest visible line segment, Weak visibility",
author = "Bhattacharya, {Binay K.} and Asish Mukhopadhyay and Godfried Toussaint",
year = "1999",
month = "1",
day = "1",
doi = "10.1142/S0218195999000078",
language = "English (US)",
volume = "9",
pages = "81--96",
journal = "International Journal of Computational Geometry and Applications",
issn = "0218-1959",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

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

AU - Bhattacharya, Binay K.

AU - Mukhopadhyay, Asish

AU - Toussaint, Godfried

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

KW - External visibility

KW - Polygon

KW - Shortest visible line segment

KW - Weak visibility

UR - http://www.scopus.com/inward/record.url?scp=0033484876&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033484876&partnerID=8YFLogxK

U2 - 10.1142/S0218195999000078

DO - 10.1142/S0218195999000078

M3 - Article

AN - SCOPUS:0033484876

VL - 9

SP - 81

EP - 96

JO - International Journal of Computational Geometry and Applications

JF - International Journal of Computational Geometry and Applications

SN - 0218-1959

IS - 1

ER -