$alpha $ Decomposition of polygons
Yanyan Lu, Jyh-Ming Lien, Mukulika Ghosh, Nancy M. Amato
In Computers & Graphics, 36(5), 2012.
Abstract: Decomposing 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 $alpha $decomposition . The $alpha $decomposition generates a space of decompositions parameterized by $alpha $, the diameter of a circle convolved with the input polygon. As we vary the value of $alpha $, 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.
Keyword(s): Shape decomposition, Convolution, Concavity measurement, Persistence analysis, Geometrical and topological noises
Article URL: http://dx.doi.org/10.1016/j.cag.2012.03.018
BibTeX format:
@article{Lu2012466,
  author = {Yanyan Lu and Jyh-Ming Lien and Mukulika Ghosh and Nancy M. Amato},
  title = {$alpha $ Decomposition of polygons},
  journal = {Computers & Graphics},
  volume = {36},
  number = {5},
  pages = {466--476},
  year = {2012},
}
Search for more articles by Yanyan Lu.
Search for more articles by Jyh-Ming Lien.
Search for more articles by Mukulika Ghosh.
Search for more articles by Nancy M. Amato.

Return to the search page.


graphbib: Powered by "bibsql" and "SQLite3."