Conceptio › Archive › arXiv (OAI Expanded)
arXiv (OAI Expanded) open access

Voronoi-Assisted Optimization for Diffusing Unsigned Distance Fields from Unoriented Points

Kong, Jiayi et al. · arxiv_oai_expanded
arXiv (OAI Expanded) · Papers
Open Source ↗Direct PDF ↓
computer-vision-and-pattern-recognition
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2510.12524] Voronoi-Assisted Optimization for Diffusing Unsigned Distance Fields from Unoriented Points Skip to main content Search Submit Donate Log in Computer Science > Computer Vision and Pattern Recognition arXiv:2510.12524 (cs) [Submitted on 14 Oct 2025 ( v1 ), last revised 25 Aug 2026 (this version, v2)] Title: Voronoi-Assisted Optimization for Diffusing 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 View PDF HTML (experimental) 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 Optimization for Diffusing (VAD), to compute 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. Subjects: Computer Vision and Pattern Recognition (cs.CV) Cite as: arXiv:2510.12524 [cs.CV] (or arXiv:2510.12524v2 [cs.CV] for this version) https://doi.org/10.48550/arXiv.2510.12524 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Jiayi Kong [ view email ] [v1] Tue, 14 Oct 2025 13:49:53 UTC (46,011 KB) [v2] Tue, 25 Aug 2026 07:58:34 UTC (44,923 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Additional Features Audio Summary Current browse context: cs.CV < prev | next > new | recent | 2025-10 Change to browse by: cs References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

Record · ID 668336 · SHA-256 7424fd4e2a4f7ed9
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive