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 条
  • [31] Delaunay Triangulations of Closed Euclidean d-Orbifolds
    Caroli, Manuel
    Teillaud, Monique
    DISCRETE & COMPUTATIONAL GEOMETRY, 2016, 55 (04) : 827 - 853
  • [32] On the stretch factor of Delaunay triangulations of points in convex position
    Cui, Shiliang
    Kanj, Iyad A.
    Xia, Ge
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2011, 44 (02): : 104 - 109
  • [33] Single-step creation of localized Delaunay triangulations
    Filipe Araujo
    Luís Rodrigues
    Wireless Networks, 2009, 15 : 845 - 858
  • [34] Improved Upper Bound on the Stretch Factor of Delaunay Triangulations
    Xia, Ge
    COMPUTATIONAL GEOMETRY (SCG 11), 2011, : 264 - 273
  • [35] Delaunay Triangulations of Closed Euclidean d-Orbifolds
    Manuel Caroli
    Monique Teillaud
    Discrete & Computational Geometry, 2016, 55 : 827 - 853
  • [36] Upper and Lower Bounds for Online Routing on Delaunay Triangulations
    Bonichon, Nicolas
    Bose, Prosenjit
    De Carufel, Jean-Lou
    Perkovic, Ljubomir
    van Renssen, Andre
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 58 (02) : 482 - 504
  • [37] A FRONTAL APPROACH FOR INTERNAL NODE GENERATION IN DELAUNAY TRIANGULATIONS
    MULLER, JD
    ROE, PL
    DECONINCK, H
    INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS, 1993, 17 (03) : 241 - 255
  • [38] Insert and delete algorithms for maintaining dynamic Delaunay triangulations
    Devijver, Pierre A.
    Dekesel, Michel
    PATTERN RECOGNITION LETTERS, 1982, 1 (02) : 73 - 77
  • [39] A note on point location in delaunay triangulations of random points
    Devroye, L
    Mucke, EP
    Zhu, BH
    ALGORITHMICA, 1998, 22 (04) : 477 - 482
  • [40] The Lifting Projection of Convex Polyhedra for Finding Delaunay Triangulations
    Phan Thanh An
    Nam Dung Hoang
    Nguyen Kieu Linh
    JOURNAL OF CONVEX ANALYSIS, 2022, 29 (01) : 143 - 156