Show simple item record

dc.contributor.authorZint, Danielen_US
dc.contributor.authorGrosso, Robertoen_US
dc.contributor.authorGürtler, Philippen_US
dc.contributor.editorPelechano, Nuriaen_US
dc.contributor.editorVanderhaeghe, Daviden_US
dc.description.abstractThere 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.en_US
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.subjectCCS Concepts: Computing methodologies --> Shape analysis; Mesh geometry models; Parallel algorithms
dc.subjectComputing methodologies
dc.subjectShape analysis
dc.subjectMesh geometry models
dc.subjectParallel algorithms
dc.titleResolving Non-Manifoldness on Meshes from Dual Marching Cubesen_US
dc.description.seriesinformationEurographics 2022 - Short Papers
dc.description.sectionheadersGeometry and Shape
dc.identifier.pages4 pages

Files in this item


This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International License
Except where otherwise noted, this item's license is described as Attribution 4.0 International License