Progressive geometric algorithms
Sander P.A. Alewijnse, Timur M. Bagautdinov, Mark de Berg and 4 more
Journal of Computational Geometry · 2015
doi:10.20382/jocg.v6i2a5 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.