Self-improving Algorithms for Convex Hulls

Abstract

We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence <i>I</i><sub>1</sub>, <i>I</i><sub>2</sub>,... of planar <i>n</i>-point sets, the upper convex hull conv (<i>I</i>) of each set <i>I</i> is desired. We assume that there exists a probability distribution <i>D</i> on <i>n</i>-point sets, such that the… (More)
DOI: 10.1137/1.9781611973075.126

Topics

8 Figures and Tables

Cite this paper

@inproceedings{Clarkson2010SelfimprovingAF, title={Self-improving Algorithms for Convex Hulls}, author={Kenneth L. Clarkson and Wolfgang Mulzer and Seshadhri Comandur}, booktitle={SODA}, year={2010} }