Optimal transport with convex obstacle

We consider the Monge transportation problem when the cost is the squared geodesic distance around a convex obstacle. We show that there exists at least one—and in general infinitely many—optimal transport maps.