Abstract

The labeling of connected components algorithms find in a binary lattice all groups of connected cells and identify them with common unique labels. In this paper labeling of connected component on 3D lattices based on cellular automata algorithm is presented. Concretely, implementation of a cellular automata based algorithm for labeling of 26-connected components in 3D binary lattices is presented. The implementation of the algorithm with its extensively evaluation on various test cases for different size of grids and percolation probabilities is given. The experiments are made in NetLogo programming environment.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call