Show simple item record

dc.contributor.authorSolomon, Justin
dc.contributor.authorBen-Chen, Mirela
dc.contributor.authorButscher, Adrian
dc.contributor.authorGuibas, Leonidas
dc.date.accessioned2016-02-25T13:10:33Z
dc.date.available2016-02-25T13:10:33Z
dc.date.issued2011-04-28
dc.identifier.citationSolomon J, Ben-Chen M, Butscher A, Guibas L (2011) Discovery of Intrinsic Primitives on Triangle Meshes. Computer Graphics Forum 30: 365–374. Available: http://dx.doi.org/10.1111/j.1467-8659.2011.01867.x.
dc.identifier.issn0167-7055
dc.identifier.doi10.1111/j.1467-8659.2011.01867.x
dc.identifier.urihttp://hdl.handle.net/10754/597993
dc.description.abstractThe discovery of meaningful parts of a shape is required for many geometry processing applications, such as parameterization, shape correspondence, and animation. It is natural to consider primitives such as spheres, cylinders and cones as the building blocks of shapes, and thus to discover parts by fitting such primitives to a given surface. This approach, however, will break down if primitive parts have undergone almost-isometric deformations, as is the case, for example, for articulated human models. We suggest that parts can be discovered instead by finding intrinsic primitives, which we define as parts that posses an approximate intrinsic symmetry. We employ the recently-developed method of computing discrete approximate Killing vector fields (AKVFs) to discover intrinsic primitives by investigating the relationship between the AKVFs of a composite object and the AKVFs of its parts. We show how to leverage this relationship with a standard clustering method to extract k intrinsic primitives and remaining asymmetric parts of a shape for a given k. We demonstrate the value of this approach for identifying the prominent symmetry generators of the parts of a given shape. Additionally, we show how our method can be modified slightly to segment an entire surface without marking asymmetric connecting regions and compare this approach to state-of-the-art methods using the Princeton Segmentation Benchmark. © 2011 The Author(s).
dc.description.sponsorshipThe authors would like to acknowledge the following grants: The NSF GRF program, the NDSEG program of the DoD, the Hertz Foundation Fellowship, the Weizmann Institute WiS award, NSF grants FODAVA 0808515, CCF 0808515, an AEA program grant from KAUST, a Google research grant, and a seed grant from the Stanford CS Department.
dc.publisherWiley
dc.titleDiscovery of Intrinsic Primitives on Triangle Meshes
dc.typeConference Paper
dc.identifier.journalComputer Graphics Forum
dc.conference.date2011-04-11 to 2011-04-15
dc.conference.name32nd Annual Conference on European Association for Computer Graphics, EUROGRAPHICS 2011
dc.conference.locationLlandudno, Wales, GBR
dc.contributor.institutionStanford University, Palo Alto, United States
dc.date.published-online2011-04-28
dc.date.published-print2011-04


This item appears in the following Collection(s)

Show simple item record