Guarding in a simple polygon

DOI10.1016/S0020-0190(00)00100-9zbMath1003.68172MaRDI QIDQ1607056

Chuan Yi Tang, Bor-Kuan Lu, Fang-Rong Hsu

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

art gallery problems

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• An Almost Linear Time Algorithm for Generalized Matrix Searching
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
• An optimal algorithm for detecting weak visibility of a polygon

This page was built for publication: Guarding in a simple polygon