Approximate convex hull of affine iterated function system attractors

In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output approximate convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximate convex hull without loss of accuracy.

► We present an iterative algorithm to approximate affine IFS attractor convex hull.
► Elimination of the interior points significantly reduces the complexity.
► To optimize calculations, we merge the convex hull images at each iteration.
► Approximation by ellipses increases speed of convergence to the exact convex hull.
► We present a method of the output convex hull simplification.