# Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons

Handle URI:
http://hdl.handle.net/10754/622262
Title:
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
Authors:
Bae, Sang Won; Shin, Chan-Su; Vigneron, Antoine E. ( 0000-0003-3586-3431 )
Abstract:
We establish tight bounds for beacon-based coverage problems. In particular, we show that $$\lfloor \frac{n}{6} \rfloor$$⌊n6⌋ 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$$⌊n+48⌋. We also present an optimal linear-time algorithm for computing the beacon kernel of P.
KAUST Department:
Visual Computing Center (VCC)
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.
Publisher:
Journal:
LATIN 2016: Theoretical Informatics
Conference/Event name:
12th Latin American Symposium on Theoretical Informatics, LATIN 2016
Issue Date:
21-Mar-2016
DOI:
10.1007/978-3-662-49529-2_9
Type:
Conference Paper
ISSN:
0302-9743; 1611-3349
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
Appears in Collections:
Conference Papers; Visual Computing Center (VCC)

DC FieldValue Language
dc.contributor.authorBae, Sang Wonen
dc.contributor.authorShin, Chan-Suen
dc.contributor.authorVigneron, Antoine E.en
dc.date.accessioned2017-01-02T08:42:41Z-
dc.date.available2017-01-02T08:42:41Z-
dc.date.issued2016-03-21en
dc.identifier.citationBae 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.en
dc.identifier.issn0302-9743en
dc.identifier.issn1611-3349en
dc.identifier.doi10.1007/978-3-662-49529-2_9en
dc.identifier.urihttp://hdl.handle.net/10754/622262-
dc.description.abstractWe establish tight bounds for beacon-based coverage problems. In particular, we show that $$\lfloor \frac{n}{6} \rfloor$$⌊n6⌋ 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$$⌊n+48⌋. We also present an optimal linear-time algorithm for computing the beacon kernel of P.en
dc.description.sponsorshipWork 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 fundingen
dc.titleTight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygonsen
dc.typeConference Paperen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.identifier.journalLATIN 2016: Theoretical Informaticsen
dc.conference.date2016-04-11 to 2016-04-15en
dc.conference.name12th Latin American Symposium on Theoretical Informatics, LATIN 2016en