A drawing of a graph in the plane is pseudolinear if every edge can be extended to an open arc that separates the plane into two regions such that any two such arcs have exactly one point in common and that common point is a crossing. We characterize pseudolinear drawings in terms of forbidden subconfigurations. A polynomial time algorithm for finding either the extensions or a forbidden subconfiguration is also given.