Opposite-quadrant depth in the plane
Given a set \(S\) of \(n\) points in the plane, the opposite-quadrant depth of a point \(p \in 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\). The authors prove that \(S\) has a point with opposite-quadrant depth at least \(n /8\). If the elements of \(S\) are in convex position, then the existence of an element can be guaranteed whose opposite-quadrant depth is at least \(n /4\). Both results are asymptotically best possible.
- Conflict-free coloring of points and simple regions in the plane
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 970814 (Why is no real title available?)
- scientific article; zbMATH DE number 2209737 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Introduction to algorithms
- Multivariate analysis by data depth: Descriptive statistics, graphics and inference. (With discussions and rejoinder)
- The catline for deep regression
This page was built for publication: Opposite-quadrant depth in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373438)