𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple Polygons of Maximum Perimeter Contained in

✍ Scribed by Charles Audet; Pierre Hansen; Frédéric Messine


Publisher
Springer
Year
2008
Tongue
English
Weight
281 KB
Volume
41
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Minimizing the Size of Vertexlights in S
✍ Andreas Spillner; Hans-Dietrich Hecker 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB

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 .

Computing a single cell in the overlay o
✍ 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. @