Splitting a Delaunay triangulation in linear time

被引：28

作者：

Chazelle, B

Devillers, O

Hurtado, F

Mora, M

Sacristán, V

Teillaud, M

机构：

[1] Princeton Univ, Dept Comp Sci, Princeton, NJ 08544 USA

[2] INRIA, F-06902 Sophia Antipolis, France

[3] Univ Politecn Cataluna, Dept Matemat Aplicada 2, E-08028 Barcelona, Spain

来源：

ALGORITHMICA | 2002年 / 34卷 / 01期

关键词：

computational geometry; Delaunay triangulation; Voronoi diagrams; randomized algorithms;

D O I：

10.1007/s00453-002-0939-8

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Computing the Delaunay triangulation of n points requires usually a minimum of 2 (n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed. Given two sets of points, we prove that, if the Delaunay triangulation of all the points is known, the Delaunay triangulation of each set can be computed in randomized expected linear time.

引用

页码：39 / 46

页数：8

共 20 条

[11] APPLICATIONS OF RANDOM SAMPLING IN COMPUTATIONAL GEOMETRY .2.
CLARKSON, KL
SHOR, PW
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) : 387 - 421
[12] De Berg M., 2000, COMPUTATIONAL GEOMET, DOI DOI 10.1007/978-3-662-03427-9
[13] Computing a single cell in the overlay of two simple polygons
deBerg, M
Devillers, O
Dobrindt, K
Schwarzkopf, O
[J]. INFORMATION PROCESSING LETTERS, 1997, 63 (04) : 215 - 219
[14] RANDOMIZATION YIELDS SIMPLE O(n log(star) n) ALGORITHMS FOR DIFFICULT Omega(n) PROBLEMS
Devillers, Olivier
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (01) : 97 - 111
[15] ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS
DJIDJEV, HN
LINGAS, A
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1995, 5 (03) : 327 - 337
[16] RANDOMIZED INCREMENTAL CONSTRUCTION OF DELAUNAY AND VORONOI DIAGRAMS
GUIBAS, LJ
KNUTH, DE
SHARIR, M
[J]. ALGORITHMICA, 1992, 7 (04) : 381 - 413
[17] A linear-time randomized algorithm for the bounded voronoi diagram of a simple polygon
Klein, R
Lingas, A
[J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (03) : 263 - 278
[18] Seidel R., 1991, Computational Geometry: Theory and Applications, V1, P51, DOI 10.1016/0925-7721(91)90012-4
[19] SEIDEL R, 1993, ALGORITHM COMBINAT, V10, P37
[20] Snoeyink J., 1997, Proceedings of the Thirteenth Annual Symposium on Computational Geometry, P400, DOI 10.1145/262839.263025

← 1 2 →