For example, Delaunay triangulation is a problem of finding a mesh of triangles in a set of points that meet certain properties. (See De Berg, et al, 1997, and also <a href="http://en.wikipedia.org/wiki/Delaunay_triangulation.)">http://en.wikipedia.org/wiki/Delaunay_triangulation.)</a> Because triangulation occurs in a vector space (i.e., 3D space), there is a natural way to divide up the computation into regions of the overall space that can be computed almost co