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.
Document type :
Journal articles
Chaos, Solitons and Fractals, Elsevier, 2012, 45 (11), pp.1444-1451. <10.1016/j.chaos.2012.07.015>


https://hal.inria.fr/hal-00755842
Contributor : Nicolas Ray <>
Submitted on : Thursday, November 22, 2012 - 9:47:46 AM
Last modification on : Friday, November 23, 2012 - 4:03:47 PM

File

ConvexHull.pdf
fileSource_public_author

Identifiers

Collections

Citation

Anton Mishkinis, Christian Gentil, Sandrine Lanquetin, Dmitry Sokolov. Approximate convex hull of affine iterated function system attractors. Chaos, Solitons and Fractals, Elsevier, 2012, 45 (11), pp.1444-1451. <10.1016/j.chaos.2012.07.015>. <hal-00755842>

Export

Share

Metrics

Consultation de
la notice

185

Téléchargement du document

142