Geometry Aware Tori Decomposition

Simple item page
dc.contributor.authorChen, Jiaen_US
dc.contributor.authorGopi, Meenakshisundaramen_US
dc.contributor.editorAlliez, Pierre and Pellacini, Fabioen_US
dc.date.accessioned2019-05-05T17:41:19Z
dc.date.available2019-05-05T17:41:19Z
dc.date.issued2019
dc.description.abstractThis 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.description.number2
dc.description.sectionheadersModeling
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume38
dc.identifier.doi10.1111/cgf.13641
dc.identifier.issn1467-8659
dc.identifier.pages331-341
dc.identifier.urihttps://doi.org/10.1111/cgf.13641
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13641
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.titleGeometry Aware Tori Decompositionen_US
Files
Collections
38-Issue 2