Pages that link to "Item:Q4835529"
From MaRDI portal
The following pages link to Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons (Q4835529):
Displayed 10 items.
- How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- On boundaries of highly visible spaces and applications (Q2368974) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← 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)
- GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS (Q2999096) (← links)
- An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)