Connectivity in Lattices and Mosaics

Narendra Ahuja

Abstract

Deals with connectivity in regular lattices and random mosaics with applications to image modelling by mosaic models. A solution is presented to the hitherto unsolved problems of predicting the expected number of connected components in square, hexagonal and triangular lattices, using a one dimensional growth approach that can also be used for some other lattices. Also, the relationship between connectivity in regular lattices and random mosaics is investigated. Experimental results are presented for both cases.