Pages that link to "Item:Q715003"
From MaRDI portal
The following pages link to The art gallery theorem for polyominoes (Q715003):
Displaying 15 items.
- Guarding polyominoes, polycubes and polyhypercubes (Q322213) (← links)
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices (Q456117) (← links)
- Perfect graphs and guarding rectilinear art galleries (Q2249473) (← links)
- Guarding monotone art galleries with sliding cameras in linear time (Q2363353) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- Art gallery problem with rook and queen vision (Q2657110) (← links)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← 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)
- The Martin Gardner Polytopes (Q3304739) (← links)
- Art Gallery Problems for Convex Nested Polygons (Q4367047) (← links)
- (Q4673506) (← links)
- The smallest art gallery not guarded by every third vertex (Q5243819) (← links)
- The dispersive art gallery problem (Q6092310) (← links)
- Ortho-unit polygons can be guarded with at most \(\left\lfloor \frac{n-4}{8} \right\rfloor\) guards (Q6661734) (← links)