4D Minimal Non-simple Sets
One method of verifying that a given parallel thinning algorithm “preserves topology” is to show that no iteration ever deletes a minimal non-simple (“MNS”) set of 1’s. The practicality of this method depends on the fact that few types of set can be MNS without being a component. The problem of finding all such types of set has been solved (by Ronse, Hall, Ma, and the authors) for 2D and 3D Cartesian grids, and for 2D hexagonal and 3D face-centered cubic grids. Here we solve this problem for a 4D Cartesian grid, in the case where 80-adjacency is used on 1’s and 8-adjacency on 0’s.
Keywords4D xel attachment minimal non-simple MNS parallel thinning
- 6.Kong, T.Y.: Topology preserving deletion of 1’s from 2-, 3-and 4-dimensional binary images. In Ahronovitz, E., Fiorio, C., eds.: Discrete Geometry for Computer Imagery: 7th International Workshop (DGCI’ 97, Montpellier, France, December 1997), Proceedings. Springer (1997) 3–18Google Scholar
- 8.Saha, P.K., Kong, T.Y., Rosenfeld, A.: Strongly normal sets of tiles in N dimensions. Electronic Notes in Theoretical Computer Science 46 (2001) URL: http://www.elsevier.nl/locate/entcs/volume46.html
- 9.Spanier, E.H.: Algebraic Topology. Springer (1989)Google Scholar
- 10.Maunder, C.R.F.: Algebraic Topology. Dover (1996)Google Scholar