#include <MFBinaryTree.h>
An MFBinaryTree reduces the quadratic complexity of finding the balls which are within a distance R of a point. At first balls are added to the root. When the number of balls exceeds a parameter value the root is split into two boxes, and balls are moved into the two subboxes according to which they lie in. Each node (or leaf, MFErrorHandler e); has a bounding box, and as balls are added to the box or it's children the bounding box is updated.