Polygon guarding with orientation

DOI10.1016/j.comgeo.2016.07.004zbMath1357.65027OpenAlexW2496334023MaRDI QIDQ340539

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

zbMATH Keywords

algorithmvisibilityart gallerypolygon guarding

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Polygon guarding with orientation

Cites Work

• Unnamed Item
• Unnamed Item
• Polygon guarding with orientation
• Guarding galleries and terrains
• Approximation algorithms for art gallery problems in polygons
• An efficient algorithm for guard placement in polygons with holes
• 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
• Some NP-hard polygon decomposition problems
• Vertex Guarding in Weak Visibility Polygons
• Automata, Languages and Programming

This page was built for publication: Polygon guarding with orientation