Cops and Robbers on intersection graphs

The cop number of a graph G is the smallest k such that k cops win the game of cops and robber on G. We investigate the maximum cop number of geometric intersection graphs, which are graphs whose vertices are represented by geometric shapes and edges by their intersections. We establish the following dichotomy for previously studied classes of intersection graphs: