- drawing directed graphs difficult due to scale but
- 2D layouts in Euclidean space are insufficient for large graphs:
number of nodes grows exponentially from root while circumference
of circle grows only polynomially. Result: clutter
example of 2D layout using 'otter'
- 2D layout algorithms converge slowly for large graphs