Convex sets;
Geometric transversals;
Depth in hyperplane arrangements;
Regression depth;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
What is the smallest number τ=τ(n) such that for any collection of n pairwise disjoint convex sets in d-dimensional Euclidean space, there is a point such that any ray (half-line) emanating from it meets at most τ sets of the collection? This question of Urrutia is closely related to the notion of regression depth introduced by Rousseeuw and Hubert (1996). We show the following:
机构:
Tel Aviv Univ, Dept Comp Sci, Raymond & Beverly Sackler Fac Exact Sci, IL-69978 Tel Aviv, IsraelTel Aviv Univ, Dept Comp Sci, Raymond & Beverly Sackler Fac Exact Sci, IL-69978 Tel Aviv, Israel