Fast and Exact Convex Hull Simplification
share
Given a point set P in the plane, we seek a subset Q⊆ P, whose convex hull gives a smaller and thus simpler representation of the convex hull of P. Specifically, let cost(Q,P) denote the Hausdorff distance between the convex hulls 𝒞ℋ(Q) and 𝒞ℋ(P). Then given a value ε>0 we seek the smallest subset Q⊆ P such that cost(Q,P)≤ε. We also consider the dual version, where given an integer k, we seek the subset Q⊆ P which minimizes cost(Q,P), such that |Q|≤ k. For these problems, when P is in convex position, we respectively give an O(nlog^2 n) time algorithm and an O(nlog^3 n) time algorithm, where the latter running time holds with high probability. When there is no restriction on P, we show the problem can be reduced to APSP in an unweighted directed graph, yielding an O(n^2.5302) time algorithm when minimizing k and an O(min{n^2.5302, kn^2.376}) time algorithm when minimizing ε, using prior results for APSP. Finally, we show our near linear algorithms for convex position give 2-approximations for the general case.
READ FULL TEXT