✦ LIBER ✦

Constructing the convex hull of a partially sorted set of points

✍ Scribed by Michael T. Goodrich

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 802 KB
Volume: 2
Category: Article
ISSN: 0925-7721
DOI: 10.1016/0925-7721(93)90023-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An algorithm for constructing the convex

An algorithm for constructing the convex hull of a set of spheres in dimension d

✍ Jean-Daniel Boissonnat; André Cérézo; Olivier Devillers; Jacqueline Duquesne; Ma 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 449 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

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

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)

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