Point set stratification and Delaunay depth

Details Point set stratification and Delaunay depth Point set stratification and Delaunay depth

2005-05-08

arxiv.org/abs/cs/0505017v1

Computer Science

Computational Geometry

17 pages, 16 figures

Scientific paper

In the study of depth functions it is important to decide whether we want such a function to be sensitive to multimodality or not. In this paper we analyze the Delaunay depth function, which is sensitive to multimodality and compare this depth with others, as convex depth and location depth. We study the stratification that Delaunay depth induces in the point set (layers) and in the whole plane (levels), and we develop an algorithm for computing the Delaunay depth contours, associated to a point set in the plane, with running time O(n log^2 n). The depth of a query point p with respect to a data set S in the plane is the depth of p in the union of S and p. When S and p are given in the input the Delaunay depth can be computed in O(n log n), and we prove that this value is optimal.

Affiliated with

Also associated with

No associations

Rating

Point set stratification and Delaunay depth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Point set stratification and Delaunay depth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Point set stratification and Delaunay depth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484973