A lower bound for computing Oja depth

Authors:
Greg Aloupis;Erin McLeish
Affiliations:
School of Computer Science, McGill University, Montreal, Quebec, Canada;School of Computer Science, McGill University, Montreal, Quebec, Canada
Venue:
Information Processing Letters
Year:
2005

Citing 3
Cited 1

Lower bounds for computing statistical depth

Computational Statistics & Data Analysis
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Algorithms for bivariate medians and a Fermat--Torricelli problem for lines

Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01

Point set stratification and Delaunay depth

Computational Statistics & Data Analysis

Quantified Score

Hi-index	0.89

Visualization

Abstract

Let S = {s1, ..., Sn} be a set of points in the plane. The Oja depth of a query point θ with respect to S is the sum of the areas of all triangles (θ, si, sj). This depth may be computed in O(n log n) time in the RAM model of computation. We show that a matching lower bound holds in the algebraic decision tree model. This bound also applies to the computation of the Oja gradient, the Oja sign test, and to the problem of computing the sum of pairwise distances among points on a line.