QuickHull
0 sources
QuickHull
Summary
QuickHull is a convex hull algorithm[1]. QuickHull draws 51 Wikipedia views per month (convex_hull_algorithm category, ranking #3 of 5).[2]
Key Facts
- QuickHull's instance of is recorded as convex hull algorithm[3].
- QuickHull's based on is recorded as quicksort[4].
- QuickHull's Commons category is recorded as QuickHull[5].
- QuickHull's publication date is recorded as +1995-00-00T00:00:00Z[6].
- QuickHull's point in time is recorded as +1995-00-00T00:00:00Z[7].
- QuickHull's Freebase ID is recorded as /m/0j2b1h6[8].
- QuickHull's described by source is recorded as The quickhull algorithm for convex hulls[9].
- QuickHull's published in is recorded as ACM Transactions on Mathematical Software[10].
- QuickHull's worst-case time complexity is recorded as O(n^2)[11].
- QuickHull's average time complexity is recorded as O(n \log n)[12].
- QuickHull's Microsoft Academic ID is recorded as 2776693088[13].
Body
Designation and Status
QuickHull's instance of is recorded as convex hull algorithm[3].
Why It Matters
QuickHull draws 51 Wikipedia views per month (convex_hull_algorithm category, ranking #3 of 5).[2] QuickHull has Wikipedia articles in 7 language editions, a strong signal of global cultural recognition.[14]