#### Filter Results:

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Mark C. Bell
- ArXiv
- 2016

We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve.

- Mark C. Bell, Richard C. H. Webb
- ArXiv
- 2016

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 in polynomial time in the bit-size of the two edge vectors. In its simplest instances, this algorithm works by finding the minimal position of the two curves. We achieve this by… (More)

- ‹
- 1
- ›