Three dimensional graph drawing with fixed vertices and one bend per   edge
  We prove that for every graph $G$, given fixed locations for the vertices of $G$ in $\mathbb{Z}^3$, there is a three-dimensional grid-drawing of $G$ with one bend per edge. The best previous bound was three bends per edge. 
David R. Wood
cs.CG cs.DM