Back to matchesWe found a matchYour institution may have access to this item. Find your institution then sign in to continue.TitleMinimizing the Size of Vertexlights in Simple Polygons.AuthorsSpillner, Andreas; Hecker, Hans-DietrichAbstractWe show that given a simple Polygon P it is NP-hard to determine the smallest α ∈ [0, π] such that P can be illuminated by α-vertexlights, if we place exactly one α-vertexlight in each vertex of P.SubjectsPOLYGONS; GAUSS-Bonnet theorem; HEPTAGON; GEOMETRY; EUCLID'S elements; DISCRETE geometryPublicationMathematical Logic Quarterly, 2002, Vol 48, Issue 3, p447ISSN0942-5616Publication typeArticleDOI10.1002/1521-3870(200204)48:3<447::AID-MALQ447>3.0.CO;2-L