I’m looking for a fast, batched, GPU-based implementation of computing a signed distance field given an occupancy grid in 3D. Does anyone know of any? If not, what algorithm would you suggest for implementing one?
When you say signed distance, do you mean distance from a point in a region to the boundaries of said region?
Or do you mean distance between the boundaries of two separate regions?
I’m not really thinking of regions and boundaries, so I’m not sure how to answer. The input is a binary voxelgrid with values of 1 indicating occupied points and 0 everywhere else. I want each output cell to contain the distance to the nearest occupied point.