Progressive geometric algorithms

S.P.A. Alewijnse, T.M. Bagautdinov, M.T. de Berg, Q.W. Bouts, Alex P. ten Brink, K.A. Buchin, M.A. Westenberg

Research output: Contribution to journalArticleAcademicpeer-review

94 Downloads (Pure)


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.
Original languageEnglish
Number of pages21
JournalJournal of Computational Geometry
Issue number2
Publication statusPublished - 2015


Dive into the research topics of 'Progressive geometric algorithms'. Together they form a unique fingerprint.

Cite this