Rigidity of the Delaunay triangulations of the plane

被引:0
|
作者
Dai, Song [1 ,2 ]
Wu, Tianqi [3 ]
机构
[1] Tianjin Univ, Ctr Appl Math, Tianjin 300072, Peoples R China
[2] Tianjin Univ, KL AAGDM, Tianjin 300072, Peoples R China
[3] Clark Univ, Dept Math, 950 Main St, Worcester, MA 01610 USA
关键词
Discrete conformal map; Delaunay triangulation; Discrete harmonic functions;
D O I
10.1016/j.aim.2024.109910
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove a rigidity result for Delaunay triangulations of the plane under Luo's notion of discrete conformality, extending previous results on hexagonal triangulations. Our result is a discrete analogue of the conformal rigidity of the plane. We follow Zhengxu He's analytical approach in his work on the rigidity of disk patterns, and develop a discrete Schwarz lemma and a discrete Liouville theorem. As a key ingredient to prove the discrete Schwarz lemma, we establish a correspondence between the Euclidean discrete conformality and the hyperbolic discrete conformality, for geodesic embeddings of triangulations. Other major tools include conformal modulus, discrete extremal length, and maximum principles in discrete conformal geometry. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页数:22
相关论文
共 50 条
  • [41] Upper and Lower Bounds for Online Routing on Delaunay Triangulations
    Bonichon, Nicolas
    Bose, Prosenjit
    De Carufel, Jean-Lou
    Perkovic, Ljubomir
    van Renssen, Andre
    ALGORITHMS - ESA 2015, 2015, 9294 : 203 - 214
  • [42] Upper and Lower Bounds for Online Routing on Delaunay Triangulations
    Nicolas Bonichon
    Prosenjit Bose
    Jean-Lou De Carufel
    Ljubomir Perković
    André van Renssen
    Discrete & Computational Geometry, 2017, 58 : 482 - 504
  • [43] Single-step creation of localized Delaunay triangulations
    Araujo, Filipe
    Rodrigues, Luis
    WIRELESS NETWORKS, 2009, 15 (07) : 845 - 858
  • [44] OFC-Delaunay triangulation: A new efficient algorithm for merging two adjacent Delaunay triangulations
    An, Phan Thanh
    Duc, Trinh Minh
    Oanh, Dang Thi
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (02)
  • [45] TRIANGULATING THE SQUARE AND SQUARING THE TRIANGLE: QUADTREES AND DELAUNAY TRIANGULATIONS ARE EQUIVALENT
    Loffler, Maarten
    Mulzer, Wolfgang
    SIAM JOURNAL ON COMPUTING, 2012, 41 (04) : 941 - 974
  • [46] Preferred directions for resolving the non-uniqueness of Delaunay triangulations
    Dyken, C
    Floater, MS
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2006, 34 (02): : 96 - 101
  • [47] Nice Point Sets Can Have Nasty Delaunay Triangulations
    Discrete & Computational Geometry, 2003, 30 : 109 - 132
  • [48] Efficient mesh optimization schemes based on Optimal Delaunay Triangulations
    Chen, Long
    Holst, Michael
    COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2011, 200 (9-12) : 967 - 984
  • [49] Delaunay Triangulations of Imprecise Points in Linear Time after Preprocessing
    Loffler, Maarten
    Snoeyink, Jack
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SGG'08), 2008, : 298 - 304
  • [50] AN O(N LOG N) PLANE-SWEEP ALGORITHM FOR L1 AND L-INFINITY DELAUNAY TRIANGULATIONS
    SHUTE, GM
    DENEEN, LL
    THOMBORSON, CD
    ALGORITHMICA, 1991, 6 (02) : 207 - 221