Open guard edges and edge guards in simple polygons
From MaRDI portal
Publication:4899264
DOI10.1007/978-3-642-34191-5_5zbMATH Open1374.68671OpenAlexW1923591223MaRDI QIDQ4899264FDOQ4899264
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
Recommendations
Cites Work
- A combinatorial theorem in plane geometry
- Fast computation of shortest watchman routes in simple polygons
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
- Visibility between two edges of a simple polygon
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- On the number of guard edges of a polygon
- Finding the shortest boundary guard of a simple polygon
Cited In (4)
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)