  It is shown that every 2-planar graph is quasiplanar, that is, if a simple
graph admits a drawing in the plane such that every edge is crossed at most
twice, then it also admits a drawing in which no three edges pairwise cross. We
further show that quasiplanarity is witnessed by a simple topological drawing,
that is, any two edges cross at most once and adjacent edges do not cross.
