非表示:
キーワード:
Computer Science, Computational Geometry, cs.CG
要旨:
We consider a variant of the Art Gallery Problem, where a polygonal region is
to be covered with light sources, with light fading over distance. We describe
two practical algorithms, one based on a discrete approximation, and another
based on nonlinear programming by means of simplex partitioning strategies. For
the case where the light positions are given, we describe a fully
polynomial-time approximation scheme. For both algorithms we present an
experimental evaluation.
