The following pages link to Hiding people in polygons (Q1122366):
Displayed 18 items.
- Guarding polyhedral terrains (Q676572) (← links)
- On recognizing and characterizing visibility graphs of simple polygons (Q677018) (← links)
- Characterizing and recognizing weak visibility polygons (Q686142) (← links)
- Hiding points in arrangements of segments (Q1356667) (← links)
- FO model checking on geometric graphs (Q1631773) (← links)
- Isomorphism of spiral polygons (Q1816417) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- Negative results on characterizing visibility graphs (Q1900990) (← links)
- Meeting in a polygon by anonymous oblivious robots (Q2204780) (← links)
- Covering grids and orthogonal polygons with periscope guards (Q2365810) (← links)
- Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- (Q3301019) (← links)
- (Q5111878) (← links)
- On Colourability of Polygon Visibility Graphs (Q5136313) (← links)
- Inapproximability of finding maximum hidden sets on polygons and terrains (Q5959557) (← links)
- On colourability of polygon visibility graphs (Q6181985) (← links)