A combinatorial construction of a graph with automorphism group SO+(2n,2) O

A simple combinatorial construction is given which takes as its imput a regular graph of valency k such that the convex closure of two points at distance two is the complete bipartite graph K3,3 and whose output is a regular graph of valency 2k+1. It is shown that the sequence of graphs obtained by starting with the graph with one point and no edges and applying the construction recursively is the family of bipartite dual polar space of type DSO+(2n,2).