曲线复形中的有效测地线及距离的有效算法
Efficient geodesics and an effective algorithm for distance in the complex of curves
摘要：
本文给出了一个求曲线复形两顶点间距离的算法。虽然已经存在这样的算法，例如Leasure，Shackleton和Webb，但我们的方法是新的，简单的，并且对于计算机可访问的所有距离都更有效。我们的方法给出了一个新的首选有限集的测地线之间的任何两个顶点的复杂，称为有效测地线，这是不同的紧测地线Masur和Minsky介绍。
英文摘要：
We give an algorithm for determining the distance between two vertices of the complex of curves. While there already exist such algorithms, for example by Leasure, Shackleton, and Webb, our approach is new, simple, and more effective for all distances accessible by computer. Our method gives a new preferred finite set of geodesics between any two vertices of the complex, called efficient geodesics, which are different from the tight geodesics introduced by Masur and Minsky.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
