Guarding a Polygon Without Losing Touch

DOI10.1007/978-3-030-54921-3_6MaRDI QIDQ5100952zbMATH OpenOpenAlexFDO

Authors Barath Ashok, Aditya Mehekare, Sridhar Ragupathi, Srikkanth Ramachandran, Suman Sourav, John 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

art gallery problemline of sight communicationmobile agentsswarm roboticsvisibility

Mathematics Subject Classification ID

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

Recommendations

• Polygon guarding with orientation
• Distributed coverage of nonconvex environments
• Connecting guards with minimum Steiner points inside simple polygons
• Cooperative guards in art galleries
• Polygon-constrained motion planning problems

Cites work

• A combinatorial theorem in plane geometry
• A general lower bound for collaborative tree exploration
• A short proof of Chvatal's Watchman Theorem
• An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons
• Art gallery theorems for guarded guards.
• Computational complexity of art gallery problems
• Computational geometry. Algorithms and applications.
• Exploring and triangulating a region by a swarm of robots
• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 2040955 (Why is no real title available?)
• scientific article; zbMATH DE number 1424310 (Why is no real title available?)
• scientific article; zbMATH DE number 969102 (Why is no real title available?)
• Inapproximability results for guarding polygons and terrains
• Multi-agent deployment for visibility coverage in polygonal environments with holes
• Triangulating a polygon in parallel
• Triangulating a simple polygon in linear time
• Visibility Algorithms in the Plane

Cited in

(4)

• Polygon guarding with orientation
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
• scientific article; zbMATH DE number 177550 (Why is no real title available?)
• EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100952)