z-logo
Premium
Consistent Volumetric Discretizations Inside Self‐Intersecting Surfaces
Author(s) -
Sacht Leonardo,
Jacobson Alec,
Panozzo Daniele,
Schüller Christian,
SorkineHornung Olga
Publication year - 2013
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12181
Subject(s) - discretization , computation , smoothing , geometry processing , computer science , geodesic , computer graphics (images) , skinning , curvature , surface (topology) , pipeline (software) , algorithm , decimation , geometry , subdivision surface , polygon mesh , computational science , computer vision , mathematics , mathematical analysis , ecology , filter (signal processing) , biology , programming language
Decades 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.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here