Multi-threaded signed distance field computation based on spatial partition

A problem with distance fields is that the performance cost for computing a distance field is quite extensive. The main contribution of this paper is proposing multi-threaded signed distance fields based on special partition which accelerate the computing speed. Here we use the uniform grid to divide the space. We convert distance values to color and create rendering slices along x, y, z axis to visualize the computing result of signed distance fields. Besides we achieve loading and saving OBJ and STL format models. We achieve one to two orders of magnitude in the running time when comparing with brute force method.