A quadratic lower bound for colourful simplicial depth
We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R-d is contained in at least [GRAPHICS] simplices with one vertex from each set.
colourful simplicial depth simplicial depth computational geometry caratheodory theorem colourful caratheodory theorem