Computational Information Geometry Wonderland

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 useful index in statistics as attested by recent papers published in this area.

Here is the reference work:
Output-sensitive peeling of convex and maximal layers