Guarding a Polygon Without Losing Touch

DOI10.1007/978-3-030-54921-3_6OpenAlexW3025290045MaRDI QIDQ5100952

Barath Ashok, Sridhar Ragupathi, Aditya Mehekare, Suman Sourav, Srikkanth Ramachandran, John E. Augustine

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.05601

zbMATH Keywords

visibilityart gallery problemmobile agentsswarm roboticsline of sight communication

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulating a simple polygon in linear time
• A short proof of Chvatal's Watchman Theorem
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
• A combinatorial theorem in plane geometry
• Art gallery theorems for guarded guards.
• Multi-agent deployment for visibility coverage in polygonal environments with holes
• Exploring and Triangulating a Region by a Swarm of Robots
• Computational complexity of art gallery problems
• Triangulating a polygon in parallel
• Visibility Algorithms in the Plane
• A general lower bound for collaborative tree exploration
• Inapproximability results for guarding polygons and terrains

This page was built for publication: Guarding a Polygon Without Losing Touch