✦ LIBER ✦

On empty convex polygons in a planar point set

✍ Scribed by Rom Pinchasi; Radoš Radoičić; Micha Sharir

Book ID: 108167153
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 400 KB
Volume: 113
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2005.03.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint empty convex polygons in planar

Disjoint empty convex polygons in planar point sets

✍ Attila Gulyás, Lázló Szabó 📂 Article 📅 2001 🏛 Birkhäuser-Verlag ⚖ 103 KB

Planar point sets with a small number of

Planar point sets with a small number of empty convex polygons

✍ Bárány, Imre; Valtr, Pável 📂 Article 📅 2004 🏛 Akadmiai Kiad 🌐 Hungarian ⚖ 303 KB

Counting convex polygons in planar point

Counting convex polygons in planar point sets

✍ Joseph S.B. Mitchell; Günter Rote; Gopalakrishnan Sundaram; Gerhard Woeginger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Empty Convex Hexagons in Planar Point Se

Empty Convex Hexagons in Planar Point Sets

✍ Tobias Gerken 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 946 KB

Empty convex polygons in almost convex s

Empty convex polygons in almost convex sets

✍ Pavel Valtr; Gábor Lippner; Gyula Károlyi 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 139 KB

The santalo point of a planar convex set

✍ M.J. Kaiser 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 505 KB

An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)