activity
20132025
most citedSlim unicorns and uniform hyperbolicity for arc graphs and curve graphs

34 citations · 60 across the 7 of their papers we have counts for

collaborators
Showing 2016Show all

2 papers · 1 filter

math.GT2016★ 7 cited

Polynomial-time algorithms for the curve graph

Mark C. Bell, Richard C. H. Webb

We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves…

math.GT2016★ 3 cited

Applications of fast triangulation simplification

Mark C. Bell, Richard C. H. Webb

We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs…