Journal article
Output-sensitive algorithms for Tukey depth and related problems
Abstract
The Tukey depth (Proceedings of the International Congress of Mathematicians, vol. 2, pp. 523–531, 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, …
Authors
Bremner D; Chen D; Iacono J; Langerman S; Morin P
Journal
Statistics and Computing, Vol. 18, No. 3,
Publisher
Springer Nature
Publication Date
September 2008
DOI
10.1007/s11222-008-9054-2
ISSN
0960-3174