A faster circle-sweep Delaunay triangulation algorithm
Advances in Engineering Software(2012)
摘要
This paper presents a new way to compute the Delaunay triangulation of a planar set P of n points, using sweep-circle technique combined with the standard recursive edge-flipping. The algorithm sweeps the plane by an increasing circle whose center is a fixed point in the convex hull of P. Empirical results and comparisons show that it reduces the number of in-circle tests and edge-flips, and it is efficient in practice.
更多查看译文
关键词
fixed point,convex hull,delaunay triangulation,sweep-circle technique,n point,p. empirical result,circle-sweep delaunay triangulation algorithm,increasing circle,in-circle test,standard recursive edge-flipping,computational geometry,sweep line
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络