Output-sensitive algorithms for Tukey depth and related problems

The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algorithms for computing the Tukey depth of a point in various dimensions are considered. The running times of these algorithms depend on the value of the output, making them suited to situations, such as outlier removal, where the value of the output is typically small.

• Type: Journal
• Year: 2008
• Where: SAC
• Authors: David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin
• Keywords: Applied Computing, Closed Halfspace, Finite Set, SAC 2008, Tukey Depth