Before revision:  Using our improved algorithm for minimum cuts in disk graphs, we can solve the barrier resilience problem in O(n^{3/2}   n) expected time.
After revision:  Using our improved algorithm for minimum cuts in disk graphs, we can solve the barrier resilience problem in O(n^{3/2}  \text{polylog n) expected time.