Open guard edges and edge guards in simple polygons

DOI10.1007/978-3-642-34191-5_5MaRDI QIDQ4899264zbMATH OpenOpenAlexFDO

Authors Godfried Toussaint, Andrew Winslow, Csaba D. Tóth

Publication date 7 January 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34191-5_5

zbMATH Keywords

visibilityart galleryilluminationmobile guards

Mathematics Subject Classification ID

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

Recommendations

• On the number of guard edges of a polygon
• EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
• Edge guards for the fortress problem
• Edge guards in rectilinear polygons
• Tight bounds for the number of edge guards for spiral polygons

Cites work

• A combinatorial theorem in plane geometry
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Fast computation of shortest watchman routes in simple polygons
• Finding the shortest boundary guard of a simple polygon
• Galleries need fewer mobile guards: A variation on Chvatal's theorem
• On the number of guard edges of a polygon
• Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
• Optimally computing a shortest weakly visible line segment inside a simple polygon
• Visibility between two edges of a simple polygon

Cited in

(4)

• On the number of guard edges of a polygon
• EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
• A counterexample for the sufficiency of edge guards in star polygons
• Starshaped sets

This page was built for publication: Open guard edges and edge guards in simple polygons

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