✦ LIBER ✦

Finding the closest point to the origin in the convex hull of a discrete set of points

✍ Scribed by Hanif D. Sherali; Gyunghyun Choi

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 788 KB
Volume: 20
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(93)90080-3

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

Constructing the convex hull of a partia

Constructing the convex hull of a partially sorted set of points

✍ Michael T. Goodrich 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 802 KB

On the approximation of convex hulls of

On the approximation of convex hulls of finite grid point sets

✍ Reinhard Klette 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 220 KB

Construction of the convex hull of a fin

Construction of the convex hull of a finite set of points when the computations are approximate

✍ O.L. Chernykh 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 714 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 relaxation method of finding the com

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

✍ L.M. Bregman 📂 Article 📅 1967 🏛 Elsevier Science ⚖ 824 KB