Recommendations
- GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
- Guarding in a simple polygon
- Guarding a Polygon Without Losing Touch
- Protecting regular polygons
- Guarding Exterior Region of a Simple Polygon
- scientific article; zbMATH DE number 4060719
- Guarding polyhedral terrains
- Guarding disjoint orthogonal polygons in the plane
- Guarding thin orthogonal polygons is hard
- Edge guards in rectilinear polygons
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- A combinatorial theorem in plane geometry
- Almost optimal set covers in finite VC-dimension
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- An efficient algorithm for guard placement in polygons with holes
- Approximation algorithms for art gallery problems in polygons
- Automata, Languages and Programming
- Guarding galleries and terrains
- Polygon guarding with orientation
- Some NP-hard polygon decomposition problems
- Vertex guarding in weak visibility polygons
Cited in
(13)- A randomized art-gallery algorithm for sensor placement
- \(\Gamma\)-guarding of othogonal polygons
- scientific article; zbMATH DE number 2079328 (Why is no real title available?)
- Vertex guarding for dynamic orthogonal art galleries
- GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
- Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations
- Finding the \(\Theta \)-guarded region
- scientific article; zbMATH DE number 4060719 (Why is no real title available?)
- Polygon guarding with orientation
- Improved Bounds for Wireless Localization
- GUARDING RECTANGULAR PARTITIONS
- Guarding in a simple polygon
- On the camera placement problem
This page was built for publication: Polygon guarding with orientation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340539)