This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divides a graph into a set of smaller subgraphs, and then draws each subgraph in a 2D plane. Finally, a 3D drawing of the graph is constructed by combining each plane, satisfying defined criteria. The framework is very flexible. Algorithms that follow this framework vary in computational complexity, depending on the type of graph and the optimisation criteria that are used. The resulting drawing may reduce visual complexity, occlusion and easier to navigate. We address new optimisation problems arising from the framework and provide simple approaches. Preliminary results suggest that the new framework can be useful for visual analysis of large and complex networks such as social networks and biological networks.