The following pages link to Guarding galleries and terrains (Q845875):
Displaying 21 items.
- Polygon guarding with orientation (Q340539) (← links)
- Minimum covering with travel cost (Q454247) (← links)
- A nearly optimal algorithm for covering the interior of an art gallery (Q632590) (← links)
- Link distance and shortest path problems in the plane (Q634253) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- The VC-dimension of visibility on the boundary of monotone polygons (Q1630914) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic (Q2322749) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Multi-agent deployment for visibility coverage in polygonal environments with holes (Q2904000) (← links)
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659) (← links)
- Universal Guard Problems (Q3177901) (← links)
- Towards Optimal Positioning of Surveillance UGVs (Q3589747) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- (Q5115778) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- Topological art in simple galleries (Q6204773) (← links)
