✦ LIBER ✦

Counting convex k-gons in planar point sets

✍ Scribed by Günther Rote; Gerhard Woeginger

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 283 KB
Volume: 41
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90178-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting k-subsets and convex k-gons in

Counting k-subsets and convex k-gons in the plane

✍ Günter Rote; Gerhard Woeginger; Binhai Zhu; Zhengyan Wang 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 335 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)

The Blaschke-Steinhardt point of a plana

The Blaschke-Steinhardt point of a planar convex set

✍ M.J. Kaiser 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Counting k-projections of a point set

✍ Steven S Skiena 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Fixed point theorems for compact multima

Fixed point theorems for compact multimaps on almost -convex sets in generalized convex spaces

✍ Tian-Yuan Kuo; Jyh-Chung Jeng; Young-Ye Huang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Generalized saddle points theorems for s

Generalized saddle points theorems for set-valued mappings in locally generalized convex spaces

✍ Qing-bang Zhang; Ming-jie Liu; Cao-zong Cheng 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 509 KB