{"paper":{"title":"A graph-theoretical approach for the computation of connected iso-surfaces based on volumetric data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abdulaziz Ali, Dieter Bothe","submitted_at":"2014-02-13T17:58:51Z","abstract_excerpt":"The existing combinatorial methods for iso-surface computation are efficient for pure visualization purposes, but it is known that the resulting iso-surfaces can have holes, and topological problems like missing or wrong connectivity can appear. To avoid such problems, we introduce a graph-theoretical method for the computation of iso-surfaces on cuboid meshes in $\\mathbb{R}^3$. The method for the generation of iso-surfaces employs labeled cuboid graphs $G(V,E,\\mathcal{F})$ such that $V$ is the set of vertices of a cuboid $C\\subset\\mathbb{R}^3$, $E$ is the set of edges of $C$ and $\\mathcal{F}\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3236","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}