Mesh Segmentation Refinement
Lotan Kaplansky, Ayellet Tal
In Computer Graphics Forum, 28(7), 2009.
Abstract: This paper proposes a method for refining existing mesh segmentations, employing a novel extension of the active contour approach to meshes. Given a segmentation, produced either by an automatic segmentation method or interactively, our algorithm propagates the segment boundaries to more appropriate locations. In addition, unlike most segmentation algorithms, our method allows the boundaries to pass through the mesh faces, resulting in smoother curves, particularly visible on coarse meshes. The method is also capable of changing the number of segments, by enabling splitting and merging of boundary curves during the process. Finally, by changing the propagation rules, it is possible to segment the mesh by a variety of criteria, for instance geometric-meaningful segmentations, texture-based segmentations, or constriction-based segmentations.
Article URL: http://dx.doi.org/10.1111/j.1467-8659.2009.01578.x
BibTeX format:
@article{CGF:CGF1578,
  author = {Lotan Kaplansky and Ayellet Tal},
  title = {Mesh Segmentation Refinement},
  journal = {Computer Graphics Forum},
  volume = {28},
  number = {7},
  pages = {1995--2003},
  year = {2009},
}
Search for more articles by Lotan Kaplansky.
Search for more articles by Ayellet Tal.

Return to the search page.


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