COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

DOI10.1142/S0218195999000078zbMath1020.52014MaRDI QIDQ4513233

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

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

polygonweak visibilityexternal visibilityshortest visible line segment

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Optimally computing a shortest weakly visible line segment inside a simple polygon

Cites Work

• Computing shortest transversals
• On common transversals
• Finding transversals for sets of simple geometric figures
• Two counterexamples concerning transversals for convex subsets of the plane
• A simple algorithm for determining the envelope of a set of lines
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment

This page was built for publication: COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON