Alewijnse, S. P. A.Bagautdinov, T. M.De Berg, M.Bouts, Q. W.Ten Brink, A. P.Buchin, K.Westenberg, M. A.2015-12-022015-12-022015-12-02201510.20382/jocg.v6i2a5https://infoscience.epfl.ch/handle/20.500.14299/121383WOS:000357517700004Progressive 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.text::journal::journal article::research article