SDFs from Unoriented Point Clouds using Neural Variational Heat Distances

Abstract We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from unoriented point clouds. To this end, we replace the commonly used eikonal equation with the heat method, carrying over to the neural domain what has long been standard practice for computing distances on discrete surfaces. This yields two convex optimisation problems for whose solution we employ neural networks: We first compute a neural approximation of the gradients of the unsigned distance field through a small time step of heat flow with weighted point cloud densities as initial data. Then, we use it to compute a neural approximation of the SDF. We prove that the underlying variational problems are well‐posed. Through numerical experiments, we demonstrate that our method provides state‐of‐the‐art surface reconstruction and consistent SDF gradients. Furthermore, we show in a proof‐of‐concept that it is accurate enough for solving a PDE on the zero‐level set.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2026-01-06
DOI
https://doi.org/10.1111/cgf.70296
Primary Topic
Generative Adversarial Networks and Image Synthesis
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SDFs from Unoriented Point Clouds using Neural Variational Heat Distances

F. Hartwig, Josua Sassen, Martin Rumpf, Mirela Ben‐Chen et al.
Computer Graphics Forum
Generative Adversarial Networks and Image Synthesis
article

SDFs from Unoriented Point Clouds using Neural Variational Heat Distances

F. Hartwig, Josua Sassen, Martin Rumpf, Mirela Ben‐Chen, Sergio Conti, Samuel Weidemaier
article en

Abstract

Abstract We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from unoriented point clouds. To this end, we replace the commonly used eikonal equation with the heat method, carrying over to the neural domain what has long been standard practice for computing distances on discrete surfaces. This yields two convex optimisation problems for whose solution we employ neural networks: We first compute a neural approximation of the gradients of the unsigned distance field through a small time step of heat flow with weighted point cloud densities as initial data. Then, we use it to compute a neural approximation of the SDF. We prove that the underlying variational problems are well‐posed. Through numerical experiments, we demonstrate that our method provides state‐of‐the‐art surface reconstruction and consistent SDF gradients. Furthermore, we show in a proof‐of‐concept that it is accurate enough for solving a PDE on the zero‐level set.

Computer Graphics Forum
University of Bonn (DE), Technion – Israel Institute of Technology (IL), CEA Paris-Saclay (FR)
European Commission, Deutsche Forschungsgemeinschaft, Hausdorff Center for Mathematics
Openalex Percentile: Top 100%
Generative Adversarial Networks and Image Synthesis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.