Loading...
research article
Progressive Geometric Algorithms
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.
Type
research article
Web of Science ID
WOS:000357517700004
Authors
Alewijnse, S. P. A.
•
Bagautdinov, T. M.
•
De Berg, M.
•
Bouts, Q. W.
•
Ten Brink, A. P.
•
Buchin, K.
•
Westenberg, M. A.
Publication date
2015
Published in
Volume
6
Issue
2
Start page
72
End page
92
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
December 2, 2015
Use this identifier to reference this record