Progressive Geometric Algorithms
SOCG'14: Proceedings of the thirtieth annual symposium on Computational geometry(2015)
摘要
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.
更多查看译文
关键词
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 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要