A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is
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. * M. de Berg, Q.W. Bouts and K. Buchin are supported by thedoi:10.1145/2582112.2582156 dblp:conf/compgeom/AlewijnseBBBBBW14 fatcat:4jxfc4owbrh2rd3iywqgmsfcga