H. Breu, J. Gil, D. Kirkpatrick, and M. Werman, Linear time Euclidean distance transform algorithms Distance transformations in arbitrary dimensions Measuring and computing natural generators for homology groups, Special Issue on the 24th European Workshop on Computational Geometry (EuroCG'08), pp.529-533321, 1984.

T. K. Dey, F. Fan, and Y. Wang, An efficient computation of handle and tunnel loops via Reeb graphs, ACM Transactions on Graphics, vol.32, issue.4, pp.1-3210, 2013.
DOI : 10.1145/2461912.2462017

. Fig, Left: three binary volumes Right: their thickness-breadth diagrams. 0-holes are represented by red circles, 1-holes by green triangles and 2-holes by blue squares. [DGt] DGtal: Digital geometry tools and algorithms library

. Fig, Examples of thickness (red) and breadth (green) balls. Top: Fertility volume, available by AIM@SHAPE with the support of M. Couprie. Bottom: Menger sponge

J. [. Edelsbrunner, ]. J. Harer, K. Erickson, ]. Whittleseyghr08, and . Ghrist, Persistent homology ? a survey Surveys on Discrete and Computational Geometry: Twenty Years Later Greedy optimal homotopy and homology generators Roman colosseum completley detailed see the world. https://www.thingiverse.com/thing:962416 Barcodes: The persistent topology of data. Bulletin of the, Amer. Math. Soc., Contemporary Mathematics. [EW05 Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '05 Society for Industrial and Applied Mathematics. [Gas15] J. Gaspard, pp.257-282, 2005.

T. Hirata, A unified linear-time algorithm for computing distance maps, Information Processing Letters, vol.58, issue.3, pp.129-133, 1996.
DOI : 10.1016/0020-0190(96)00049-X

J. Mukherjee, P. P. Das, M. A. Kumar, and B. N. Chatterji, On approximating Euclidean metrics by digital distances in 2D and 3D, Pattern Recognition Letters, vol.21, issue.6-7, pp.6-7573, 2000.
DOI : 10.1016/S0167-8655(00)00022-2

P. Min, . N. Binvox, D. Milosavljevi´cmilosavljevi´c, P. Morozov, and . Skraba, Zigzag persistent homology in matrix multiplication time Morse theory for filtrations and efficient computation of persistent homology A method for obtaining skeletons using a quasi-Euclidean distance, Proceedings of the Twenty-seventh Annual Symposium on Computational Geometry ACM. [MN13] K. Mischaikow and V. Nanda, pp.216-225330, 1968.

. Jr, C. R. Maurer, R. Qi, and V. Raghavan, A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.25, issue.2, pp.265-270, 2003.

A. Meijster, J. B. Roerdink, W. H. Hesselinkne09-]-n, P. Normand, ]. F. Evenount03 et al., A general algorithm for computing distance transforms in linear time [Nan] V. Nanda. Perseus, the persistent homology software Medial axis lookup table and test neighborhood computation for 3D chamfer norms Simplification and repair of polygonal models using volumetric techniques, Mathematical Morphology and its Applications to Image and Signal Processing of Computational Imaging and Vision Selected papers from the 14th {IAPR} International Conference on Discrete Geometry for Computer Imagery, pp.331-3402288, 2000.

H. Wagner, C. Chen, and E. Vuçini, Efficient computation of persistent homology for cubical data Topological Methods in Data Analysis and Visualization II, Mathematics and Visualization, [ZC05] A. Zomorodian and G. Carlsson. Computing persistent homology. Discrete and Computational Geometry, pp.91-106249, 2005.