![](/images/graphics-bg.png)
Cellular Automata Supporting n -Connectivity
Joint Authors
Xuan, Xiao
Kosec, Gregor
Trobec, Roman
Stamatovic, Sinisa
Stamatovic, Biljana
Source
Mathematical Problems in Engineering
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-6, 6 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-11-19
Country of Publication
Egypt
No. of Pages
6
Main Subjects
Abstract EN
We propose a new algorithm based on cellular automation (CA) for preserving n -connectivity, n > 1 .
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 n -connected components, n > 1 , 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.
American Psychological Association (APA)
Stamatovic, Biljana& Kosec, Gregor& Trobec, Roman& Xuan, Xiao& Stamatovic, Sinisa. 2014. Cellular Automata Supporting n -Connectivity. Mathematical Problems in Engineering،Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-1046448
Modern Language Association (MLA)
Stamatovic, Biljana…[et al.]. Cellular Automata Supporting n -Connectivity. Mathematical Problems in Engineering No. 2014 (2014), pp.1-6.
https://search.emarefa.net/detail/BIM-1046448
American Medical Association (AMA)
Stamatovic, Biljana& Kosec, Gregor& Trobec, Roman& Xuan, Xiao& Stamatovic, Sinisa. Cellular Automata Supporting n -Connectivity. Mathematical Problems in Engineering. 2014. Vol. 2014, no. 2014, pp.1-6.
https://search.emarefa.net/detail/BIM-1046448
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1046448