期刊
ADVANCES IN ENGINEERING SOFTWARE
卷 43, 期 1, 页码 1-13出版社
ELSEVIER SCI LTD
DOI: 10.1016/j.advengsoft.2011.09.003
关键词
Computational geometry; Delaunay triangulation; In-circle test; Recursive edge-flipping; Sweep-line; Sweep-circle
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. (C) 2011 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据