Kinetic Growth Aggregation (Leath Algorithm) Approach for Continuum Percolation Model.

Investigations of continuum percolation model are less than those of discrete percolation model, because of difficulty in simulation study. There is an alternative approach to simulation study in the discrete model such as kinetic growth model (Leath algorithm), where a single cluster is grown from a seed with a percolation probability p. This approach reproduces the same threshold value and critical exponent as the direct study of conventional model. In this paper we apply a kinetic growth approach (Leath algorithm) for the continuum percolation model starting with a seed at the origin. [ABSTRACT FROM AUTHOR]