  Unsigned Distance Fields (UDFs) can be used to represent non-watertight
surfaces. However, current approaches to converting them into explicit meshes
tend to either be expensive or to degrade the accuracy. Here, we extend the
marching cube algorithm to handle UDFs, both fast and accurately. Moreover, our
approach to surface extraction is differentiable, which is key to using
pretrained UDF networks to fit sparse data.
