Splitting a Delaunay triangulation in linear time

被引：29

作者：

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

共 50 条

[1] Splitting a Delaunay Triangulation in Linear Time
[J]. Algorithmica, 2002, 34 : 39 - 46
[2] The greedy triangulation can be computed from the Delaunay triangulation in linear time
Levcopoulos, C
Krznaric, D
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1999, 14 (04): : 197 - 220
[3] Delaunay triangulation of imprecise points in linear time after preprocessing
Loffler, Maarten
Snoeyink, Jack
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (03): : 234 - 242
[4] A LINEAR-TIME CONSTRUCTION OF THE RELATIVE NEIGHBORHOOD GRAPH FROM THE DELAUNAY TRIANGULATION
LINGAS, A
[J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1994, 4 (04): : 199 - 208
[5] Delaunay Triangulation and Tores Triangulation
Grigis, Alain
[J]. GEOMETRIAE DEDICATA, 2009, 143 (01) : 81 - 88
[6] DELAUNAY TRIANGULATION AND THE CONVEX-HULL OF N-POINTS IN EXPECTED LINEAR TIME
MAUS, A
[J]. BIT NUMERICAL MATHEMATICS, 1984, 24 (02) : 151 - 163
[7] Finding the constrained delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time
Chin, F
Wang, CA
[J]. SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 472 - 487
[8] Linear Chromatic Adaptation Transform Based on Delaunay Triangulation
Kreslin, Rok
Calvo, Pilar M.
Corzo, Luis G.
Peer, Peter
[J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2014, 2014
[9] A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
Dominique Attali
Jean-Daniel Boissonnat
[J]. Discrete & Computational Geometry, 2004, 31 : 369 - 384
[10] A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces
Attali, D
Boissonnat, JD
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2004, 31 (03) : 369 - 384

← 1 2 3 4 5 →