Intersections of multicurves from Dynnikov coordinates
Abstract
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(m2n4), 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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.