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
- 2019-07
- Citation
- COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.80, pp.40 - 52
- 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
- Elsevier BV
- ISSN
- 0925-7721
- Keyword (Author)
- Art gallery, Beacon, Algorithm
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.