Progressive Geometric Algorithms

S. P. A. Alewijnse, T. M. Bagautdinov, M. de Berg, Q. W. Bouts, A. P. ten Brink, K. Buchin, M. A. Westenberg
2014 Annual Symposium on Computational Geometry - SOCG'14  
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 the
more » ... Organisation for Scientific Research (NWO) under project no. 024.002.003, 639.023.208 and 612.001.207, respectively.
doi:10.1145/2582112.2582156 dblp:conf/compgeom/AlewijnseBBBBBW14 fatcat:4jxfc4owbrh2rd3iywqgmsfcga