QuickHull
algorithm for finding the convex hull of a set of points in the plane
Facts
8 properties- Instance of
- convex hull algorithm
- Publication date
- 1995[3]
- Average time complexity
- O(n \log n)[8]
- Described by source
- The quickhull algorithm for convex hulls[5]
- Point in time
- 1995[4]
- Published in
- ACM Transactions on Mathematical Software[6]
- Worst-case time complexity
- O(n^2)[7]
🏷️ Also known as
en QuickHull
ja クイックハル
ru Алгоритм быстрой оболочки
uk Алгоритм швидкої оболонки
🔖 Identifiers · 2
- Freebase ID
- /m/0j2b1h6
- Microsoft Academic ID (discontinued)
- 2776693088
Press Enter · cited answer in seconds
0 sources
Summary
QuickHull is a convex hull algorithm[1].