Progressive geometric algorithms

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)
148 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
Title of host publication30th ACM Symposium on Computational Geometry (SoCG, Kyoto, Japan, June 8-11, 2014)
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
ISBN (Print)978-1-4503-2594-3
Publication statusPublished - 2014
Event30th Annual Symposium on Computational Geometry (SoCG 2014) - Kyoto, Japan
Duration: 8 Jun 201411 Jun 2014
Conference number: 30


Conference30th Annual Symposium on Computational Geometry (SoCG 2014)
Abbreviated titleSoCG '14


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

Cite this