\indent we will review permutation sequences and allowable permutation sequences and the theorem that every allowable permutation sequence can be realized by an arrangement of pseudolines. \indent we introduce double permutation sequences which provide a combinatorial encoding of arrangements of convex sets in the plane. we shall also review the notion of a topological affine plane and several of its properties. in particular, we show that for every allowable double permutation sequence, there is a corresponding universal topological affine plane p, i.e. any finite arrangement of pseudolines is isomorphic to some arrangement of finitely many lines of p, and that every allowable double permutation sequence can be realized by an arrangement of simply connected sets and pseudoline double tangenets to every pair of these sets. we conclude with some recent results using these methods. \indent all of this is joint work with jacob e. goodman and some involves numerous other people including raghavan dhandapani, adreas holsmen, shakhar smorodinsky, raphael wenger, and tudor zamfirescu.