A hyperbolic tree defines a graph drawing method inspired by hyperbolic geometry.

Displaying hierarchical data as a tree suffers from visual clutter as the number of nodes per level can grow exponentially. For a simple binary tree, the maximum number of nodes at a level n is 2n, while the number of nodes for larger trees grows much more quickly.

Drawing the tree as a node-link diagram thus requires exponential amounts of space to be displayed.