The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time O(log n) -approximation algorithm for placing as few guards as possible at vertices of a simple n-gon P, such that every point in P is visible to at least one of the guards. Ghosh also conjectured that this problem admits a polynomial-time algorithm with constant approximation ratio. Due to the centrality of guarding problems in the field of computational geometry, much effort has been invested throughout the years in trying to resolve this conjecture. Despite some progress (surveyed below), the conjecture remains unresolved to date. In this paper, we confirm the conjecture for the important case of weakly visible polygons, by presenting a (2 + ε) -approximation algorithm for guarding such a polygon using vertex guards. A simple polygon P is weakly visible if it has an edge e, such that every point in P is visible from some point on e. We also present a (2 + ε) -approximation algorithm for guarding a weakly visible polygon P, where guards may be placed anywhere on P’s boundary (except in the interior of the edge e). Finally, we present an O(1)-approximation algorithm for vertex guarding a polygon P that is weakly visible from a chord. Our algorithms are based on an in-depth analysis of the geometric properties of the regions that remain unguarded after placing guards at the vertices to guard the polygon’s boundary. Finally, our algorithms may become useful as part of the grand attempt of Bhattacharya et al. to prove the original conjecture, as their approach is based on partitioning the underlying simple polygon into a hierarchy of weakly visible polygons.
|عنوان منشور المضيف||Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Revised Selected Papers|
|المحررون||Christos Kaklamanis, Asaf Levin|
|ناشر||Springer Science and Business Media Deutschland GmbH|
|رقم المعيار الدولي للكتب (المطبوع)||9783030808785|
|المعرِّفات الرقمية للأشياء|
|حالة النشر||نُشِر - 2021|
|الحدث||18th International Workshop on Approximation and Online Algorithms, WAOA 2019 - Virtual, Online|
المدة: ٩ سبتمبر ٢٠٢٠ → ١٠ سبتمبر ٢٠٢٠
|الاسم||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|مستوى الصوت||12806 LNCS|
|رقم المعيار الدولي للدوريات (المطبوع)||0302-9743|
|رقم المعيار الدولي للدوريات (الإلكتروني)||1611-3349|
|!!Conference||18th International Workshop on Approximation and Online Algorithms, WAOA 2019|
|المدة||٩/٠٩/٢٠ → ١٠/٠٩/٢٠|
ملاحظة ببليوغرافيةFunding Information:
Keywords: Geometric optimization · Approximation algorithms · Visibility · Art gallery problems O. Filtser was supported by the Eric and Wendy Schmidt Fund for Strategic Innovation, by the Council for Higher Education of Israel, and by Ben-Gurion University of the Negev. M. Katz was supported by grant 1884/16 from the Israel Science Foundation.
© 2021, Springer Nature Switzerland AG.