An optimal algorithm for detecting weak visibility of a polygon
From MaRDI portal
Publication:5375451
DOI10.1109/12.59852zbMATH Open1395.68316OpenAlexW2164507028WikidataQ62037517 ScholiaQ62037517MaRDI QIDQ5375451FDOQ5375451
Authors: Jörg-Rüdiger Sack, Subhash Suri 
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.59852
Cited In (17)
- Title not available (Why is that?)
- Finding all weakly-visible chords of a polygon in linear time
- Approximability of guarding weak visibility polygons
- COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON
- Weak visibility counting in simple polygons
- Computing a shortest watchman path in a simple polygon in polynomial-time
- AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
- On the number of guard edges of a polygon
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
- An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
- Optimally computing a shortest weakly visible line segment inside a simple polygon
- A nearly optimal sensor placement algorithm for boundary coverage
- An optimal visibility graph algorithm for triangulated simple polygons
- Finding the shortest boundary guard of a simple polygon
- Guarding in a simple polygon
- LR-visibility in polygons
This page was built for publication: An optimal algorithm for detecting weak visibility of a polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375451)
