Before revision:  We obtain results on the maximum density , drawability of complete graphs, complexity of the recognition problem, and relationships with other families of beyond-planar graphs.
After revision:  We obtain results on the maximum density of k-gap-planar graphs, their relationship to other classes of beyond-planar graphs, characterization of k-gap-planar complete graphs, and the computational complexity of recognizing k-gap-planar graphs.