✦ LIBER ✦

On pseudo-convex partitions of a planar point set

✍ Scribed by Bhattacharya, Bhaswar B.; Das, Sandip

Book ID: 121228971
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 542 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.07.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On empty convex polygons in a planar poi

On empty convex polygons in a planar point set

✍ Rom Pinchasi; Radoš Radoičić; Micha Sharir 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 400 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

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

A new algorithm for computing the convex

A new algorithm for computing the convex hull of a planar point set

✍ Guang-hui Liu; Chuan-bo Chen 📂 Article 📅 2007 🏛 SP Zhejiang University Press 🌐 English ⚖ 284 KB

Minimization of convex functions on the

Minimization of convex functions on the convex hull of a point set

✍ Nikolai D. Botkin; Josef Stoer 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 186 KB