Tukey depth
In computational geometry, the Tukey depth is a measure of the depth of a point in a fixed set of points. The concept is named after its inventor, John Tukey. Given a set of points in d-dimensional space, a point p has Tukey depth k where k is the smallest number of points in any closed halfspace that contains p.
For example, for any point on the convex hull there is always a (closed) halfspace that contains only that point, and hence its Tukey depth is 1.
Tukey mean and relation to centerpoint
A centerpoint c of a point set of size n is nothing else but a point of Tukey depth of at least n/d + 1.
gollark: SC admins: orbital laser strike initiated.
gollark: Fake loading screens are the enemy of mankind.
gollark: Why does it do `sleep` while iterating over the files? That seems like a waste of time.
gollark: How does that even do anything? Where do you *set* listenBreak? Where does the "key" value go?!
gollark: That seems like a really weird way to do things.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.