The ultimate planar convex hull algorithm
SIAM Journal on Computing
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Self-improving algorithms for delaunay triangulations
Proceedings of the twenty-fourth annual symposium on Computational geometry
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry
Triangulating input-constrained planar point sets
Information Processing Letters
Preprocessing Imprecise Points and Splitting Triangulations
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Delaunay Triangulation of Imprecise Points Simplified and Extended
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Instance-Optimal Geometric Algorithms
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry
| Hi-index | 0.00 |
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2,... of planar n-point sets, the upper convex hull conv (I) of each set I is desired. We assume that there exists a probability distribution D on n-point sets, such that the inputs Ij are drawn independently according to D. Furthermore, D is such that the individual points are distributed independently of each other. In other words, the i'th point is distributed according to Di. The Di's can be arbitrary but are independent of each other. The distribution D is not known to the algorithm in advance. After a learning phase of nε rounds, the expected time to compute conv(I) is O(n + H(conv(I))). Here, H(conv(I)) is the entropy of the output, which is a lower bound for the expected running time of any algebraic computation tree that computes the convex hull. (More precisely, H(conv(I)) is the minimum entropy of any random variable that maps I to a description of conv(I) and to a labeling scheme that proves nonextremality for every point in I not on the hull.) Our algorithm is thus asymptotically optimal for D.