Vertex pi-Floodlights

For every simple polygon $P$ with $n$ vertices, let $g(P)$ be the minimum number of aperture-$\pi$ floodlights, each placed at a vertex and oriented into $P$, whose illuminated regions cover $P$. Determine the tight value of $\max_P g(P)$ as a function of $n$.