Progressive Geometric Algorithms
SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry（2015）
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.
MoreTranslated text
Key words
output intermediate solution,geometric problem,popular place,progressive algorithm,planar point set,convex hull,complete solution,progressive geometric algorithms,efficient progressive algorithm,point location,line segment intersection,maxima
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined