An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment

DOI10.1006/jagm.1993.1007zbMath0769.68121OpenAlexW2085681674MaRDI QIDQ4033762

Jeong-In Doh, Kyung-Yong Chwa

Publication date: 16 May 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1007

zbMATH Keywords

weakly visiblevisibility of a polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

Optimally computing a shortest weakly visible line segment inside a simple polygon ⋮ Finding all weakly-visible chords of a polygon in linear time ⋮ LR-visibility in polygons ⋮ Characterizing LR-visibility polygons and related problems ⋮ Finding the shortest boundary guard of a simple polygon ⋮ An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT ⋮ Guarding in a simple polygon ⋮ COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

This page was built for publication: An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment