Publication

MeshUDF: Fast and Differentiable Meshing of Unsigned Distance Field Networks

Pascal Fua, Benoît Alain René Guillard, Federico Stella
2022
Conference Papers

Abstract

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.

Official source

https://infoscience.epfl.ch/entities/publication/641d93cc-52bc-4194-9f80-71a14b51066d

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

MeshUDF: Fast and Differentiable Meshing of Unsigned Distance Field Networks

Chat with Graph Search

The time-domain Cartesian multipole expansion of electromagnetic fields

Beam homogeneity of caesium seeded SPIDER using a direct beamlet current measurement

Preliminary Design of a High Current R&W TF Coil Conductor for the EU DEMO