Which graphs can be drawn using straight lines with no disjoint edges? What is the class of graphs that can be drawn using only straight lines with no two edges disjoint? Edges are disjoint when they don't cross and they don't share a vertex. Vertices should be in general position (no three on a line).
I know that for such graphs it is true that  $|E|\leq |V|$. But that's only a necessary, not a sufficient condition.
I have some other partial observations.
You can draw an odd cycle:

Which you can use to draw arbitrarily long path (deleting one edge for even path or rotating it a little for odd path).
You can't draw an even cycle (proved by @Steve Kass bellow):

You can't have multiple cycles in the same component of the graph (leads to $|E|>|V|$).
And you probably can't have two cycles in different components either?
Vertex degrees are unlimited (all edges of a star share the central vertex).
You can add many edges to the cycles:

Can you see or do you know any general rule?
I suspect that all these graphs are isomorphic to some subgraph of an odd cycle with additional edges to the center such as at the last image. Counterexample to this would also be welcome.
 A: A further result has been added below:
You may want to require that distinct edges intersect in at at most one point. Without this additional assumption, even cycles can be drawn in the way you describe. (Take your A-B-C-D graph and move A and B to the edge CD, with A closer to C.)
With this extra requirement, you definitely can’t draw an even cycle.
Suppose to the contrary, and let the cycle be $v_1v_2\cdots v_{2k} v_1$. Edges $v_1v_2$ and $v_3v_4$ cross, and with the extra requirement, $v_1$, $v_2$, and $v_3$ can’t be collinear (assuming coincident vertices are also disallowed). WLOG, assume the edge $v_1v_2$ is horizontal and $v_3$ is above the line through $v_1$ and $v_2$. Then $v_4$ is necessarily below that line, $v_5$ is above, and so on. But then $v_{2k}$ and $v_3$ are on opposite sides of that line, so $v_2v_3$ and $v_{2k}v_1$ are disjoint.
Added, based on discrete’s addition to the question:
Let $G$ be a graph that can be drawn without disjoint edges. Then no vertex of $G$ can have 3 neighbors, each of which has degree at least 2.
Proof: Suppose $G$ is drawn without disjoint edges, and $v$ is adjacent to $a$, $b$, and $c$, each of degree at least $2$. We will obtain a contradiction.
[Idea of proof: The three edges $av$, $bv$, and $cv$ must all lie in one half-plane with $v$ on its boundary, and the “middle” vertex cannot have another edge that intersects the other two, as required.]
Consider the half-planes of $\mathbb{R}^2$ that are on the two sides of the line through $a$ and $v$. Except for $av$, any edge incident on $a$ or $v$ lies entirely within just one of these half-planes (the one containing its vertex that isn’t $a$ or $v$). In particular, edges $vb$ and $vc$ each lie within one of these half-planes, and so does the edge from vertex $a$ that is not the edge $av$. The latter edge must intersect both $ab$ and $ac$, so $b$ and $c$ must be in the same half-plane with respect to $av$. Similarly, $a$ and $c$ must be in the same half-plane with respect to $bv$, and $a$ and $b$ must be in the same half-plane with respect to $cv$. This is impossible. If $b$ and $c$ are in the same half-plane with respect to $av$, then either $0<\angle avb < \angle avc \le \pi$ or $0<\angle avc < \angle avb \le \pi$, and the “middle” edge of the larger angle leaves one vertex in each of the half-planes it creates. 
