✦ LIBER ✦

Empty Convex Hexagons in Planar Point Sets

✍ Scribed by Tobias Gerken

Publisher: Springer
Year: 2007
Tongue: English
Weight: 946 KB
Volume: 39
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-007-9018-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting convex k-gons in planar point s

Counting convex k-gons in planar point sets

✍ Günther Rote; Gerhard Woeginger 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 283 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

Convex independent sets and 7-holes in r

Convex independent sets and 7-holes in restricted planar point sets

✍ Pavel Valtr 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 955 KB

Finding Sets of Points without Empty Con

Finding Sets of Points without Empty Convex 6-Gons

✍ Mark Overmars 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 718 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)

New proofs about the number of empty con

New proofs about the number of empty convex 4-gons and 5-gons in a planar point set

✍ Yatao Du; Ren Ding 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 162 KB