Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6868476 | Computational Geometry | 2018 | 21 Pages |
Abstract
For monotone orthogonal polygons with n vertices we show that for k=1 and for even k, every such polygon can be illuminated with ânâ22k+4âk-modems, while for odd kâ¥3, ânâ22k+6âk-modems are always sufficient. Further, by presenting according examples of monotone orthogonal polygons, we show that both bounds are tight.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Oswin Aichholzer, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber,