Guarding in a simple polygon

DOI10.1016/S0020-0190(00)00100-9MaRDI QIDQ1607056zbMATH OpenFDO

Authors B.-K. Lu, F. R. Hsu, Chuan Yi Tang

Publication date 25 July 2002

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

zbMATH Keywords

art gallery problems

Mathematics Subject Classification ID

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

Recommendations

• Finding the shortest boundary guard of a simple polygon
• EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
• Polygon guarding with orientation
• On the number of guard edges of a polygon
• Mobile versus point guards

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 753969 (Why is no real title available?)
• An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
• An Almost Linear Time Algorithm for Generalized Matrix Searching
• An optimal algorithm for detecting weak visibility of a polygon
• EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon

Cited in

(9)

• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
• An Efficient Algorithm for Mobile Guarded Guards in Simple Grids
• EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
• scientific article; zbMATH DE number 4060719 (Why is no real title available?)
• Polygon guarding with orientation
• GUARDING RECTANGULAR PARTITIONS
• Guarding Exterior Region of a Simple Polygon
• EFFICIENT ALGORITHMS FOR SOLVING DIAGONAL VISIBILITY PROBLEMS IN A SIMPLE POLYGON
• Finding the shortest boundary guard of a simple polygon

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1607056)