Computing depth contours of bivariate point clouds

摘要: Abstract In this paper we construct an exact algorithm for computing depth contours of a bivariate data set. For use the half-space introduced by Tukey. The form nested collection convex sets. deeper contour, more robust it is with respect to outliers in point cloud. proposed has been implemented program called ISODEPTH, which needs little computation time and illustrated on some real examples. Finally, shown how can be used robustified versions classification techniques based hulls.