Output-sensitive algorithms for Tukey depth and related problems

David Bremner, Dan Chen, John Iacono, Stefan Langerman, Pat Morin

    Research output: Contribution to journalArticlepeer-review


    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, such as outlier removal, where the value of the output is typically small.

    Original languageEnglish (US)
    Pages (from-to)259-266
    Number of pages8
    JournalStatistics and Computing
    Issue number3
    StatePublished - Sep 2008


    • Algorithms
    • Computational geometry
    • Computational statistics
    • Fixed-parameter tractability
    • Halfspace depth
    • Tukey depth

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Statistics and Probability
    • Statistics, Probability and Uncertainty
    • Computational Theory and Mathematics


    Dive into the research topics of 'Output-sensitive algorithms for Tukey depth and related problems'. Together they form a unique fingerprint.

    Cite this