Skeleton Sparsification and Densification Scale-Spaces
Abstract
This repository contains research code for skeletonisation scale-spaces. Starting from a skeleton computed via homotopic thinning (Remy/Thiel [3]) based on a Euclidean distance transform (Meijster et al. [2]), four algorithms progressively remove skeleton points (sparsification) or add skeleton points (densification). For more details, please refer to our publication that has been accepted to be published in the Journal of Mathematical Imaging and Vision at the time of upload. [1] Breuß, M., Buhl, J., Yarahmadi, A.M., Bambach, M., Peter, P.: A simple approachto stiffness enhancement of a printable shape by Hamilton-Jacobi skeletonization.Procedia Manufacturing 47, 1190–1196 (2020)[2] Meijster, A., Roerdink, J., Hesselink, W.: A general algorithm for computingdistance transforms in linear time. In: Goutsias, J., Vincent, L., Bloomberg, D.(eds.) Proc. 5th International Symposium on Mathematical Morphology and ItsApplications to Image and Signal Processing. Computational Imaging and Vision,vol. 18, pp. 331–340. Springer (2000)[3] Remy, E., Thiel, E.: Exact medial axis with euclidean distance. Image and VisionComputing 23(2), 167–175 (2005)
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 12 March 2026
- Language
- EN