Region quadtrees and efficient neighbour finding techniques in Go

Region quadtrees are a special kind of quadtree that recursively subdivides a 2 dimensional space into 4 smaller and generally equal rectangular regions. A leaf node represents a rectangular region of an image in which all colors are equal or the color difference is under a given threshold. A quadtree can also be used to represent data fields with variable resolution.