Progressive geometric algorithms

Sander P.A. Alewijnse, Timur M. 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.

Full Text:

PDF


DOI: http://dx.doi.org/10.20382/jocg.v6i2a5

ISSN: 1920-180X