Combinatorial optimization in geometry

被引:35
|
作者
Rivin, I [1 ]
机构
[1] Temple Univ, Dept Math, Philadelphia, PA 19122 USA
[2] Univ Manchester, Dept Math, Philadelphia, PA 19122 USA
关键词
linear programming; network flow; moduli space; Euclidean structures; hyperbolic structures; Delaunay triangulations;
D O I
10.1016/S0196-8858(03)00093-9
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper we extend and unify the results of [Rivin, Ann. of Math. 143 (1996)] and [Rivin, Ann. of Math. 139 (1994)]. As a consequence, the results of [Rivin, Ann. of Math. 143 (1996)] are generalized from the framework of ideal polyhedra in H-3 to that of singular Euclidean structures on surfaces, possibly with an infinite number of singularities (by contrast, the results of [Rivin, Ann. of Math. 143 (1996)] can be viewed as applying to the case of non-singular structures on the disk, with a finite number of distinguished points). This leads to a fairly complete understanding of the moduli space of such Euclidean structures and thus, by the results of [Penner, Comm. Math. Phys. 113 (1987) 299-339; Epstein, Penner, J. Differential Geom. 27 (1988) 67-80; Naatanen, Penner, Bull. London Math. Soc. 6 (1991) 568-574] the author [Rivin, Ann. of Math. 139 (1994); Rivin, in: Lecture Notes in Pure and Appl. Math., Vol. 156, 1994], and others, further insights into the geometry and topology of the Riemann moduli space. The basic objects studied are the canonical Delaunay triangulations associated to the aforementioned Euclidean structures. The basic tools, in addition to the results of [Rivin, Ann. of Math. 139 (1994)] and combinatorial geometry are methods of combinatorial optimization-linear programming and network flow analysis; hence the results mentioned above are not only effective but also efficient. Some applications of these methods to three-dimensional topology are also given (to prove a result of Casson's). (C) 2002 Elsevier Inc. All rights reserved.
引用
收藏
页码:242 / 271
页数:30
相关论文
共 50 条
  • [31] A SYNOPSIS OF COMBINATORIAL INTEGRAL GEOMETRY
    AMBARTZUMIAN, RV
    ADVANCES IN MATHEMATICS, 1980, 37 (01) : 1 - 15
  • [32] COMBINATORIAL THEOREM IN PLANE GEOMETRY
    CHVATAL, V
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1975, 18 (01) : 39 - 41
  • [33] Combinatorial Geometry and Approximation Algorithms
    Chan, Timothy M.
    ALGORITHMS AND COMPUTATION, ISAAC 2012, 2012, 7676 : 2 - 2
  • [34] COMBINATORIAL OPTIMIZATION
    MCKEOWN, GP
    RAYWARDSMITH, VJ
    ROPER, BM
    UNIVERSITY COMPUTING, 1984, 6 (02): : 122 - 125
  • [35] An improved combinatorial geometry model for arbitrary geometry in DSMC
    Kargaran, H.
    Minuchehr, A.
    Zolfaghari, A.
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2017,
  • [36] Continuous optimization and combinatorial optimization
    Qi, Liqun
    Liao, Li-Zhi
    Zang, Wenan
    Zhou, Guanglu
    FRONTIERS OF MATHEMATICS IN CHINA, 2010, 5 (01) : 1 - 2
  • [37] Continuous optimization and combinatorial optimization
    Liqun Qi
    Li-Zhi Liao
    Wenan Zang
    Guanglu Zhou
    Frontiers of Mathematics in China, 2010, 5 : 1 - 2
  • [38] Preface“Advances in Combinatorial Optimization”: Special Issue of Journal of Combinatorial Optimization
    Bo Chen
    Dachuan Xu
    Guochuan Zhang
    Journal of Combinatorial Optimization, 2022, 43 : 1507 - 1508
  • [39] Preface "Advances in Combinatorial Optimization": Special Issue of Journal of Combinatorial Optimization
    Chen, Bo
    Xu, Dachuan
    Zhang, Guochuan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (05) : 1507 - 1508
  • [40] Preface: geometry, combinatorial designs and cryptology
    Bonisoli, Arrigo
    Hirschfeld, James
    Magliveras, Spyros
    DESIGNS CODES AND CRYPTOGRAPHY, 2012, 64 (1-2) : 1 - 2