Progressive Geometric Algorithms

Sander P. A. Alewijnse, Timur Bagautdinov, Mark de Berg, Quirijn W. Bouts, Alex P. ten Brink, Kevin Buchin, Michel A. Westenberg

Abstract: Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms for two geometric problems: computing the convex hull of a planar point set, and finding popular places in a set of trajectories.