The quickhull algorithm for convex hulls.
The convex hull of a set of points is the smallest convex set that contains the points. This article presents a practial convex hull algorithm that combines the two-dimensional Quickhull algorithm with the general-dimension Beneath-Beyond Algorithm. It is similar to the randomized, incremental algor...
| الحاوية / القاعدة: | ACM transactions on mathematical software. 22, 4 (1996). |
|---|---|
| المؤلف الرئيسي: | |
| مؤلفون آخرون: | , |
| التنسيق: | مقال |
| اللغة: | English |
| الموضوعات: |