@article{4118,
  abstract     = {A rectilinear polygon can be viewed as an art gallery room whose walls meet at right angles. An algorithm is presented that stations guards in such a room so that every interior point is visible to some guard. The algorithm partitions the polygon into L-shaped pieces, a subclass of star-shaped pieces, and locates one guard within each kernel. The algorithm runs in O(n log n) time in the worst case for a polygon of n vertices.},
  author       = {Edelsbrunner, Herbert and O'Rourke, Joseph and Welzl, Emo},
  issn         = {0734-189X},
  journal      = {Computer Vision, Graphics, and Image Processing},
  number       = {2},
  pages        = {167 -- 176},
  publisher    = {Elsevier},
  title        = {{Stationing guards in rectilinear art galleries}},
  doi          = {10.1016/S0734-189X(84)80041-9},
  volume       = {27},
  year         = {1984},
}