This is the basic definition of one point attractor on a grid of points. [GHX: 0.8.0066] Here, the fundamentals of data tree matching can be studied. A hexagonal grid is exploded into points and new polygons are created there. Instead of a standard point distance relation to polygon size, this time the distance factor affects the rotational angle of these polygons. Although the structure of data trees is getting complicated, this has no difficulty in such definition, because the operational complexity is still very simple. This means, we might use complex data trees, however, the definition itself should remain simple; allowing us enough CPU for sketching.