An optimal algorithm for detecting weak visibility of a polygon
From MaRDI portal
Publication:5375451
DOI10.1109/12.59852zbMath1395.68316OpenAlexW2164507028WikidataQ62037517 ScholiaQ62037517MaRDI QIDQ5375451
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
Related Items (9)
Optimally computing a shortest weakly visible line segment inside a simple polygon ⋮ Finding all weakly-visible chords of a polygon in linear time ⋮ Computing a shortest watchman path in a simple polygon in polynomial-time ⋮ A nearly optimal sensor placement algorithm for boundary coverage ⋮ LR-visibility in polygons ⋮ An \(O(n\log n)\) algorithm for computing the link center of a simple polygon ⋮ Finding the shortest boundary guard of a simple polygon ⋮ On the number of guard edges of a polygon ⋮ Guarding in a simple polygon
This page was built for publication: An optimal algorithm for detecting weak visibility of a polygon