Computing the Geometric Intersection Number of Curves

DOI10.4230/LIPIcs.SoCG.2017.35zbMath1436.57019arXiv1511.09327OpenAlexW3124439981WikidataQ126672418 ScholiaQ126672418MaRDI QIDQ4580110

Francis Lazarus, Vincent Despré

Publication date: 13 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.09327

zbMATH Keywords

intersection numbercomputational topologycurves on surfacescombinatorial geodesic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Intersection homology and cohomology in algebraic topology (55N33) 2-dimensional topology (including mapping class groups of surfaces, Teichmüller theory, curve complexes, etc.) (57K20) Computational aspects of digital topology (68U03)

Related Items (5)

Almost simple geodesics on the triply-punctured sphere ⋮ Geometric intersections of loops on surfaces ⋮ Algorithm for filling curves on surfaces ⋮ Algorithms for contractibility of compressed curves on 3-manifold boundaries ⋮ Topologically trivial closed walks in directed surface graphs

This page was built for publication: Computing the Geometric Intersection Number of Curves