A weak characterisation of the Delaunay triangulation

被引:0
|
作者
Vin de Silva
机构
[1] Pomona College,Department of Mathematics
来源
Geometriae Dedicata | 2008年 / 135卷
关键词
Delaunay triangulation; Voronoi diagram; Laguerre diagram; Witness complex; Manifold reconstruction; Topological approximation; 52-02;
D O I
暂无
中图分类号
学科分类号
摘要
We consider a new construction, the weak Delaunay triangulation of a finite point set in a metric space, which contains as a subcomplex the traditional (strong) Delaunay triangulation. The two simplicial complexes turn out to be equal for point sets in Euclidean space, as well as in the (hemi)sphere, hyperbolic space, and certain other geometries. There are weighted and approximate versions of the weak and strong complexes in all these geometries, and we prove equality theorems in those cases also. On the other hand, for discrete metric spaces the weak and strong complexes are decidedly different. We give a short empirical demonstration that weak Delaunay complexes can lead to dramatically clean results in the problem of estimating the homology groups of a manifold represented by a finite point sample.
引用
收藏
页码:39 / 64
页数:25
相关论文
共 50 条
  • [41] A Clustering Algorithm based on Delaunay Triangulation
    Xia, Ying
    Peng, Xi
    [J]. 2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 4517 - 4521
  • [42] Modified DAG location for Delaunay triangulation
    Kolingerová, I
    [J]. COMPUTATIONAL SCIENCE-ICCS 2002, PT III, PROCEEDINGS, 2002, 2331 : 125 - 134
  • [43] 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
  • [44] Efficiently Navigating A Random Delaunay Triangulation
    Broutin, Nicolas
    Devillers, Olivier
    Hemsley, Ross
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2016, 49 (01) : 95 - 136
  • [45] Delaunay triangulation programs on surface data
    Choi, S
    Amenta, N
    [J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 135 - 136
  • [46] A comparison of sequential Delaunay triangulation algorithms
    Su, P
    Drysdale, RLS
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (5-6): : 361 - 385
  • [47] Angle-monotonicity of Delaunay triangulation
    Bakhshesh, Davood
    Farshi, Mohammad
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2021, 94
  • [48] New approaches for Delaunay triangulation and optimisation
    Perumal, Logah
    [J]. HELIYON, 2019, 5 (08)
  • [49] 2 ALGORITHMS FOR CONSTRUCTING A DELAUNAY TRIANGULATION
    LEE, DT
    SCHACHTER, BJ
    [J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1980, 9 (03): : 219 - 242
  • [50] AN INTERSECTION ALGORITHM BASED ON DELAUNAY TRIANGULATION
    SUGIHARA, K
    [J]. IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1992, 12 (02) : 59 - 67