Open Guard Edges and Edge Guards in Simple Polygons

DOI10.1007/978-3-642-34191-5_5zbMath1374.68671OpenAlexW1923591223MaRDI QIDQ4899264

Andrew Winslow, Godfried T. Toussaint, 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

illuminationvisibilityart gallerymobile guards

Mathematics Subject Classification ID

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

Related Items (1)

Starshaped sets

Cites Work

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

This page was built for publication: Open Guard Edges and Edge Guards in Simple Polygons