𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A method for solving the n-dimensional convex hull problem

✍ Scribed by Adam Jóźwik

Book ID
103596508
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
150 KB
Volume
2
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clipping algorithms for solving the near
Clipping algorithms for solving the nearest point problem over reduced convex hulls
✍ Jorge López; Álvaro Barbero; José R. Dorronsoro 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 259 KB

The nearest point problem (NPP), i.e., finding the closest points between two disjoint convex hulls, has two classical solutions, the Gilbert-Schlesinger-Kozinec (GSK) and Mitchell-Dem'yanov-Malozemov (MDM) algorithms. When the convex hulls do intersect, NPP has to be stated in terms of reduced conv