I am working with signed/unsigned distance fields (SDFs/UDFs). I can render a mesh out of signed distances using Marching Cubes. But rendering a mesh out of unsigned distances also works using Marching Cubes, and I wonder why?
I am aware of, for example, this paper (DUDE: Deep Unsigned Distance Embeddings), which says that unsigned distance fields can work within the Marching Cubes environment, but as far as I understand, the algorithm discovers the boundary of the shape by finding out if points of a cube are inside or outside of the shape. How is this implemented when using unsigned distance fields where only positive distance values are present?
I would greatly appreciate an explanation of how the marching cube algorithm works in terms of unsigned distances.
Regarding the Marching Cubes implementation I used the one from DeepSDF (DeepSDF Marching Cubes Implementation), which itself uses skimage.measure.marching_cubes_lewiner
Thanks in advance!