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.

翻译：无符号远程字段(UDFs) 可用于代表非水密表面。 但是, 将它们转换为显性梅西的当前方法要么昂贵,要么降低精度。 在这里, 我们扩展了行进立方算法, 以快速和准确地处理 UDF 。 此外, 我们的地表提取方法可以区分, 这对于使用经过预先训练的 UDF 网络以适应稀有数据至关重要 。