  We study subclasses of grid intersection graphs from the perspective of order
dimension. We show that partial orders of height two whose comparability graph
is a grid intersection graph have order dimension at most four. Starting from
this observation we provide a comprehensive study of classes of graphs between
grid intersection graphs and bipartite permutation graphs and the containment
relation on these classes. Order dimension plays a role in many arguments.
