论文信息 - Opposite-Quadrant Depth in the Plane

Opposite-Quadrant Depth in the Plane

Given a set S of n points in the plane, the opposite-quadrant depth of a point p∈S is defined as the largest number k such that there are two opposite axis-aligned closed quadrants (NW and SE, or SW and NE) with apex p, each quadrant containing at least k elements of S. We prove that S has a point with opposite-quadrant depth at least n/8. If the elements of S are in convex position, then we can guarantee the existence of an element whose opposite-quadrant depth is at least n/4. Both results are asymptotically best possible.

[1] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[2] J. Pach,et al. Conflict-free colorings , 2003 .

[3] Regina Y. Liu,et al. Multivariate analysis by data depth: descriptive statistics, graphics and inference, (with discussion and a rejoinder by Liu and Singh) , 1999 .

[4] Thomas H. Cormen,et al. Introduction to algorithms [2nd ed.] , 2001 .

[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .

[6] Mia Hubert,et al. The Catline for Deep Regression , 1998 .

[7] Dana Ron,et al. Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks , 2003, SIAM J. Comput..

[8] B. Aronov,et al. Discrete and computational geometry : the Goodman-Pollack Festschrift , 2003 .

[9] G. Szekeres,et al. A combinatorial problem in geometry , 2009 .

[10] Sariel Har-Peled,et al. Conflict-Free Coloring of Points and Simple Regions in the Plane , 2005, Discret. Comput. Geom..