✦ 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
DOI: 10.1007/s00454-008-9093-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Minimizing the Size of Vertexlights in S

Minimizing the Size of Vertexlights in Simple Polygons

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

Maximum-likelihood estimation of a senso

Maximum-likelihood estimation of a sensor configuration in a polygonal environment

✍ Haruo Takeda 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB 👁 1 views

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 in linear time

✍ S.Y. Shin; T.C. Woo 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 405 KB

Finding a shortest diagonal of a simple

Finding a shortest diagonal of a simple polygon in linear time

✍ John Hershberger; Subhash Suri 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 792 KB