3D Minimum-Bend Orthogonal Graph Drawings

For every graph $G$ with maximum degree $\Delta(G)\leq6$, determine whether $G$ has a crossing-free drawing in the three-dimensional integer grid in which vertices are grid points, edges are axis-parallel polygonal chains, and every edge has at most two bends.