Calculating the Number of Tunnels
This paper considers 2-regions of grid cubes and proposes an algorithm for calculating the number of tunnels of such a region. The graph-theoretical algorithm proceeds layer by layer; a proof of its correctness is provided, and its time complexity is also given.
KeywordsNumber of tunnels digital topology 3D grid
- 2.CHomP (Atlanta) and CAPD (Kraków). Homology algorithms and software, http://www.math.gatech.edu/~chomp/homology/
- 4.De Silva, V.: Plex - A Matlab library for studying simplicial homology, http://math.stanford.edu/comptop/programs/plex/plexintro.pdf
- 7.Ohser, J., Nagel, W., Schladitz, K.: The Euler number of discretized sets - on the choice of adjacency in homogeneous lattices. In: Proc. Morphology Condensed Matter. Physics Geometry Spatially Complex Systems. LNP, vol. 600, pp. 275–298 (2002)Google Scholar