Tightness and computing distances in the curve complex

被引：0
|
作者：
Kenneth J. Shackleton
机构：
[1] University of Tokyo IPMU,
来源：
Geometriae Dedicata | 2012年 / 160卷
关键词：
A-Teichmüller theory; Mapping class groups; Curve complex; Combinatorial geometry; Algorithms; 57M50; 05C12;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We address the lack of local-finiteness in Harvey’s curve complex by computational means, computing bounds on certain intersection numbers among curves lying on a natural family of geodesics. We give a finite time algorithm for constructing all of these geodesics between any two curves, and treat stable lengths.
引用
收藏
页码：243 / 259
页数：16
相关论文
共 50 条
  • [21] COMPUTING PROBABILISTIC BISIMILARITY DISTANCES FOR PROBABILISTIC AUTOMATA
    Bacci, Giorgio
    Bacci, Giovanni
    Larsen, Kim G.
    Mardare, Radu
    Tang, Qiyi
    van Breugel, Franck
    LOGICAL METHODS IN COMPUTER SCIENCE, 2021, 17 (01) : 9:1 - 9:36
  • [22] Algorithms for computing the distances between unordered trees
    Liu, SM
    Tanaka, E
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1996, 79 (10): : 88 - 102
  • [23] Towards Computing Abstract Distances in Logic Programs
    Casso, Ignacio
    Morales, Jose F.
    Lopez-Garcia, Pedro
    V. Hermenegildo, Manuel
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (306): : 1 - 3
  • [24] Computing Branching Distances Using Quantitative Games
    Fahrenberg, Uli
    Legay, Axel
    Quaas, Karin
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2019, 2019, 11884 : 59 - 75
  • [25] ON COMPUTING DISTANCES BETWEEN LEAVES IN A COMPLETE TREE
    MILLER, RE
    ROSENBERG, AL
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1980, 8 (04) : 289 - 301
  • [26] A PROGRAM FOR COMPUTING ANGLES AND DISTANCES BETWEEN ATOMS
    ANDRIANOV, VI
    SOVIET PHYSICS CRYSTALLOGRAPHY, USSR, 1965, 10 (01): : 83 - +
  • [27] THE COMPLEXITY OF COMPUTING METRIC DISTANCES BETWEEN PARTITIONS
    DAY, WHE
    MATHEMATICAL SOCIAL SCIENCES, 1981, 1 (03) : 269 - 287
  • [28] Complexity of Computing Distances between Geometric Trees
    Feragen, Aasa
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, 2012, 7626 : 89 - 97
  • [29] A fast procedure for computing incremental growth distances
    Hong, SM
    Yeo, JH
    Park, HW
    ROBOTICA, 2000, 18 : 429 - 441
  • [30] On Computing Breakpoint Distances for Genomes with Duplicate Genes
    Shao, Mingfu
    Moret, Bernard M. E.
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2017, 24 (06) : 571 - 580
12345