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 条
  • [1] Combinatorial Optimization with Information Geometry: The Newton Method
    Malago, Luigi
    Pistone, Giovanni
    ENTROPY, 2014, 16 (08) : 4260 - 4289
  • [2] From combinatorial optimization to real algebraic geometry and back
    Povh, Janez
    CROATIAN OPERATIONAL RESEARCH REVIEW, 2014, 5 (02) : 105 - 117
  • [3] Semi-mechanization Method for a Unsolved Optimization Problem in Combinatorial Geometry
    Zeng, Zhenbing
    Shan, Meijing
    APPLIED COMPUTING 2007, VOL 1 AND 2, 2007, : 762 - 766
  • [4] ON A PROBLEM OF COMBINATORIAL GEOMETRY
    BELOV, AY
    RUSSIAN MATHEMATICAL SURVEYS, 1992, 47 (03) : 167 - 168
  • [5] A METHOD IN COMBINATORIAL GEOMETRY
    KELLEY, JB
    AMERICAN MATHEMATICAL MONTHLY, 1965, 72 (09): : 1061 - &
  • [6] COMBINATORIAL GEOMETRY IN PLANE
    JOHNSON, GP
    AMERICAN MATHEMATICAL MONTHLY, 1965, 72 (10): : 1154 - &
  • [7] ON A PROBLEM IN COMBINATORIAL GEOMETRY
    ERDOS, P
    PURDY, G
    STRAUS, EG
    DISCRETE MATHEMATICS, 1982, 40 (01) : 45 - 52
  • [8] Discrete combinatorial geometry
    Kenmochi, Y
    Imiya, A
    Ichikawa, A
    PATTERN RECOGNITION, 1997, 30 (10) : 1719 - 1728
  • [9] PROBLEM IN COMBINATORIAL GEOMETRY
    HALL, RR
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 1976, 12 (47): : 315 - 319
  • [10] COMPLEX COMBINATORIAL GEOMETRY
    STEINBERG, H
    TRANSACTIONS OF THE AMERICAN NUCLEAR SOCIETY, 1976, 23 (JUN18): : 207 - 208