[edwdtlut] Binary fingerprint

Modify the point-growth algorithm so a point branches in at most 3 directions, never 4.  It thus becomes a binary tree.

In the style as before, create a large planar dense binary tree.  I suspect nodes of equal depth form diamonds around the center.

Given only the connection information of such a tree, I suspect laying it out back to fit on a grid on a plane is computationally difficult.

Also consider three dimensions.