<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06098086</id>
  <dt>j</dt>
  <an>06098086</an>
  <augroup>
    <au>Iwerks, Justin</au>
    <au>Mitchell, Joseph S.B.</au>
  </augroup>
  <ti>The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices.</ti>
  <so>Inf. Process. Lett. 112, No. 20, 778-782 (2012).</so>
  <py>2012</py>
  <pu>Elsevier Sciences Publishers (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>computational geometry</ut>
    <ut>art gallery theorem</ut>
    <ut>visibility coverage</ut>
    <ut>guard number</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.ipl.2012.07.005</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We present an art gallery theorem for simple polygons having $n$ vertices in terms of the number, $r$, of reflex vertices and the number, $c$, of convex vertices ($n=r+c$). Tight combinatorial bounds have previously been shown when $0\leq r\leq \lfloor\frac{c}{2}\rfloor$ and when $r\geq 5c - 12$. We give a lower bound construction that matches the $\lfloor\frac{n}{3}\rfloor$ sufficiency condition from the traditional art gallery theorem when $\lfloor\frac{c}{2}\rfloor<r<5c-12$, thereby providing tight combinatorial bounds for all $r$ and $c\geq 3$.</ab>
    <rv></rv>
  </abgroup>
</item>