A long time ago, well in 1996, I investigated output-sensitive algorithms. I then designed an algorithm for peeling iteratively the convex hulls of a 2D point set. This yields the notion of depth of a point set, and is a
Daily Archives: March 4, 2010
The geometric median
The center of mass (=centroid) is defined as the center point minimizing the squared of the Euclidean distances (=variance). If one of the source point is an outlier corrupting your dataset, and if that outlier goes to infinity, then your