Chen, JiaGopi, MeenakshisundaramAlliez, Pierre and Pellacini, Fabio2019-05-052019-05-0520191467-8659https://doi.org/10.1111/cgf.13641https://diglib.eg.org:443/handle/10.1111/cgf13641This work presents a shape decomposition algorithm to partition a complex high genus surface into simple primitives, each of which is a torus. First, using a novel iterative algorithm, handle and tunnel fundamental cycles on the surface are progressively localized. Then, the problem of computing the splitting cycles that produce such a tori decomposition is posed as a min-cut problem on the mesh's dual graph with earlier computed tunnels as source and target. The edge weights for the min-cut problem are designed for the cut to be geometry-aware. We present an implementation and demonstrate the results of our algorithm on numerous examples.10.1111/cgf.13641331-341