1-Lipschitz Neural Distance Fields
Not on the map. Why?
Abstract (arXiv)
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 gradient as close to unit-norm as possible, thus reducing computation costs in iterative queries. As this loss function only needs a rough estimate of occupancy to be optimized, this means that the true distance function need not to be known. We are therefore able to compute neural implicit representations of even bad quality geometry such as noisy point clouds or triangle soups. We demonstrate that our methods is able to approximate the distance function of any closed or open surfaces or curves in the plane or in space, while still allowing sphere tracing or closest point projections to be performed robustly.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 33 of its 62 references that are in the map. First posted on arXiv 14 Jun 2024.
Builds on
33 of 62 references.
References · 33
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,689
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,238
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
- 2018Occupancy Networks: Learning 3D Reconstruction in Function Spacecited by 2,041
- 2018Learning Implicit Fields for Generative Shape Modelingcited by 1,060
- 2021Volume Rendering of Neural Implicit Surfacescited by 996
- 2020Implicit Geometric Regularization for Learning Shapescited by 710
- 2021Neural Fields in Visual Computing and Beyondcited by 540
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 415
- 2019SAL: Sign Agnostic Learning of Shapes from Raw Datacited by 390
- 2017Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networkscited by 311
21 more
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
- 2020Neural Unsigned Distance Fields for Implicit Function Learningcited by 265
- 2016Benefits of depth in neural networkscited by 250
- 2019Multi-Garment Net: Learning to Dress 3D People from Imagescited by 245
- 2016Thingi10K: A Dataset of 10,000 3D-Printing Modelscited by 183
- 2017Spectral Norm Regularization for Improving the Generalizability of Deep Learningcited by 182
- 2018Optimal approximation of continuous functions by very deep ReLU networkscited by 166
- 2020SALD: Sign Agnostic Learning with Derivativescited by 115
- 2021Orthogonalizing Convolutional Layers with the Cayley Transformcited by 105
- 2020Exactly Computing the Local Lipschitz Constant of ReLU Networkscited by 102
- 2022Learning Smooth Neural Functions via Lipschitz Regularizationcited by 86
- 2021A Dynamical System Perspective for Lipschitz Neural Networkscited by 60
- 2023A Unified Algebraic Perspective on Lipschitz Neural Networkscited by 60
- 2020Iso-Points: Optimizing Neural Implicit Surfaces with Hybrid Representationscited by 39
- 2022Almost-Orthogonal Layers for Efficient General-Purpose Lipschitz Networkscited by 39
- 2021Phase Transitions, Distance Functions, and Implicit Neural Representationscited by 38
- 2020Achieving robustness in classification using optimal transport with hinge regularizationcited by 27
- 2022ANISE: Assembly-based Neural Implicit Surface rEconstructioncited by 16
- 2022Spelunking the Deep: Guaranteed Queries on General Neural Implicit Surfaces via Range Analysiscited by 11
- 2023Exact Count of Boundary Pieces of ReLU Classifiers: Towards the Proper Complexity Measure for Classificationcited by 11
- 2023Robust One-Class Classification with Signed Distance Function using 1-Lipschitz Neural Networkscited by 10
Built on by
Citing papers per year: 2024: 1; 2025: 2; 2026: 6.
9 papers.
- 2024HotSpot: Signed Distance Function Optimization with an Asymptotically Sufficient Conditioncited by 8
- 2025Optimizing Rank for High-Fidelity Implicit Neural Representationscited by 8
- 2025SDFs from Unoriented Point Clouds using Neural Variational Heat Distancescited by 2
- 2026Generative Shape Reconstruction with Geometry-Guided Langevin Dynamicscited by 0
- 2026Medial Axis Aware Learning of Signed Distance Functionscited by 0
- 2026Points as Tori: Fast Pointwise Signed Distance for Point Cloudscited by 0
- 2026Implicit representations are dead. Long live explicit primitives!cited by 0
- 2026Observation-Conditioned Latent Energy Priors for Sparse Implicit Neural Shape Completioncited by 0
- 2026Surface Reconstruction from Range Scans Under Visibility Constraintscited by 0
- 2026Surface Reconstruction from Range Scans Under Visibility Constraints13 Oct 2026
- 2026Observation-Conditioned Latent Energy Priors for Sparse Implicit Neural Shape Completion3 Sep 2026
- 2026Implicit representations are dead. Long live explicit primitives!7 Aug 2026
- 2026Points as Tori: Fast Pointwise Signed Distance for Point Clouds18 Jul 2026
- 2026Medial Axis Aware Learning of Signed Distance Functions15 Apr 2026
- 2026Generative Shape Reconstruction with Geometry-Guided Langevin Dynamics27 Mar 2026
- 2025Optimizing Rank for High-Fidelity Implicit Neural Representations16 Dec 2025
- 2025SDFs from Unoriented Point Clouds using Neural Variational Heat Distances15 Apr 2025
- 2024HotSpot: Signed Distance Function Optimization with an Asymptotically Sufficient Condition21 Nov 2024