DeWall:: A fast divide and conquer Delaunay triangulation algorithm in Ed

被引:127
作者
Cignoni, P
Montani, C
Scopigno, R
机构
[1] CNR, CNUCE, I-56126 Pisa, Italy
[2] CNR, IEI, I-56126 Pisa, Italy
关键词
Delaunay triangulation; divide and conquer; uniform grids;
D O I
10.1016/S0010-4485(97)00082-1
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The paper deals with Delaunay Triangulations (DT) in E-d space. This classic computational geometry problem is studied from the point of view of the efficiency, extendibility to any dimensionality, and ease of implementation. A new solution to DT is proposed, based on an original interpretation of the well-known Divide and Conquer paradigm. One of the main characteristics of this new algorithm is its generality: it can be simply extended to triangulate point sets in any dimension. The technique adopted is very efficient and presents a subquadratic behaviour in real applications in E-3, although its computational complexity does not improve the theoretical bounds reported in the literature. An evaluation of the performance on a number of datasets is reported, together with a comparison with other DT algorithms. (C) 1998 Published by Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:333 / 341
页数:9
相关论文
共 19 条
[1]   GEOMETRIC COMPUTING AND UNIFORM GRID TECHNIQUE [J].
AKMAN, V ;
FRANKLIN, WR ;
KANKANHALLI, M ;
NARAYANASWAMI, C .
COMPUTER-AIDED DESIGN, 1989, 21 (07) :410-420
[2]  
AURENHAMMER F, 1991, ACM COMPUT SURV, V3, P345
[3]  
Avis D., 1995, Proceedings of the Eleventh Annual Symposium on Computational Geometry, P20, DOI 10.1145/220279.220282
[4]  
BARBER CB, 1993, GCG5393 U MINN
[5]  
Delaunay B. N., 1934, VESTN AN SSSR+, P793
[6]   PRIMITIVES FOR THE MANIPULATION OF 3-DIMENSIONAL SUBDIVISIONS [J].
DOBKIN, DP ;
LASZLO, MJ .
ALGORITHMICA, 1989, 4 (01) :3-32
[7]   A FASTER DIVIDE-AND-CONQUER ALGORITHM FOR CONSTRUCTING DELAUNAY TRIANGULATIONS [J].
DWYER, RA .
ALGORITHMICA, 1987, 2 (02) :137-151
[8]  
Edelsbrunner H., 1992, Proceedings of the Eighth Annual Symposium on Computational Geometry, P43, DOI 10.1145/142675.142688
[9]   SIMULATION OF SIMPLICITY - A TECHNIQUE TO COPE WITH DEGENERATE CASES IN GEOMETRIC ALGORITHMS [J].
EDELSBRUNNER, H ;
MUCKE, EP .
ACM TRANSACTIONS ON GRAPHICS, 1990, 9 (01) :66-104
[10]  
Edelsbrunner H., 1987, ALGORITHMS COMBINATO