An optimal algorithm for detecting weak visibility of a polygon

DOI10.1109/12.59852MaRDI QIDQ5375451zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

Cited in

(17)

• An Instance-Optimal Algorithm for Bichromatic Rectangular Visibility.
• Guarding in a simple polygon
• An optimal visibility graph algorithm for triangulated simple polygons
• A nearly optimal sensor placement algorithm for boundary coverage
• AN OPTIMAL PARALLEL ALGORITHM FOR DETECTING WEAK VISIBILITY OF A SIMPLE POLYGON
• Approximability of guarding weak visibility polygons
• LR-visibility in polygons
• Computing a shortest watchman path in a simple polygon in polynomial-time
• scientific article; zbMATH DE number 1102588 (Why is no real title available?)
• On the number of guard edges of a polygon
• Finding all weakly-visible chords of a polygon in linear time
• Finding the shortest boundary guard of a simple polygon
• An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
• Weak visibility counting in simple polygons
• 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
• COMPUTING A SHORTEST WEAKLY EXTERNALLY VISIBLE LINE SEGMENT FOR A SIMPLE POLYGON

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)