Pages that link to "Item:Q1279960"
From MaRDI portal
The following pages link to Guarding galleries where no point sees a small area. (Q1279960):
Displaying 20 items.
- A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
- VC-dimension of perimeter visibility domains (Q402367) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- A note on the perimeter of fat objects (Q709064) (← links)
- Guarding galleries and terrains (Q845875) (← links)
- Randomized query processing in robot path planning (Q1273861) (← links)
- Guarding galleries where every point sees a large area (Q1380500) (← links)
- The VC-dimension of visibility on the boundary of monotone polygons (Q1630914) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- On boundaries of highly visible spaces and applications (Q2368974) (← links)
- Berge's theorem, fractional Helly, and art galleries (Q2433698) (← links)
- The VC dimension of metric balls under Fréchet and Hausdorff distances (Q2665263) (← links)
- New Results on Visibility in Simple Polygons (Q3183466) (← links)
- Line-of-Sight Networks (Q3557508) (← links)
- SEARCHING A ROOM BY TWO GUARDS (Q4818565) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- (Q5088958) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- Guarding polyominoes under \(k\)-hop visibility (Q6547940) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)