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.


Published in:
Journal Of Computational Geometry, 6, 2, 72-92
Year:
2015
Publisher:
Ottawa, Carleton Univ, Dept Mathematics & Statistics
ISSN:
1920-180X
Laboratories:




 Record created 2015-12-02, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)