Pages that link to "Item:Q1346129"
From MaRDI portal
The following pages link to An efficient algorithm for guard placement in polygons with holes (Q1346129):
Displaying 19 items.
- Polygon guarding with orientation (Q340539) (← links)
- A nearly optimal algorithm for covering the interior of an art gallery (Q632590) (← 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)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- Edge guards in rectilinear polygons (Q1272313) (← links)
- Optimum placement of guards (Q1328566) (← links)
- Illuminating disjoint line segments in the plane (Q1434256) (← links)
- Multiple-guard kernels of simple polygons (Q1818909) (← links)
- An algorithm for polygon placement using a bottom-left strategy (Q1847183) (← links)
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects (Q1860195) (← links)
- Guarding disjoint triangles and claws in the plane (Q1873155) (← links)
- Generalized guarding and partitioning for rectilinear polygons (Q1917042) (← links)
- Fast vertex guarding for polygons with and without holes (Q1931264) (← links)
- Multi-agent deployment for visibility coverage in polygonal environments with holes (Q2904000) (← links)
- (Q3795225) (← links)
- Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
- Illumination in the presence of opaque line segments in the plane (Q5959562) (← links)