Polygon guarding with orientation
From MaRDI portal
Publication:340539
DOI10.1016/J.COMGEO.2016.07.004zbMATH Open1357.65027OpenAlexW2496334023MaRDI QIDQ340539FDOQ340539
Authors: Pratap Tokekar, Volkan Isler 
Publication date: 14 November 2016
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2016.07.004
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
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Almost optimal set covers in finite VC-dimension
- Title not available (Why is that?)
- Approximation algorithms for art gallery problems in polygons
- A combinatorial theorem in plane geometry
- Title not available (Why is that?)
- An efficient algorithm for guard placement in polygons with holes
- Polygon guarding with orientation
- An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
- Some NP-hard polygon decomposition problems
- Vertex guarding in weak visibility polygons
- Automata, Languages and Programming
- Guarding galleries and terrains
Cited In (13)
- A randomized art-gallery algorithm for sensor placement
- \(\Gamma\)-guarding of othogonal polygons
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Finding the \(\Theta \)-guarded region
- 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)
