Linear-Volume 3D Grid Drawings of Planar Graphs

For every planar graph $G$ on $n$ vertices, determine whether there is an injective placement of its vertices at points of a three-dimensional integer grid such that straight edges do not cross and the bounding-box volume is $O(n)$.