Premium
A simple and robust thinning algorithm on cell complexes
Author(s) -
Liu L.,
Chambers E. W.,
Letscher D.,
Ju T.
Publication year - 2010
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2010.01814.x
Subject(s) - thinning , topological skeleton , medial axis , skeleton (computer programming) , simple (philosophy) , boundary (topology) , computer science , algorithm , measure (data warehouse) , simplicity , shape analysis (program analysis) , mathematics , topology (electrical circuits) , geometry , active shape model , artificial intelligence , segmentation , combinatorics , mathematical analysis , epistemology , database , biology , programming language , static analysis , ecology , philosophy
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.