arXiv · 2602.02907
VoroUDF: Meshing Unsigned Distance Fields with Voronoi Optimization
Abstract
We present VoroUDF, an algorithm for reconstructing high-quality triangle meshes from Unsigned Distance Fields (UDFs). Our algorithm supports non-manifold geometry, sharp features, and open boundaries, without relying on error-prone inside/outside estimation, restrictive look-up tables nor topologically noisy optimization. Unlike fixed-grid approaches, our Voronoi-based formulation optimizes a set of movable seeds that travel freely along the iso-surface, jointly minimizing a tangent-plane fitting energy, driven by a fixed set of surface samples queried once from the UDF and its gradient, and a repulsion energy that keeps the seeds evenly distributed. It achieves significantly improved topological consistency and geometric fidelity compared to existing methods, while producing lightweight meshes suitable for downstream real-time and interactive applications.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ningna Wang, Zilong Wang, Xiana Carrera, Xiaohu Guo, Silvia Sellán. 2026-09-20. VoroUDF: Meshing Unsigned Distance Fields with Voronoi Optimization. https://arxiv.org/abs/2602.02907
Cite the original work for its findings. Save a collection to share your selection of sources.