A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron

被引：1

作者：

Amenta, Nina ^{[1
]}

Attali, Dominique ^{[2
]}

Devillers, Olivier ^{[3
]}

机构：

[1] Univ Calif Davis, Dept Comp Sci, Davis, CA 95616 USA

[2] CNRS, Gipsa Lab, UMR 5216, F-38402 Grenoble, France

[3] INRIA Sophia Antipolis Mediterranee, F-06902 Sophia Antipolis, France

来源：

DISCRETE & COMPUTATIONAL GEOMETRY | 2012年 / 48卷 / 01期

基金：

美国国家科学基金会;

关键词：

Delaunay triangulation; Complexity; Upper bound; High dimension; Polyhedron; Annular medial axis; Sampling; COMPLEXITY;

D O I：

10.1007/s00454-012-9415-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We show that the Delaunay triangulation of a set of points distributed nearly uniformly on a -dimensional polyhedron (not necessarily convex) in -dimensional Euclidean space is , where . This bound is tight in the worst case and improves on the prior upper bound for most values of .

引用

页码：19 / 38

页数：20

共 50 条

[1] A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron
Nina Amenta
Dominique Attali
Olivier Devillers
[J]. Discrete & Computational Geometry, 2012, 48 : 19 - 38
[2] 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
[3] 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
[4] 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
[5] On Topological Changes in the Delaunay Triangulation of Moving Points
Rubin, Natan
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2013, 49 (04) : 710 - 746
[6] Method for constrained delaunay triangulation of scattered points
Li, Jiang-xiong
[J]. 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
[J]. Discrete & Computational Geometry, 2003, 30 : 437 - 452
[8] Complexity of the Delaunay triangulation of points on polyhedral surfaces
Attali, D
Boissonnat, JD
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 30 (03) : 437 - 452
[9] On Topological Changes in the Delaunay Triangulation of Moving Points
Natan Rubin
[J]. Discrete & Computational Geometry, 2013, 49 : 710 - 746
[10] Delaunay Triangulation of Imprecise Points Simplified and Extended
Buchin, Kevin
Loffler, Maarten
Morin, Pat
Mulzer, Wolfgang
[J]. ALGORITHMS AND DATA STRUCTURES, 2009, 5664 : 131 - +

← 1 2 3 4 5 →