Talk:Quickhull

Higher dimensions

Is there a 3d version? Thanks. 92.30.31.79 (talk) 13:23, 18 September 2012 (UTC)

According to the convex hull algorithms page Quickhull can be used to solve dimensions higher than 3 (I assume that it can be used to solve for 3D as well). However, this article does not include an algorithm for higher than 2D and even says it is used to compute the "convex hull of a finite set of points in the plane". Does anyone know if/how Quickhull can be used for problems with higher dimensions than 2D? Nathan Wonnacott (talk) 17:37, 22 August 2017 (UTC)

Question

The statement "Its worst case complexity for 2-dimensional and 3-dimensional space is considered to be $O(n\log(r))$" does not seem to be right. It can be $O(n^{2})$ for some configurations of points when the majority of points are left in one subset. — Preceding unsigned comment added by 172.248.120.198 (talk) 05:09, 16 July 2022 (UTC)

Scaling with dimension

How does this algorithm scale with the dimension of points d? Also, the definition of n is overloaded, it refers to both the dimension of the space of points and the number of points in the introduction. 2001:5A8:49CF:E00:55B:D705:55E1:36D0 (talk) 18:56, 7 May 2025 (UTC)