Minimum r-star cover of class-3 orthogonal polygons
From MaRDI portal
Recommendations
- Linear-time 3-approximation algorithm for the \(r\)-star covering problem
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
- Note on covering monotone orthogonal polygons with star-shaped polygons
- Covering orthogonal polygons with star polygons: The perfect graph approach
- On covering orthogonal polygons with star-shaped polygons
Cites work
- Corrigendum to ``Note on covering monotone orthogonal polygons
- Covering orthogonal polygons with star polygons: The perfect graph approach
- Decomposing a Polygon into Simpler Components
- scientific article; zbMATH DE number 3825165 (Why is no real title available?)
- Linear-time 3-approximation algorithm for the \(r\)-star covering problem
- Note on covering monotone orthogonal polygons with star-shaped polygons
- On covering orthogonal polygons with star-shaped polygons
- Orthogonally convex covering of orthogonal polygons without holes
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Traditional Galleries Require Fewer Watchmen
Cited in
(6)- On covering orthogonal polygons with star-shaped polygons
- Note on covering monotone orthogonal polygons with star-shaped polygons
- On orthogonally guarding orthogonal polygons with bounded treewidth
- Linear-time 3-approximation algorithm for the \(r\)-star covering problem
- Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem
- Covering orthogonal polygons with star polygons: The perfect graph approach
This page was built for publication: Minimum \(r\)-star cover of class-3 orthogonal polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946065)