We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G= (V ,E), the algorithm produces an embedding for G in an Euclidean space E of any dimension. A two or three dimensional drawing of the graph is then obtained by projecting a higher-dimensional embedding into a two or three dimensional subspace of E. Such… (More)