Hierarchical Methods: The N-level method
A unit square in Euclidean space is divided in equal-size squares
Each is node is assigned to one of the S12 squares
Each of the S12 squares can be subdivided again (S2)
The scale of the final graph is the product of the scales used for each level
The length of an edge is roughly determined by the edge level
Nodes are only of one type