Zint, DanielGrosso, RobertoGürtler, PhilippPelechano, NuriaVanderhaeghe, David2022-04-222022-04-222022978-3-03868-169-41017-4656https://doi.org/10.2312/egs.20221029https://diglib.eg.org:443/handle/10.2312/egs20221029There are several methods that reconstruct surfaces from volume data by generating triangle or quad meshes on the dual of the uniform grid. Those methods often provide meshes with better quality than the famous marching cubes. However, they have a common issue: the meshes are not guaranteed to be manifold. We address this issue by presenting a post-processing routine that resolves all non-manifold edges with local refinement. New vertices are positioned on the trilinear interpolant. We verify our method on a wide range of data sets and show that we are capable of resolving all non-manifold issues.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies --> Shape analysis; Mesh geometry models; Parallel algorithmsComputing methodologiesShape analysisMesh geometry modelsParallel algorithms10.2312/egs.2022102945-484 pages