A faster circle-sweep Delaunay triangulation algorithm

被引：13

作者：

Biniaz, Ahmad ^{[1
]}

Dastghaibyfard, Gholamhossein ^{[2
]}

机构：

[1] Islamic Azad Univ, Lamerd Branch, Dept Comp Engn, Lamerd, Iran

[2] Shiraz Univ, Dept Comp Sci & Engn, Shiraz, Iran

来源：

ADVANCES IN ENGINEERING SOFTWARE | 2012年 / 43卷 / 01期

关键词：

Computational geometry; Delaunay triangulation; In-circle test; Recursive edge-flipping; Sweep-line; Sweep-circle; INCREMENTAL CONSTRUCTION; MESH; INTERPOLATION; TERRAINS;

D O I：

10.1016/j.advengsoft.2011.09.003

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：1 / 13

页数：13

共 50 条

[1] Sweep-line algorithm for constrained Delaunay triangulation
Domiter, V.
Zalik, B.
[J]. INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2008, 22 (04) : 449 - 462
[2] An efficient sweep-line Delaunay triangulation algorithm
Zalik, B
[J]. COMPUTER-AIDED DESIGN, 2005, 37 (10) : 1027 - 1038
[3] A New Delaunay Triangulation Algorithm Based on Constrained Maximum Circumscribed Circle
CAO Ming
[J]. Wuhan University Journal of Natural Sciences, 2015, 20 (04) : 313 - 317
[4] COMPUTING CONSTRAINED TRIANGULATION AND DELAUNAY TRIANGULATION - A NEW ALGORITHM
ZHOU, JM
SHAO, KR
ZHOU, KD
ZHAN, QH
[J]. IEEE TRANSACTIONS ON MAGNETICS, 1990, 26 (02) : 694 - 697
[5] A Clustering Algorithm based on Delaunay Triangulation
Xia, Ying
Peng, Xi
[J]. 2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 4517 - 4521
[6] Algorithm to locate points in a Delaunay triangulation
Zhao, Hui
Bikdash, Marwan
[J]. Proceedings of the Thirty-Eighth Southeastern Symposium on System Theory, 2004, : 211 - 215
[7] AN INTERSECTION ALGORITHM BASED ON DELAUNAY TRIANGULATION
SUGIHARA, K
[J]. IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1992, 12 (02) : 59 - 67
[8] An optimal algorithm for realizing a Delaunay triangulation
Lambert, T
[J]. INFORMATION PROCESSING LETTERS, 1997, 62 (05) : 245 - 250
[9] Faster circle packing with application to nonobtuse triangulation
Eppstein, D
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1997, 7 (05) : 485 - 491
[10] AN ONLINE ALGORITHM FOR CONSTRAINED DELAUNAY TRIANGULATION
DEFLORIANI, L
PUPPO, E
[J]. CVGIP-GRAPHICAL MODELS AND IMAGE PROCESSING, 1992, 54 (04): : 290 - 300

← 1 2 3 4 5 →