Parallel skeletonization algorithms in the cubic grid based on critical kernels

Abstract We propose two compact and generic thinning schemes, both based on the critical kernels framework, which encompass an enormous variety of homotopic parallel 3D thinning algorithms—including asymmetric and symmetric algorithms that produce ultimate, curve, surface, and other kinds of skeletons. Our algorithms are fast, and our approach is validated experimentally. We also propose an effective filtering strategy based on the notion of isthmus persistence that can be easily performed within our framework.