Pages that link to "Item:Q3063659"
From MaRDI portal
The following pages link to LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS (Q3063659):
Displaying 12 items.
- Minimum covering with travel cost (Q454247) (← links)
- A nearly optimal algorithm for covering the interior of an art gallery (Q632590) (← links)
- The art gallery theorem for polyominoes (Q715003) (← links)
- Facets for art gallery problems (Q747627) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Altitude terrain guarding and guarding uni-monotone polygons (Q2331221) (← links)
- Blocking visibility for points in general position (Q2391198) (← links)
- Guarding orthogonal art galleries with sliding cameras (Q2401332) (← links)
- Universal Guard Problems (Q3177901) (← links)
- Algorithm 966 (Q5270778) (← links)
- Searching a Polygonal Region by Two Guards (Q5425439) (← links)
- A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)