✦ LIBER ✦

Minimizing the Size of Vertexlights in Simple Polygons

✍ Scribed by Andreas Spillner; Hans-Dietrich Hecker

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 170 KB
Volume: 48
Category: Article
ISSN: 0044-3050
DOI: 10.1002/1521-3870(200204)48:3<447::aid-malq447>3.0.co;2-l

No coin nor oath required. For personal study only.

✦ Synopsis

We 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 .

📜 SIMILAR VOLUMES

On the minimality of polygon triangulati

On the minimality of polygon triangulation

✍ Chiuyuan Chen; Ruei-Chuan Chang 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 841 KB

Simple Polygons of Maximum Perimeter Con

Simple Polygons of Maximum Perimeter Contained in

✍ Charles Audet; Pierre Hansen; Frédéric Messine 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 281 KB

On the perimeters of simple polygons con

On the perimeters of simple polygons contained in a disk

✍ Zsolt Lángi 📂 Article 📅 2010 🏛 Springer Vienna 🌐 English ⚖ 176 KB

On the Morse index of minimal surfaces i

On the Morse index of minimal surfaces in ℝpwith polygonal boundaries

✍ Friedrich Sauvigny 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 874 KB

Computing a single cell in the overlay o

Computing a single cell in the overlay of two simple polygons

✍ Mark de Berg; Olivier Devillers; Katrin Dobrindt; Otfried Schwarzkopf 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 485 KB

This note combines the lazy randomized incremental construction scheme with the technique of "connectivity acceleration" to obtain an 0( n( log\* n)\*) time randomized algorithm to compute a single face in the overlay of two simple polygons in the plane. @

Finding the convex hull of a simple poly

Finding the convex hull of a simple polygon

✍ Ronald L Graham; F Frances Yao 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 400 KB