File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Vigneron, Antoine
- Geometric Algorithms Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons
- Author(s)
- Bae, Sang Won, Shin, Chan-Su, Vigneron, Antoine
- Issued Date
- 2016-04-13
- Citation
- LATIN 2016 (12th Latin American Theoretical Informatics Symposium), pp.110 - 122
- Abstract
- We establish tight bounds for beacon-based coverage problems. In particular, we show that (Formula Presented) 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 (Formula Presented). We also present an optimal linear-time algorithm for computing the beacon kernel of P.
- Publisher
- LATIN 2016 (12th Latin American Theoretical Informatics Symposium)
- ISSN
- 0302-9743
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.