Premium
Geometry Aware Tori Decomposition
Author(s) -
Chen Jia,
Gopi M.
Publication year - 2019
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.13641
Subject(s) - torus , partition (number theory) , decomposition , dual graph , computer science , surface (topology) , polygon mesh , graph , geometry , geometry processing , enhanced data rates for gsm evolution , algorithm , simple (philosophy) , graph partition , mathematics , topology (electrical circuits) , theoretical computer science , combinatorics , planar graph , artificial intelligence , ecology , philosophy , epistemology , biology
Abstract This 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.