Strategies for Optimize Off-Lattice Aggregate Simulations

TL;DR

This paper reviews algorithms for simulating off-lattice cluster growth, comparing their efficiencies across models like diffusion-limited and ballistic aggregation, to guide future simulation efforts.

Contribution

It provides a comparative analysis of computational algorithms suitable for various off-lattice aggregation models, emphasizing extendability and efficiency.

Findings

Algorithms vary in computational efficiency

Certain methods are more adaptable to different models

Guidelines for selecting simulation algorithms

Abstract

We review some computer algorithms for the simulation of off-lattice clusters grown from a seed, with emphasis on the diffusion-limited aggregation, ballistic aggregation and Eden models. Only those methods which can be immediately extended to distinct off-lattice aggregation processes are discussed. The computer efficiencies of the distinct algorithms are compared.