An SDF is a function which takes a position as an input, and outputs the distance from that position to the nearest part of a shape.
Questions tagged [signed-distance-field]
25 questions
14
votes
1 answer
Is Jump Flood Algorithm Separable?
JFA (the algorithm described here: http://www.comp.nus.edu.sg/~tants/jfa/i3d06.pdf) can be used to get an approximation of a Voronoi diagram, or a distance transform. It does so in logarithmic time based on the size of the resulting image, not on…

Alan Wolfe
- 7,801
- 3
- 30
- 76
3
votes
0 answers
Merging/Clipping Signed Distance Fields
I have multiple separate shapes for which I have generated signed distance fields by merging and clipping them against each other. Is there a generic analytical solution for merge and clip operations of signed distance fields?
For example, the…

MooseBoys
- 131
- 3
2
votes
0 answers
Memory footprint for 3D convolutions on signed distance fields vs. voxel grids
I am reading NVIDIA's Get3D paper in which they train a ML model to generate 3D models. They mention in "Related Work":
Early approaches aimed to directly extend the 2D [Convolutional Neural Network] generators to 3D voxel grids, but the high…

Nopx
- 121
- 1
0
votes
0 answers
Good rectangular covering of an SDF
Perhaps this is more computational geometry, but here goes:
I have a 2D SDF describing my shape, but it's fine to think of it as a black/white image (black="inside" white="outside").
I want to generate a small set of rectangles (say, 8 of them)…

jwd
- 133
- 5