Many nice results in graph theory involve the characterization of a graph class in terms of a set of forbidden obstructions. In this talk I will consider the problem of understanding whether a class of graph drawings can be characterized by a set of forbidden obstructions.  I will do an overview on interesting recent results that fall under this theme, but I will emphasize more on those related to geometric arrangements.