Cellular automata labeling of connected components in n-dimensional binary lattices

Stamatovic, Biljana; Trobec, Roman

doi:10.1007/s11227-016-1761-4

Cited by 3 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Studying site and bond percolation on any lattice is an important problem in computational physics [9][10][11][12]. Some algorithms from these studies are presented in [13][14][15][16][17][18]. In [19][20][21], polymerizing systems are presented, with branched or cross-linked polymers, which may go through distinct gelation transitions; a formed gel is seen as a twodimensional lattice-percolation cluster and the authors use a "hull-generating walk" (HGW) algorithm.…”

Section: Introductionmentioning

confidence: 99%

Algorithm for Identification of Infinite Clusters Based on Minimal Finite Automaton

Stamatovic¹,

Kilibarda²

2017

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

We propose a finite automaton based algorithm for identification of infinite clusters in a 2D rectangular lattice with = × cells. The algorithm counts infinite clusters and finds one path per infinite cluster in a single pass of the finite automaton. The finite automaton is minimal according to the number of states among all the automata that perform such task. The correctness and efficiency of the algorithm are demonstrated on a planar percolation problem. The algorithm has a computational complexity of O( ) and could be appropriate for efficient data flow implementation.

show abstract