1 / 8

Iterated functions systems (IFS)

A contraction on the plane R 2 is a map f:R 2 → R 2 with the property that there exist a number r such that for any pair of points X, Y in R 2 , distance(f(X),f(Y))<r. distance(X,Y). The smallest r with such a property is called the contraction factor

emera
Download Presentation

Iterated functions systems (IFS)

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A contraction on the plane R2 is a map f:R2→R2 with the property that there exist a number r such that for any pair of points X, Y in R2 , distance(f(X),f(Y))<r. distance(X,Y). The smallest r with such a property is called the contraction factor NOTE: We will work with similarities, which are a particular type of contractions. Iterated functions systems (IFS)

  2. We start with a (compact) set of points P0 and n affine transformations, A1, A2, ..An, which are contractions. (In our examples, P0 is the initial polyogon or the union of the initial polygons) Remark: Many of the results could be reproduced in a more general way, starting with any compact set, and a finite number of contractions. Iterated functions systems (IFS)

  3. P1=A1(P0) U A2(P0) U .. U An(P0) P2=A1(P1) U A2(P1) U .. U An(P1) P3=A1(P2) U A2(P2) U .. U An(P2) ... The “recipe”: We define inductively n. Pn_=A1(P(n-1)) U A2(P(n-1)) U .. U An(P(n-1))

  4. The sequence P0, P1, P2, P3... converges to a unique shape P (of finite extent) invariant under the applications of A1, A2, . , An. In symbols, P=A1(P) U A2(P) U ... An(P). Theorem:

  5. This shape P is called the attractor of the IFS {A1, A2.. An}

  6. When the transformations A1, A2.. An are all affine transformations, they the list of parameters [a1, b1, c1, d1, e1, f1] (param. of A1) [a2, b2, c2, d2, e2, f2] (param. of A2) . . [an, bn, cn, dn, en, fn] (param. of An) are called the IFS parameters of the attractor.

  7. For a self-similar shape made of N copies of itself, each scaled by an affine contraction of contraction factor r, the similarity dimension is log(N)/log(1/r) Definition

  8. Let l1, l2,.. ln be a list of IFS parameters. Suppose they are all correspond to contractions of ratio r. Moreover, assume that there is a polygon P such that the union of the images of P by each of the transformations of the list is “just touching”. Then the similarity dimension of the attractor of the IFS is ln(n)/ln(r). NOTE: “Just touching” means that the sets intersect only in the boundary. Propositon:

More Related