Output sensitive construction of the delaunay triangulation of points lying in two planes

被引：6

作者：

Boissonnat, JD

Cerezo, A

Devillers, O

Teillaud, M

机构：

[1] INRIA,F-06902 SOPHIA ANTIPOLIS,FRANCE

[2] UNIV NICE,F-06034 NICE,FRANCE

来源：

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS | 1996年 / 6卷 / 01期

关键词：

Delaunay triangulation; output-sensitive algorithms; Voronoi diagram; hyperbolic distance; computerized tomography;

D O I：

10.1142/S0218195996000022

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper, we propose an algorithm to compute the Delaunay triangulation of a set S of n points in 3-dimensional space when the points lie in 2 planes. The algorithm is output-sensitive and optimal with respect to the input and the output sizes. Its time complexity is O(n log n + t), where t is the size of the output, and the extra storage is O(n).

引用

页码：1 / 14

页数：14

共 50 条

[1] Construction of the Delaunay superlarge triangulation
Skvortsov A.V.
Russian Physics Journal, 2002, 45 (6) : 558 - 561
[2] Algorithm to locate points in a Delaunay triangulation
Zhao, Hui
Bikdash, Marwan
Proceedings of the Thirty-Eighth Southeastern Symposium on System Theory, 2004, : 211 - 215
[3] Incremental Delaunay triangulation construction for clustering
Razafindramanana, Octavio
Rayar, Frederic
Venturini, Gilles
2014 22ND INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2014, : 1354 - 1359
[4] A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron
Amenta, Nina
Attali, Dominique
Devillers, Olivier
DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 48 (01) : 19 - 38
[5] On Topological Changes in the Delaunay Triangulation of Moving Points
Rubin, Natan
DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 49 (04) : 710 - 746
[6] Method for constrained delaunay triangulation of scattered points
Li, Jiang-xiong
Jixie Kexue Yu Jishu/Mechanical Science and Technology, 2000, 19 (02): : 241 - 243
[7] Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
Dominique Attali
Jean-Daniel Boissonnat
Discrete & Computational Geometry, 2003, 30 : 437 - 452
[8] On Topological Changes in the Delaunay Triangulation of Moving Points
Natan Rubin
Discrete & Computational Geometry, 2013, 49 : 710 - 746
[9] Complexity of the Delaunay triangulation of points on polyhedral surfaces
Attali, D
Boissonnat, JD
DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 30 (03) : 437 - 452
[10] A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron
Nina Amenta
Dominique Attali
Olivier Devillers
Discrete & Computational Geometry, 2012, 48 : 19 - 38

← 1 2 3 4 5 →