nickponline

I've encountered this problem many times and tried to solve it with different computer vision and algebra methods. Since it's easy to generate clean polygons and augment them a NN can be trained to undo it.

Ah yes quite right.

I think this problem is called the maximum-weight closure and can be solved as max flow. You want to find a cut between source (horse) so they were no out-going edges not in the cut (escape routes).