Atalan,F.Yurttaş,S.Ö.Mathematics2024-07-052024-07-05202200035-759610.1216/RMJ.2022.52.19572-s2.0-85146265023https://doi.org/10.1216/RMJ.2022.52.1957https://hdl.handle.net/20.500.14411/4061Let Ng,n denote a nonorientable surface of genus g with n punctures and one boundary component. We give an algorithm to calculate the geometric intersection number of an arbitrary multicurve L with so-called relaxed curves in Ng,n making use of measured π1-train tracks. The algorithm proceeds by the repeated application of three moves which take as input the measures of L and produces as output a multicurve L′ which is minimal with respect to each of the relaxed curves. The last step of the algorithm calculates the number of intersections between L′ and the relaxed curves. © Rocky Mountain Mathematics Consortium.eninfo:eu-repo/semantics/closedAccessgeometric intersectionmulticurvesπ₁-train tracksArticleQ352619571967