Journal
ADVANCES IN ENGINEERING SOFTWARE
Volume 43, Issue 1, Pages 1-13Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.advengsoft.2011.09.003
Keywords
Computational geometry; Delaunay triangulation; In-circle test; Recursive edge-flipping; Sweep-line; Sweep-circle
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available