✦ LIBER ✦

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

✍ Scribed by Guang-hui Liu; Chuan-bo Chen

Book ID: 111840744
Publisher: SP Zhejiang University Press
Year: 2007
Tongue: English
Weight: 284 KB
Volume: 8
Category: Article
ISSN: 1009-3095
DOI: 10.1631/jzus.2007.a1210

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the convex hull of a set of po

Computing the convex hull of a set of points

✍ D.C.S. Allison; M.T. Noga 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 413 KB

CONVEX_HULL—A pascal program for determi

CONVEX_HULL—A pascal program for determining the convex hull for planar sets

✍ Jorge Kazuo Yamamoto 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 993 KB

A convex hull algorithm for planar simpl

A convex hull algorithm for planar simple polygons

✍ Marian Orlowski 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 470 KB

A reevaluation of an efficient algorithm

A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set

✍ Kenneth R. Anderson 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 381 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)

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