  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.
