Points with large quadrant-depth

13 years 9 months ago

Download www.math.technion.ac.il

We characterize the set of all pairs (a, b) such that for every set P of n points in general position in R2 there always exists a point p ∈ P and two opposite quadrants determined by the axes-parallel lines through p such that one quadrant contains at least an points of P and the other quadrant contains at least bn points of P. We consider also some generalizations of this problem in the plane and in higher dimensions.

Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom

Real-time Traffic

COMPGEOM 2010 | General Position | Opposite Quadrants | Quadrant Contains |

claim paper

» Fast Safe Spline Surrogates for Large Point Clouds

» Clustering Large Dynamic Datasets Using Exemplar Points

» Large Bichromatic Point Sets Admit Empty Monochromatic 4Gons

» On fast surface reconstruction methods for large and noisy point clouds

» Anytime PointBased Approximations for Large POMDPs

» Distributed computation of the knn graph for large highdimensional point sets

» Planar Point Location for Large Data Sets To Seek or Not to Seek

» QSplat a multiresolution point rendering system for large meshes

Post Info
More Details (n/a)

Added	10 Jul 2010
Updated	10 Jul 2010
Type	Conference
Year	2010
Where	COMPGEOM
Authors	Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow

Comments (0)

Sciweavers

Points with large quadrant-depth

COMPGEOM 2010 | General Position | Opposite Quadrants | Quadrant Contains |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers