Self-improving algorithms for coordinate-wise maxima


Computing the coordinate-wise maxima of a planar point set is a classic and well-studied problem in computational geometry. We give an algorithm for this problem in the <i>self-improving setting</i>. We have n (unknown) independent distributions cD<sub>1</sub>, cD<sub>2</sub>, ..., cD<sub>n</sub> of planar points. An input pointset (p<sub>1</sub>, p<sub>2… (More)
DOI: 10.1145/2261250.2261291


2 Figures and Tables