This would be somewhat easier if the forest had 'holes' in it, right? But then it wouldn't be much of a (convex) forest, would it.. (I'm assuming the forest tot

This would be somewhat easier if the forest had 'holes' in it, right? But then it wouldn't be much of a (convex) forest, would it.. (I'm assuming the forest totally covers the area it occupies.) It would be interesting to find the computational complexity of escape as a function of the geometry (a set of n vertices)