One of the possible connections between processors is a hypercube. The simplest case of a hypercube - a 4-vertex square - can be naturally represented on a 2-D page. To represent a 3-dimensional (or higher-dimensional) hypercube, we must project additional dimensions onto a 2-D page. In general, when we project a multi-D space into a 2-D plane, different points project into the same one. To get the best visualization, we must select a projection in such a way that the projections of different points are as distant from each other as possible. In this paper, we formalize and solve the corresponding optimization problem. Thus, we show what is the best way of drawing a cube.