✦ LIBER ✦

Isodiametric Problems for Polygons

✍ Scribed by Michael J. Mossinghoff

Publisher: Springer
Year: 2006
Tongue: English
Weight: 206 KB
Volume: 36
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-006-1238-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The isodiametric problem for lattice-poi

The isodiametric problem for lattice-point-free convex sets

✍ M. A. Hernández Cifre; S. Vassallo 📂 Article 📅 2007 🏛 Akadmiai Kiad 🌐 English ⚖ 473 KB

The isodiametric problem with lattice-po

The isodiametric problem with lattice-point constraints

✍ M. A. Hernández Cifre; A. Schürmann; F. Vallentin 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 127 KB

Extremal problems for convex polygons

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

Some extremal problems for circular poly

Some extremal problems for circular polygons

✍ A. Yu. Solynin 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 315 KB

Parallel algorithms for shortest path pr

Parallel algorithms for shortest path problems in polygons

✍ Hossam ElGindy; Michael Goodrich 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 665 KB

Two NP-Hard Art-Gallery Problems for Ort

Two NP-Hard Art-Gallery Problems for Ortho-Polygons

✍ Dietmar Schuchardt; Hans-Dietrich Hecker 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 292 KB

## Abstract D. T. Lee and A. K. Lin [2] proved that VERTEX‐GUARDING and POINT‐GUARDING are NP‐hard for simple polygons. We prove that those problems are NP‐hard for ortho‐polygons, too.