dc.contributor.author | Chen, Jia | en_US |
dc.contributor.author | Gopi, Meenakshisundaram | en_US |
dc.contributor.editor | Alliez, Pierre and Pellacini, Fabio | en_US |
dc.date.accessioned | 2019-05-05T17:41:19Z | |
dc.date.available | 2019-05-05T17:41:19Z | |
dc.date.issued | 2019 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | https://doi.org/10.1111/cgf.13641 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13641 | |
dc.description.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. | en_US |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.title | Geometry Aware Tori Decomposition | en_US |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.sectionheaders | Modeling | |
dc.description.volume | 38 | |
dc.description.number | 2 | |
dc.identifier.doi | 10.1111/cgf.13641 | |
dc.identifier.pages | 331-341 | |