Convex obstacle numbers of outerplanar graphs and bipartite permutation graphs

Radoslav Fulek, Noushin Saeedi, Deniz Sarioz

The disjoint convex obstacle number of a graph G is the smallest number h such that there is a set of h pairwise disjoint convex polygons (obstacles) and a set of n points in the p…