The following pages link to (Q4038729):
Displayed 17 items.
- How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- Illuminating labyrinths. (Q1428567) (← links)
- Illuminating disjoint line segments in the plane (Q1434256) (← links)
- Tight bounds for conflict-free chromatic guarding of orthogonal art galleries (Q1615774) (← links)
- Guarding disjoint triangles and claws in the plane (Q1873155) (← links)
- Generalized guarding and partitioning for rectilinear polygons (Q1917042) (← links)
- Vertex-to-point conflict-free chromatic guarding is NP-hard (Q2154089) (← links)
- Clearing an orthogonal polygon to find the evaders (Q2210525) (← links)
- Covering orthogonal polygons with sliding \(k\)-transmitters (Q2310756) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (Q2945667) (← links)
- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
- On Some City Guarding Problems (Q3511372) (← links)
- Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
- The dispersive art gallery problem (Q6092310) (← links)