Voronoi-Assisted Diffusion for Computing Unsigned Distance Fields from Unoriented Points

• URL: http://arxiv.org/abs/2510.12524v1
• Date: Tue, 14 Oct 2025 13:49:53 GMT
• Title: Voronoi-Assisted Diffusion for Computing Unsigned Distance Fields from Unoriented Points
• Authors: Jiayi Kong, Chen Zong, Junkai Deng, Xuhui Chen, Fei Hou, Shiqing Xin, Junhui Hou, Chen Qian, Ying He,
• Abstract summary: Voronoi-Assisted Diffusion (VAD) is a lightweight, network-free method for computing Unsigned Distance Fields (UDFs)<n>VAD robustly handles watertight and open surfaces, as well as complex non-manifold and non-orientable geometries.
• Score: 59.493891955043914
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Unsigned Distance Fields (UDFs) provide a flexible representation for 3D shapes with arbitrary topology, including open and closed surfaces, orientable and non-orientable geometries, and non-manifold structures. While recent neural approaches have shown promise in learning UDFs, they often suffer from numerical instability, high computational cost, and limited controllability. We present a lightweight, network-free method, Voronoi-Assisted Diffusion (VAD), for computing UDFs directly from unoriented point clouds. Our approach begins by assigning bi-directional normals to input points, guided by two Voronoi-based geometric criteria encoded in an energy function for optimal alignment. The aligned normals are then diffused to form an approximate UDF gradient field, which is subsequently integrated to recover the final UDF. Experiments demonstrate that VAD robustly handles watertight and open surfaces, as well as complex non-manifold and non-orientable geometries, while remaining computationally efficient and stable.

Related papers

• Neural Surface Detection for Unsigned Distance Fields [51.77214039267625]
  We introduce a deep-learning approach to taking a UDF and turning it locally into an SDF, so that it can be effectively triangulated using existing algorithms. We show that it achieves better accuracy in surface detection than existing methods. We also demonstrate the flexibily of the method by using it in conjunction with DualMeshUDF, a state of the art dual meshing method that can operate on UDFs.
  arXiv  Detail & Related papers  (2024-07-25T20:31:40Z)
• Details Enhancement in Unsigned Distance Field Learning for High-fidelity 3D Surface Reconstruction [26.35134181204119]
  We propose Details Enhanced UDF (DEUDF) learning that integrates normal alignment and the SIREN network.<n>Our computational results demonstrate that DEUDF outperforms existing UDF learning methods in both accuracy and the quality of reconstructed surfaces.
  arXiv  Detail & Related papers  (2024-06-01T07:52:26Z)
• Probabilistic Directed Distance Fields for Ray-Based Shape Representations [8.134429779950658]
  Directed Distance Fields (DDFs) are a novel neural shape representation that builds upon classical distance fields.<n>We show how to model inherent discontinuities in the underlying field.<n>We then apply DDFs to several applications, including single-shape fitting, generative modelling, and single-image 3D reconstruction.
  arXiv  Detail & Related papers  (2024-04-13T21:02:49Z)
• UDiFF: Generating Conditional Unsigned Distance Fields with Optimal Wavelet Diffusion [51.31220416754788]
  We present UDiFF, a 3D diffusion model for unsigned distance fields (UDFs) which is capable to generate textured 3D shapes with open surfaces from text conditions or unconditionally. Our key idea is to generate UDFs in spatial-frequency domain with an optimal wavelet transformation, which produces a compact representation space for UDF generation.
  arXiv  Detail & Related papers  (2024-04-10T09:24:54Z)
• Unsupervised Occupancy Learning from Sparse Point Cloud [8.732260277121547]
  Implicit Neural Representations have gained prominence as a powerful framework for capturing complex data modalities. In this paper, we propose a method to infer occupancy fields instead of Neural Signed Distance Functions. We highlight its capacity to improve implicit shape inference with respect to baselines and the state-of-the-art using synthetic and real data.
  arXiv  Detail & Related papers  (2024-04-03T14:05:39Z)
• Unsigned Orthogonal Distance Fields: An Accurate Neural Implicit Representation for Diverse 3D Shapes [29.65562721329593]
  In this paper, we introduce a novel neural implicit representation based on unsigned distance fields (UDFs) In UODFs, the minimal unsigned distance from any spatial point to the shape surface is defined solely in one direction, contrasting with the multi-directional determination made by SDF and UDF. We verify the effectiveness of UODFs through a range of reconstruction examples, extending from watertight or non-watertight shapes to complex shapes.
  arXiv  Detail & Related papers  (2024-03-03T06:58:35Z)
• Surf-D: Generating High-Quality Surfaces of Arbitrary Topologies Using Diffusion Models [83.35835521670955]
  Surf-D is a novel method for generating high-quality 3D shapes as Surfaces with arbitrary topologies. We use the Unsigned Distance Field (UDF) as our surface representation to accommodate arbitrary topologies. We also propose a new pipeline that employs a point-based AutoEncoder to learn a compact and continuous latent space for accurately encoding UDF.
  arXiv  Detail & Related papers  (2023-11-28T18:56:01Z)
• GeoUDF: Surface Reconstruction from 3D Point Clouds via Geometry-guided Distance Representation [73.77505964222632]
  We present a learning-based method, namely GeoUDF, to tackle the problem of reconstructing a discrete surface from a sparse point cloud. To be specific, we propose a geometry-guided learning method for UDF and its gradient estimation. To extract triangle meshes from the predicted UDF, we propose a customized edge-based marching cube module.
  arXiv  Detail & Related papers  (2022-11-30T06:02:01Z)
• Gradient-SDF: A Semi-Implicit Surface Representation for 3D Reconstruction [53.315347543761426]
  Gradient-SDF is a novel representation for 3D geometry that combines the advantages of implict and explicit representations. By storing at every voxel both the signed distance field as well as its gradient vector field, we enhance the capability of implicit representations. We show that (1) the Gradient-SDF allows us to perform direct SDF tracking from depth images, using efficient storage schemes like hash maps, and that (2) the Gradient-SDF representation enables us to perform photometric bundle adjustment directly in a voxel representation.
  arXiv  Detail & Related papers  (2021-11-26T18:33:14Z)
• Deep Implicit Surface Point Prediction Networks [49.286550880464866]
  Deep neural representations of 3D shapes as implicit functions have been shown to produce high fidelity models. This paper presents a novel approach that models such surfaces using a new class of implicit representations called the closest surface-point (CSP) representation.
  arXiv  Detail & Related papers  (2021-06-10T14:31:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.