Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
dc.contributor.author | Bae, Sang Won | |
dc.contributor.author | Shin, Chan-Su | |
dc.contributor.author | Vigneron, Antoine E. | |
dc.date.accessioned | 2017-01-02T08:42:41Z | |
dc.date.available | 2017-01-02T08:42:41Z | |
dc.date.issued | 2016-03-22 | |
dc.identifier.citation | Bae SW, Shin C-S, Vigneron A (2016) Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons. Lecture Notes in Computer Science: 110–122. Available: http://dx.doi.org/10.1007/978-3-662-49529-2_9. | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.issn | 1611-3349 | |
dc.identifier.doi | 10.1007/978-3-662-49529-2_9 | |
dc.identifier.uri | http://hdl.handle.net/10754/622262 | |
dc.description.abstract | We establish tight bounds for beacon-based coverage problems. In particular, we show that $\lfloor \frac{n}{6} \rfloor$ beacons are always sufficient and sometimes necessary to cover a simple rectilinear polygon P with n vertices. When P is monotone and rectilinear, we prove that this bound becomes $\lfloor \frac{n+4}{8} \rfloor$ . We also present an optimal linear-time algorithm for computing the beacon kernel of P. | |
dc.description.sponsorship | Work by S.W.Bae was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (2013R1A1A1A05006927) and by the Ministry of Education (2015R1D1A1A01057220). Work by C.-S. Shin was supported by Research Grant of Hankuk University of Foreign Studies. Work by A. Vigneron was supported by KAUST base funding | |
dc.publisher | Springer Nature | |
dc.title | Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons | |
dc.type | Conference Paper | |
dc.contributor.department | Computer Science Program | |
dc.contributor.department | Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division | |
dc.contributor.department | Visual Computing Center (VCC) | |
dc.identifier.journal | LATIN 2016: Theoretical Informatics | |
dc.conference.date | 2016-04-11 to 2016-04-15 | |
dc.conference.name | 12th Latin American Symposium on Theoretical Informatics, LATIN 2016 | |
dc.conference.location | Ensenada, MEX | |
dc.contributor.institution | Department of Computer Science, Kyonggi University, Suwon, South Korea | |
dc.contributor.institution | Division of Computer and Electronic Systems Engineering, Hankuk University of Foreign Studies, Yongin, South Korea | |
kaust.person | Vigneron, Antoine E. | |
dc.date.published-online | 2016-03-22 | |
dc.date.published-print | 2016 |
This item appears in the following Collection(s)
-
Conference Papers
-
Computer Science Program
For more information visit: https://cemse.kaust.edu.sa/cs -
Visual Computing Center (VCC)
-
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
For more information visit: https://cemse.kaust.edu.sa/