KAUST Grant NumberKUS-C1-016-04
Permanent link to this recordhttp://hdl.handle.net/10754/599030
MetadataShow full item record
AbstractDecomposing a shape into visually meaningful parts comes naturally to humans, but recreating this fundamental operation in computers has been shown to be difficult. Similar challenges have puzzled researchers in shape reconstruction for decades. In this paper, we recognize the strong connection between shape reconstruction and shape decomposition at a fundamental level and propose a method called α-decomposition. The α-decomposition generates a space of decompositions parameterized by α, the diameter of a circle convolved with the input polygon. As we vary the value of α, some structural features appear and disappear quickly while others persist. Therefore, by analyzing the persistence of the features, we can determine better decompositions that are more robust to both geometrical and topological noises. © 2012 Elsevier Ltd. All rights reserved.
CitationLu Y, Lien J-M, Ghosh M, Amato NM (2012) of polygons. Computers & Graphics 36: 466–476. Available: http://dx.doi.org/10.1016/j.cag.2012.03.018.
SponsorsThis work of Lien and Lu is supported in part by NSF IIS-096053, Autodesk and FHWA. The work of Amato and Ghosh is supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266, by THECB NHARP award 000512-0097-2009, by Chevron, IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King Abdullah University of Science and Technology (KAUST). We also thank the anonymous reviewers for the constructive comments.
JournalComputers & Graphics