Geometry Aware Tori Decomposition
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.
BibTeX
@article {10.1111:cgf.13641,
journal = {Computer Graphics Forum},
title = {{Geometry Aware Tori Decomposition}},
author = {Chen, Jia and Gopi, Meenakshisundaram},
year = {2019},
publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/cgf.13641}
}
journal = {Computer Graphics Forum},
title = {{Geometry Aware Tori Decomposition}},
author = {Chen, Jia and Gopi, Meenakshisundaram},
year = {2019},
publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/cgf.13641}
}