✦ LIBER ✦

On the perimeters of simple polygons contained in a disk

✍ Scribed by Zsolt Lángi

Publisher: Springer Vienna
Year: 2010
Tongue: English
Weight: 176 KB
Volume: 162
Category: Article
ISSN: 0026-9255
DOI: 10.1007/s00605-010-0214-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Large triangles contained in the unit di

Large triangles contained in the unit disk of a Minkowski plane

✍ Ewa Fabińska; Marek Lassak 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 347 KB

On finding the convex hull of a simple p

On finding the convex hull of a simple polygon

✍ D. T. Lee 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 478 KB

On the compression of a simple viscoelas

On the compression of a simple viscoelastic disk

✍ J.M. Chudobiak; V.V. Neis; K.B.M. Nambudiripad 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 158 KB

A note on the combinatorial structure of

A note on the combinatorial structure of the visibility graph in simple polygons

✍ L. Prasad; S.S. Iyengar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 954 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. @