Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 765798, 6 pages
Research Article

Cellular Automata Supporting -Connectivity

1Faculty of Information Systems and Technologies, University of Donja Gorica, 81000 Podgorica, Montenegro
2Jozef Stefan Institute, Jamova 39, 1000 Ljubljana, Slovenia
3School of Mechanical and Electronic Engineering, Jingdezhen Ceramic Institute, Jingdezhen 333403, China
4Department of Mathematics, State University of Montenegro, 81000 Podgorica, Montenegro

Received 18 June 2014; Accepted 2 November 2014; Published 19 November 2014

Academic Editor: Mingshu Peng

Copyright © 2014 Biljana Stamatovic et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


We propose a new algorithm based on cellular automation (CA) for preserving -connectivity, . The CA algorithm transforms an initial grid configuration in a grid with same number of holes but without 1-connected components. Also, maximal thinning of -connected components, , is achieved. The grid can be used as initial for investigating properties of initial grid. Computational performances are evaluated and measured on real cases. The obtained results indicate that the proposed approach achieves comparable complexity as standard approaches; however, the speed-up and scalability of the proposed algorithm are not limited by the number of processing nodes.