Alternatively, a flow algorithm could use the most recent previously-found apparent horizon as an initial guess. In this case
the algorithm would have only local convergence (in particular, it would probably fail to find a new outermost MOTS that
appeared well outside the previously-found MOTS). However, the algorithm would only need to flow the surface a small
distance, so the algorithm should be fairly fast.