S. Öykü Yurttas, Toby Hall
Published 2017-11-02Version 1
We present an algorithm for calculating the geometric intersection number of two multicurves on the $n$-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity $O(m^2n^4)$, where $m$ is the sum of the absolute values of the Dynnikov coordinates of the two multicurves. The main ingredient is an algorithm due to Cumplido for relaxing a multicurve.
Geometric intersection of curves on punctured disks
Counting components of an integral lamination
Geometric intersection number of simple closed curves on a surface and symplectic expansions of free groups
![QR code for arXiv:1711.00895 [math.GT]](http://oss.arxitics.com/images/favicon.svg)