It would do just fine - but that's because OP is essentially grabbing on the intuition behind Visibility Graph search, which is (or was) a very common path planning algorithm using just obstacle boundaries.

The algorithm in a maze would just use "intersections" as successors, rather than "Next next step down the hall".

This is, in fact, an optimal search algorithm for this problem, and scales much better than any grid search in this case.