{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/robust-zero-level-set-extraction-from","title":"Robust Zero Level-Set Extraction from Unsigned Distance Fields Based on Double Covering","arxiv_id":"2310.03431","date":"2023-10-05","proceeding":null,"authors":["Fei Hou","Xuhui Chen","Wencheng Wang","Hong Qin","Ying He"],"abstract":"In this paper, we propose a new method, called DoubleCoverUDF, for extracting the zero level-set from unsigned distance fields (UDFs). DoubleCoverUDF takes a learned UDF and a user-specified parameter $r$ (a small positive real number) as input and extracts an iso-surface with an iso-value $r$ using the conventional marching cubes algorithm. We show that the computed iso-surface is the boundary of the $r$-offset volume of the target zero level-set $S$, which is an orientable manifold, regardless of the topology of $S$. Next, the algorithm computes a covering map to project the boundary mesh onto $S$, preserving the mesh's topology and avoiding folding. If $S$ is an orientable manifold surface, our algorithm separates the double-layered mesh into a single layer using a robust minimum-cut post-processing step. Otherwise, it keeps the double-layered mesh as the output. We validate our algorithm by reconstructing 3D surfaces of open models and demonstrate its efficacy and effectiveness on synthetic models and benchmark datasets. Our experimental results confirm that our method is robust and produces meshes with better quality in terms of both visual evaluation and quantitative measures than existing UDF-based methods. The source code is available at https://github.com/jjjkkyz/DCUDF.","url_abs":"https://arxiv.org/abs/2310.03431v3","url_pdf":"https://arxiv.org/pdf/2310.03431v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"robust-zero-level-set-extraction-from","repo_url":"https://github.com/jjjkkyz/dcudf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2310.03431","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.03431"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jjjkkyz/dcudf","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_draft_wrong":1,"unverified":3},"by_repo_kind":{"official":{"samples":4,"ran":1,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"bb0e12df9c0d2a05","entry":"get_embedder","repo":"jjjkkyz/dcudf","repo_kind":"official","path":"models/embedder.py","file_url":"https://github.com/jjjkkyz/dcudf/blob/HEAD/models/embedder.py","link_basis":"harvester_set","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"bb0e12df9c0d2a05"}},{"code_sha256_prefix":"e4b0be82c8c27dee","entry":"compute_neighbor","repo":"jjjkkyz/dcudf","repo_kind":"official","path":"dcudf/mesh_cut.py","file_url":"https://github.com/jjjkkyz/dcudf/blob/HEAD/dcudf/mesh_cut.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e4b0be82c8c27dee"}},{"code_sha256_prefix":"80b4d6875e00c7a9","entry":"laplacian_calculation","repo":"jjjkkyz/dcudf","repo_kind":"official","path":"dcudf/mesh_extraction.py","file_url":"https://github.com/jjjkkyz/dcudf/blob/HEAD/dcudf/mesh_extraction.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"80b4d6875e00c7a9"}},{"code_sha256_prefix":"e6481dd2bf3886c4","entry":"laplacian_step","repo":"jjjkkyz/dcudf","repo_kind":"official","path":"dcudf/mesh_extraction.py","file_url":"https://github.com/jjjkkyz/dcudf/blob/HEAD/dcudf/mesh_extraction.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e6481dd2bf3886c4"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}