Given a partially ordered set the convex sets of the partial order form an atomistic convex geometry and the height two partial orders form a subclass closed family. These two families correspond to one another as the minimal family that generates a convex family under the convex closure operation is always going to be a height two partial order. Consider the following height two family:

#{#{0} #{1} #{2} #{3} #{0 1 2} #{1 2 3}}

The convex closure of the above height two family is a family which contains all of the elements of the height two family plus those elements that are necessary to make the family convex:

#{#{0} #{1} #{2} #{3} #{0 1} #{0 2}
#{1 2} #{1 3} #{2 3} #{0 1 2} #{0 1 3}}

Certain partial orders can be both height two and convex. These include the dependency families which are the subsingleton closed nullfree rank two families. The dependency families correspond to the simple graphs in graph theory and they can also be produced from any atomistic height two order in which no element has more then two predecessors.