Approximate convex hull of affine iterated function system attractors - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Chaos, Solitons & Fractals Year : 2012

Approximate convex hull of affine iterated function system attractors

Abstract

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 convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximation of the convex hull without loss of accuracy.
Fichier principal
Vignette du fichier
ConvexHull.pdf (653.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00755842 , version 1 (22-11-2012)

Identifiers

Cite

Anton Mishkinis, Christian Gentil, Sandrine Lanquetin, Dmitry Sokolov. Approximate convex hull of affine iterated function system attractors. Chaos, Solitons & Fractals, 2012, 45 (11), pp.1444-1451. ⟨10.1016/j.chaos.2012.07.015⟩. ⟨hal-00755842⟩
249 View
463 Download

Altmetric

Share

Gmail Facebook X LinkedIn More