Suppose that we want to build a kd-tree out of these data points. We begin by choosing some node
(which we'll say is at (x0, y0) for notational simplicity) and splitting the data set into two groups, one
of points whose x components are less than the splitting node's, and one of points whose x components
are at least as large as the splitting node's. We can visualize the split like this: