1-Lipschitz Neural Distance Fields
Guillaume Coiffier, Louis Bethune

TL;DR
This paper introduces a 1-Lipschitz neural network approach for robustly approximating signed distance functions, enabling reliable geometric queries even on noisy or incomplete data.
Contribution
It proposes a novel 1-Lipschitz neural distance function with a specialized loss, improving robustness and efficiency in geometric representations from imperfect data.
Findings
Robust distance approximation for noisy point clouds and triangle soups.
Enables efficient sphere tracing and closest point queries.
Works for both open and closed surfaces in 2D and 3D.
Abstract
Neural implicit surfaces are a promising tool for geometry processing that represent a solid object as the zero level set of a neural network. Usually trained to approximate a signed distance function of the considered object, these methods exhibit great visual fidelity and quality near the surface, yet their properties tend to degrade with distance, making geometrical queries hard to perform without the help of complex range analysis techniques. Based on recent advancements in Lipschitz neural networks, we introduce a new method for approximating the signed distance function of a given object. As our neural function is made 1- Lipschitz by construction, it cannot overestimate the distance, which guarantees robustness even far from the surface. Moreover, the 1-Lipschitz constraint allows us to use a different loss function, called the hinge-Kantorovitch-Rubinstein loss, which pushes the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
MethodsSparse Evolutionary Training
