Yurttas, S. OykuHall, Toby2024-04-242024-04-2420180004-97271755-1633https://doi.org/10.1017/S0004972718000308https://hdl.handle.net/11468/16375We 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(2)n(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.eninfo:eu-repo/semantics/openAccessGeometric IntersectionMulticurvesPunctured DiskDynnikov CoordinatesArticle981149158WOS:0004372155000182-s2.0-8504647695710.1017/S0004972718000308Q3Q3