✦ LIBER ✦

An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull

✍ Scribed by Dulá, J. H.; Helgason, R. V.; Venugopal, N.

Book ID: 121873001
Publisher: Operations Research Society of America
Year: 1998
Tongue: English
Weight: 288 KB
Volume: 10
Category: Article
ISSN: 0899-1499
DOI: 10.1287/ijoc.10.3.323

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Algorithms for the Frame of a Finitely G

Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron

✍ Dulá, José H.; López, Francisco J. 📂 Article 📅 2006 🏛 Operations Research Society of America 🌐 English ⚖ 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

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

An efficient algorith for determining th

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

✍ R.L. Graham 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 208 KB