✦ LIBER ✦

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

✍ Scribed by Naoki Makimoto; Ikuo Nakagawa; Akihisa Tamura

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 398 KB
Volume: 16
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(94)90019-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finding the closest point to the origin

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

✍ Hanif D. Sherali; Gyunghyun Choi 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 788 KB

On the boundary of a finite set of point

On the boundary of a finite set of points in the plane

✍ Václav Medek 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 485 KB

Efficiently Approximating the Minimum-Vo

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of

A criterion for the metrizability of a c

A criterion for the metrizability of a compact convex set in terms of the set of extreme points

✍ Brenda MacGibbon 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 416 KB

On the Number of Directions Determined b

On the Number of Directions Determined by a Set of Points in an Affine Galois Plane

✍ Tamás Szőnyi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 265 KB

In this paper the number of directions determined by a set of q&n points of AG(2, q) is studied. To such a set we associate a curve of degree n and show that its linear components correspond to points that can be added to the set without changing the set of determined directions. The existence of li

An algorithm for projective point matchi

An algorithm for projective point matching in the presence of spurious points

✍ Jason A. Denton; J. Ross Beveridge 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Point matching is the task of finding correspondences between two sets of points such that the two sets of points are aligned with each other. Pure point matching uses only the location of the points to constrain the problem. This is a problem with broad practical applications, but it has only been