Optimizing Geometry-aware Pants Decomposition

Simple item page
dc.contributor.authorZhang, Kangen_US
dc.contributor.authorLi, Xinen_US
dc.contributor.editorChris Bregler and Pedro Sander and Michael Wimmeren_US
dc.date.accessioned2013-11-08T10:25:00Z
dc.date.available2013-11-08T10:25:00Z
dc.date.issued2012en_US
dc.description.abstractWe present a computational framework to optimize the pants decomposition of surfaces with non-trivial topology. A pants decomposition segments a surface into a set of sub-patches each of which is genus-0 with 3 boundaries. A given surface usually admits infinitely-many pants decompositions that are topologically inequivalent. Given some pre-determined geometric criteria, our algorithm enumerates different classes of pants decompositions and search for the optimal one. The proposed framework is general, and can be used to generate different suitable segmentations according to different applications. We also generalize our algorithm for consistent decomposition of multiple surfaces. This algorithm can be used in constructing compatible cross-surface mapping, and facilitate many computer graphics tasks.en_US
dc.description.seriesinformationPacific Graphics Short Papersen_US
dc.identifier.isbn978-3-905673-94-4en_US
dc.identifier.urihttps://doi.org/10.2312/PE/PG/PG2012short/011-016en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectMesh Segmentationen_US
dc.subjectConsistent Segmentationen_US
dc.subjectCross surface Mappingen_US
dc.titleOptimizing Geometry-aware Pants Decompositionen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
011-016.pdf
Size:
2.14 MB
Format:
Adobe Portable Document Format
Download
Collections
PG2012short