To cut or to fill

We present a novel algorithm for simplifying the topology of a 3D shape, which is characterized by the number of connected components, handles, and cavities. Existing methods either limit their modifications to be only cutting or only filling, or take a heuristic approach to decide where to cut or fill. We consider the problem of finding a globally optimal set of cuts and fills that achieve the simplest topology while minimizing geometric changes. We show that the problem can be formulated as graph labelling, and we solve it by a transformation to the Node-Weighted Steiner Tree problem. When tested on examples with varying levels of topological complexity, the algorithm shows notable improvement over existing simplification methods in both topological simplicity and geometric distortions.

[1]  Tao Ju,et al.  Topology-constrained surface reconstruction from cross-sections , 2015, ACM Trans. Graph..

[2]  Xiao Han,et al.  A Topology Preserving Level Set Method for Geometric Deformable Models , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  R. Ho.  Algebraic Topology , 2022 .

[4]  James Vanderhyde,et al.  Extraction of topologically simple isosurfaces from volume datasets , 2003, IEEE Visualization, 2003. VIS 2003..

[5]  Dimitris Samaras,et al.  Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images , 2008, Comput. Vis. Image Underst..

[6]  Tao Ju,et al.  Robust optimization for topological surface reconstruction , 2018, ACM Trans. Graph..

[7]  Ulrich Bauer,et al.  Homological reconstruction and simplification in R3 , 2013, SoCG '13.

[8]  Olga Veksler,et al.  Fast approximate energy minimization via graph cuts , 2001, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[9]  Marco Attene,et al.  Polygon mesh repairing: An application perspective , 2013, CSUR.

[10]  Shi-Min Hu,et al.  Topology Repair of Solid Models Using Skeletons , 2007, IEEE Transactions on Visualization and Computer Graphics.

[11]  Florent Ségonne,et al.  Active Contours Under Topology Control—Genus Preserving Level Sets , 2008, International Journal of Computer Vision.

[12]  Mathieu Desbrun,et al.  Removing excess topology from isosurfaces , 2004, TOGS.

[13]  Markus Leitner,et al.  A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems , 2018, INFORMS J. Comput..

[14]  Tao Ju,et al.  Topology-controlled reconstruction of multi-labelled domains from cross-sections , 2017, ACM Trans. Graph..

[15]  Gil Shklarski,et al.  Interactive topology-aware surface reconstruction , 2007, ACM Trans. Graph..

[16]  Leif Kobbelt,et al.  Isosurface reconstruction with topology control , 2002, 10th Pacific Conference on Computer Graphics and Applications, 2002. Proceedings..

[17]  Rainer Goebel,et al.  An Efficient Algorithm for Topologically Correct Segmentation of the Cortical Sheet in Anatomical MR Volumes , 2001, NeuroImage.

[18]  Erin W. Chambers,et al.  Some Heuristics for the Homological Simplification Problem , 2018, CCCG.

[19]  Greg Turk,et al.  Simplification and Repair of Polygonal Models Using Volumetric Techniques , 2003, IEEE Trans. Vis. Comput. Graph..

[20]  Ulrich Bauer,et al.  Distributed Computation of Persistent Homology , 2014, ALENEX.

[21]  James M. Rehg,et al.  Terrain Synthesis from Digital Elevation Models , 2007, IEEE Transactions on Visualization and Computer Graphics.

[22]  Bruce Fischl,et al.  Geometrically Accurate Topology-Correction of Cortical Surfaces Using Nonseparating Loops , 2007, IEEE Transactions on Medical Imaging.

[23]  Richard M. Leahy,et al.  Automated graph-based analysis and correction of cortical volume topology , 2001, IEEE Transactions on Medical Imaging.

[24]  Shi-Min Hu,et al.  Editing the topology of 3D models by sketching , 2007, ACM Trans. Graph..

[25]  Daniel Cohen-Or,et al.  Morfit: interactive surface reconstruction from incomplete point clouds with curve-driven topology and geometry control , 2014, ACM Trans. Graph..

[26]  Jerry L. Prince,et al.  Topology correction in brain cortex segmentation using a multiscale, graph-based algorithm , 2002, IEEE Transactions on Medical Imaging.

[27]  Ulrich Bauer,et al.  Homological reconstruction and simplification in R3 , 2013, SoCG '13.

[28]  D. Cohen-Or,et al.  Interactive topology-aware surface reconstruction , 2007, ACM Trans. Graph..

[29]  Daniel Cohen-Or,et al.  Competing Fronts for Coarse–to–Fine Surface Reconstruction , 2006, Comput. Graph. Forum.

[30]  Lin Chen,et al.  Automated Topology Correction for Human Brain Segmentation , 2006, MICCAI.

[31]  Hans-Peter Seidel,et al.  Design and volume optimization of space structures , 2017, ACM Trans. Graph..