.png){kind=icon}
.png){kind=icon}
Return
A faster circle-sweep Delaunay triangulation algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2011.09.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Computational geometry
Delaunay triangulation
In-circle test
Recursive edge-flipping
Sweep-line
Sweep-circle
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W