A simple and robust thinning algorithm on cell complexes
Abstract
Thinning is a commonly used approach for computing skeleton descriptors. Traditional thinning algorithms often have a simple, iterative structure, yet producing skeletons that are overly sensitive to boundary perturbations. We present a novel thinning algorithm, operating on objects represented as cell complexes, that preserves the simplicity of typical thinning algorithms but generates skeletons that more robustly capture global shape features. Our key insight is formulating a skeleton significance measure, called medial persistence, which identify skeleton geometry at various dimensions (e.g., curves or surfaces) that represent object parts with different anisotropic elongations (e.g., tubes or plates). The measure is generally defined in any dimensions, and can be easily computed using a single thinning pass. Guided by medial persistence, our algorithm produces a family of topology and shape preserving skeletons whose shape and composition can be flexible controlled by desired level of medial persistence.
BibTeX
@article {10.1111:j.1467-8659.2010.01814.x,
journal = {Computer Graphics Forum},
title = {{A simple and robust thinning algorithm on cell complexes}},
author = {Liu, L. and Chambers, E. W. and Letscher, D. and Ju, T.},
year = {2010},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2010.01814.x}
}
journal = {Computer Graphics Forum},
title = {{A simple and robust thinning algorithm on cell complexes}},
author = {Liu, L. and Chambers, E. W. and Letscher, D. and Ju, T.},
year = {2010},
publisher = {The Eurographics Association and Blackwell Publishing Ltd},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2010.01814.x}
}