✦ LIBER ✦

An efficient algorith for determining the convex hull of a finite planar set

✍ Scribed by R.L. Graham

Book ID: 113161697
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 208 KB
Volume: 1
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(72)90045-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 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

An efficient algorithm for finding the m

An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane

✍ Naoki Makimoto; Ikuo Nakagawa; Akihisa Tamura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB

An ANSI C program to determine in expect

An ANSI C program to determine in expected linear time the vertices of the convex hull of a set of planar points

✍ Brett J Larkin 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 671 KB

An optimal real time algorithm for deter

An optimal real time algorithm for determine the convex hull of a set of points in a plane

✍ Z.Q. Wang; L.J. Xiao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Based on the properties of star polygon and that the convex polygon is a special kind of star polygon, with the star point as the origin and the two lines respectively parallel to the x-axis and y-axis as coordinate axis, a relative coordinate system is built and the planar area is divided into four