Consistent Volumetric Discretizations Inside Self-Intersecting Surfaces

Simple item page
dc.contributor.authorSacht, Leonardoen_US
dc.contributor.authorJacobson, Alecen_US
dc.contributor.authorPanozzo, Danieleen_US
dc.contributor.authorSchüller, Christianen_US
dc.contributor.authorSorkine-Hornung, Olgaen_US
dc.contributor.editorYaron Lipman and Hao Zhangen_US
dc.date.accessioned2015-02-28T15:51:08Z
dc.date.available2015-02-28T15:51:08Z
dc.date.issued2013en_US
dc.description.abstractDecades of research have culminated in a robust geometry processing pipeline for surfaces. Most steps in this pipeline, like deformation, smoothing, subdivision and decimation, may create self-intersections. Volumetric processing of solid shapes then becomes difficult, because obtaining a correct volumetric discretization is impossible: existing tet-meshing methods require watertight input. We propose an algorithm that produces a tetrahedral mesh that overlaps itself consistently with the self-intersections in the input surface. This enables volumetric processing on self-intersecting models. We leverage conformalized mean-curvature flow, which removes self-intersections, and define an intrinsically similar reverse flow, which prevents them. We tetrahedralize the resulting surface and map the mesh inside the original surface. We demonstrate the effectiveness of our method with applications to automatic skinning weight computation, physically based simulation and geodesic distance computation.en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.identifier.issn1467-8659en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12181en_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltd.en_US
dc.titleConsistent Volumetric Discretizations Inside Self-Intersecting Surfacesen_US
Files
Collections
32-Issue 5
SGP13: Eurographics Symposium on Geometry Processing (CGF 32-5)