Pages that link to "Item:Q3315525"
From MaRDI portal
The following pages link to Traditional Galleries Require Fewer Watchmen (Q3315525):
Displaying 50 items.
- How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
- Partitioning orthogonal polygons into \(\leq 8\)-vertex pieces, with application to an art gallery theorem (Q340521) (← links)
- The orthogonal art gallery theorem with constrained guards (Q510528) (← links)
- A note on the contractions for orthogonal polygons (Q686493) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- An alternative proof of the rectilinear art gallery theorem (Q795339) (← links)
- On partitioning rectilinear polygons into star-shaped polygons (Q808305) (← links)
- Minimum k-partitioning of rectilinear polygons (Q912618) (← links)
- Guarding curvilinear art galleries with vertex or point guards (Q924067) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Improved bounds for wireless localization (Q970612) (← links)
- An ``Art Gallery Theorem'' for pyramids (Q989466) (← links)
- On gallery watchmen in grids (Q1087018) (← links)
- Hiding people in polygons (Q1122366) (← links)
- On covering orthogonal polygons with star-shaped polygons (Q1193845) (← links)
- Edge guards in rectilinear polygons (Q1272313) (← links)
- The prison yard problem (Q1340137) (← links)
- Converting triangulations to quadrangulations (Q1384213) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Art gallery theorems for guarded guards. (Q1410595) (← links)
- Orthogonal polygon reconstruction from stabbing information (Q1614070) (← links)
- Combinatorics and complexity of guarding polygons with edge and point 2-transmitters (Q1699283) (← links)
- Mobile versus point guards (Q1716007) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- On separating two simple polygons by a single translation (Q1825657) (← links)
- Generalized guarding and partitioning for rectilinear polygons (Q1917042) (← links)
- New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision (Q2044958) (← links)
- Edge guards for polyhedra in three-space (Q2123291) (← links)
- Perfect graphs and guarding rectilinear art galleries (Q2249473) (← links)
- Tight bounds for beacon-based coverage in simple rectilinear polygons (Q2330037) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- Algorithms for art gallery illumination (Q2397430) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- Orthogonal art galleries with interior walls (Q2499578) (← links)
- Minimum r-Star Cover of Class-3 Orthogonal Polygons (Q2946065) (← links)
- On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
- On Some City Guarding Problems (Q3511372) (← links)
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear (Q3512447) (← links)
- Improved Bounds for Wireless Localization (Q3512449) (← links)
- ENERGY-AWARE STAGE ILLUMINATION (Q3521594) (← links)
- A Short Proof of the Rectilinear Art Gallery Theorem (Q3715128) (← links)
- Illumination of Orthogonal Polygons with Orthogonal Floodlights (Q4513201) (← links)
- An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← links)
- Translating polygons with applications to hidden surface removal (Q5056092) (← links)
- Two-floodlight illumination of convex polygons (Q5057422) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
- A simple proof of the rectilinear art gallery theorem (Q5184921) (← links)
- Minimizing visible edges in polyhedra (Q6083182) (← links)
- The dispersive art gallery problem (Q6092310) (← links)