Добавил:
Upload Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз: Предмет: Файл:

Ohrimenko+ / Barnsley. Superfractals

.pdf
Скачиваний:
90
Добавлен:
11.06.2015
Размер:
31 Мб
Скачать
☆

400

Superfractals

where

Aσ = φF(1) (σ )

and

φF(1) (σ )= lim Fσ1 ◦ Fσ2 ◦ · · · ◦ Fσk (X)

k→∞

for all σ {1,2,...,M}. Then the following key expression can be readily verified:

Aσ = φFunderlying ( σ ),

where

σ = Iσ1 × Iσ2 × Iσ3 × · · · {1,2,...,N }

for all σ = σ1σ2σ3 · · · {1,2,...,M} and the sets Iσk are defined in Equation (5.8.1). Be careful to distinguish between N and M here: {1,2,...,N } is the code space associated with the underlying IFS Funderlying while {1,2,...,M} is the code space associated with the 1-variable IFS F(1).

Notice that σ is a closed subset of {1,2,...,N }. Hence Aσ is precisely of the form of A(F, ) in Section 4.17; we simply replace F by Funderlying and by σ . That is, we have

Aσ = A(Funderlying, σ ) for all σ {1,2,...,M}.

(5.9.1)

So we can follow the development given in Section 4.17, but we must adapt the notation to fit the present circumstances. The restricted tops function τ(F, ) : A(F, ) → becomes here

τσ : Aσ → σ ,

 

where

 

τσ (x) = max ω σ : φFunderlying (ω) = x

for all x Aσ .

We call {τσ : σ {1,2,...,M}} the set of 1-variable tops associated with the IFS F(1). This may be thought of as a set of pictures in the space {1,2,...,M} (X). That is, τσ {1,2,...,N } (X) for each σ {1,2,...,M} is treated as a picture whose domain is Aσ and whose colour space is {1,2,...,N }. As in Section 4.15, these tops functions

may be used to render the 1-variable fractal sets Aσ via tops plus colour-stealing. Specifically, if PC is a picture from which colours are stolen and FC is an IFS of N functions, which need not be distinct, with attractor AC DPC and code space function φFC : {1,2,...,N } → AC , then we assign the colour PC ◦ φFC (τσ (x)) to the point x Aσ .

The following wonderful result tells us that we can compute random orbits of 1-variable tops with the aid of the chaos game. Let Fm be a member of the superIFS

5.9 Tops of 1-variable fractal sets

401

in Equation (5.3.1). Then we define, consistently with Equation (4.12.1),

 

Fm,TOP : {1,2,...,N } (X) → {1,2,...,N } (X)

(5.9.2)

as follows. Let τ {1,2,...,N } (X) and let Dτ denote the domain of τ . Then, for m = 1, 2, . . . , M, we define a set of disjoint sets by

Dm,1 = fNm−1+1(Dτ ),

Dm,2 = fNm−1+2(Dτ )\Dm,1,

Dm,3 = fNm−1+3(Dτ )\(Dm,1 Dm,2),

.

.

.

Dm,Lm = fNm (Dτ )\ Dm,1 Dm,2 · · · Dm,Lm −1 .

Let the domain of Fm,TOP(τ ) be Dm,1 Dm,2 · · · Dm,Lm , which is the same as

the domain of Fm (τ ). Then we define

f(−Nm−1+l)(x)

when x Dm,l ,

 

 

 

Fm,TOP(τ )(x) = (Nm−1

+ l)τ

 

 

 

 

 

 

 

 

1

 

 

 

 

 

for l

=

1, 2, . . . , L

m

and m

=

1, 2, . . . , M. Here

(N

m−1

+

l)τ ( f −1

(x))

 

 

 

 

 

 

(Nm−1+l)

 

means the string obtained by putting the symbol corresponding to the value of

N

m−1

+

l in front of the infinite string τ ( f −1

(x))

 

 

{1,2,...,N }

.

 

(Nm−1+l)

 

 

 

T h e o r e m 5.9.1 Let {τσ : σ {1,2,...,M}} be the set of 1-variable tops associated with the IFS F(1) = {H(X); F1, F2, . . . , FM }. Let Fm,TOP : {1,2,...,N } (X) →{1,2,...,N } (X) be defined as in Equation (5.9.2). Then

Fm,TOP(τσ ) = τmσ for all σ {1,2,...,M} and m = 1, 2, . . . , M.

Furthermore, if τ1, τ2 {1,2,...,N } (X) have the same domain, D X, then

sup

|Fm,TOP(τ1)(x) − Fm,TOP(τ2)(x)| ≤ 21 sup |τ1(x) − τ2(x)|.

x Fm (D)

x D

P r o o f The proof is completely mechanical and follows the same lines as the proof of Theorem 4.12.1.

Theorem 5.9.1 tells us two things. (i) By means of the chaos game we can produce random orbits {τk }∞k=1 of 1-variable tops functions that are almost always asymptotically distributed according to the measure attractor μ(1) of F(1). We refer to the resulting probability measure on the set of 1-variable tops as the pushforward of μ(1) on the set of 1-variable tops. Specifically, we start from any tops function τ1 {τσ : σ {1,2,...,M}} and define

τk+1 = Fσk ,TOP(τk ) for k = 1, 2, . . . ,

(5.9.3)

where, at the kth step, σk is chosen equal to m with probability Pm independently of all the other choices. (ii) The second part of Theorem 5.9.1 tells us that if

402

Superfractals

Figure 5.10 The image at top left represents a function τ1 {1,2,...,M} (R2) and the images down the diagonal illustrate elements of a chaos game orbit {τk }∞k=1 produced by randomly applying transfor-

mations from the set {Fm,TOP : m = 1, 2}. The images are rendered using colour-stealing. This illustrates Theorem 5.9.1.

we start the random iteration Equation (5.9.3) from any τ1 {1,2,...,N } (X) whose domain belongs to A(1), the sequence {τk }∞k=1 will almost always approach, in the sense of Equation (5.6.1), the push-forward of μ(1) on the set of 1-variable tops of F(1). It also tells us that if we start from any τ1 {1,2,...,N } (X) then the sequence {τk }∞k=1 will almost always approach, in the sense of Equation (5.6.1), a probability distribution on {1,2,...,N } (X) that depends only on the domain of τ1.

We illustrate these conclusions in Figures 5.9–5.11. Figure 5.9 corresponds to the 1-variable IFS F(1) described at the end of Section 5.6. The top row illustrates τ3, τ5 and τ7 from a random orbit {τk }∞k=1 rendered using colour-stealing, where the domain of τ1 is approximately the attractor A1 A(1) and the value of τ1 is constant, say τ1(x) = 1 for all x A1. The bottom row illustrates τk for three values of k between 10 and 20. We emphasize how simple it is to produce such sequences of images consecutively while apparently maintaining accuracy to within viewing resolution.

Figures 5.10 and 5.11 also correspond to the 1-variable IFS F(1) described at the end of Section 5.6; they were produced in a similar manner to the previous example, but the colours were stolen from a different picture. In this case the

5.10 Homeomorphisms between fractal sets and between tops

403

Figure 5.11 Samples from the random orbit started in Figure 5.10 are illustrated here. There are lots of little differences between these rendered 1-variable ‘tops’ functions. Can you find some of them?

domain of τ1 {1,2,...,N } (R2) is not an element of A(1). Successive images down the diagonal in Figure 5.10 illustrate τ1, τk2 , τk3 , τk4 and τk5 , where 1 < k2 < k3 <

k4 < k5 < 15. Figure 5.11 shows several members of the same random sequence, for much larger values of k. Notice the differences between the images. These later images are approximations to pictures of 1-variable tops, despite the fact that the domain of τ1 does not belong to A(1).

A fascinating illustration of the feasibility of computing random orbits of 1-variable tops, and of rendering them by colour-stealing ‘on-the-fly’, is the wholesale production of sequences of varied pictures that are all homeomorphic, similar to the homeomorphic pictures described in Section 4.15. But now, instead of one picture we have a potentially endless sequence of them, and so we have a balance between orderliness and randomness.

5.10Homeomorphisms between 1-variable fractal sets

and between their tops

We continue the application of Section 4.17 to the present context. We previously mentioned this development just before Equation (5.9.1) above.

The restricted tops code space (F, ) is here the set

σ := τσ (Aσ ).

We define

φσ : σ → Aσ

to be the restriction of φFunderlying : {1,2,...,N } → Aunderlying to the closure of σ . As in Definition 4.17.1, here we may refer to the set of sets

Qσ := φσ−1(x) : x Aσ

as a restricted code structure of the 1-variable fractal set Aσ , for each σ{1,2,...,M}. Also, we say that two restricted code structures Qσ and Qω

404

Superfractals

Figure 5.12 Which house do Peter and Elizabeth live in? The others are 1-variable fractal homeomorphisms of it, produced by following a random orbit on a superfractal.

are homeomorphic iff there is a homeomorphism χ : σ → ω such that q Qσ χ (q) Qω . Then Theorem 4.17.3, transcribed to the present setting, may be expressed as follows.

T h e o r e m 5.10.1 Let F(1) = {H(X); F1, F2, . . . , FM } be a 1-variable IFS, let A(1) = { Aσ : σ {1,2,...,M}} be its set attractor and let {τσ : σ {1,2,...,M}}

be the associated set of 1-variable tops. Let two restricted code structures Qσ and Qω be homeomorphic for some pair of addresses σ , ω {1,2,...,M}. Then Aσ and Aω are homeomorphic. That is, there exists a homeomorphism H : Aσ → Aω such that

H (Aσ ) = Aω .

If the homeomorphism χ : σ → ω has the property χ ( σ ) = ω then

τω ◦ H = χ ◦ τσ .

Figures 5.12, 5.13, 5.15, 5.17 and 5.18 provide illustrations of the power of Theorem 5.10.1. In the first three of these figures F(1) = {H(R2); F1, F2} where the two IFSs F1 and F2 are of the form in Table 5.3, for say λ = 0.4 and λ = 0.6. The attractors of two such IFSs are illustrated in Figure 5.14, where they are rendered by IFS colouring and overlay the picture from which the colours in Figure 5.15 were stolen. It is reasonably straightforward to prove that all the IFSs represented by Table 5.3 have the same code structures, which I call ‘tops quadtree’. Note, however, that a decomposition of a square into four ‘just-touching’ rectangles does not yield typically an IFS whose code structure is homeomorphic to those of the IFSs represented by Table 5.3.

Table 5.3 A parameterized family of affine IFS codes, all with the same code structure. This family is used to produce the 1-variable continuous fractal transformations illustrated in Figures 5.12, 5.13 and 5.15

n

an

bn

cn

dn

en

fn

1

λ

0

0

λ

0

0

2

1 − λ

0

0

λ

λ

0

3

1 − λ

0

0

1 − λ

λ

λ

4

λ

0

0

1 − λ

0

λ

pn

1

4

1

4

1

4

1

4

Figure 5.13 Four different 1-variable fractal homeomorphisms applied to a picture of New York at dusk. This illustrates Theorem 5.10.1. See the main text. The original was obtained from BigStockPhoto.com. The copyright to the original is owned by Brian Kelly.

Figure 5.14 Attractors of the two IFSs F1 and F2 used in the 1-variable superIFS F(1) to construct the ‘stolen’ pictures in Figure 5.15.

406

Superfractals

Figure 5.15 Examples of 1-variable superfractal transformations of surf at Waratah Bay in January 2005. The original photograph from which the colours were stolen sits in the background in Figure 5.14, which also illustrates the IFSs, whose code structures are homeomorphic, used to generate these and many other seascapes.

5.11 Other sets of 1-variable fractal objects

407

Figure 5.16 The attractors of two IFSs are illustrated here. They are both rendered using IFS colouring and are superimposed on a picture of the sea. Two such IFSs, F1 and F2, comprise the superIFS used to make Figures 5.17 and 5.18.

In Figure 5.12 you can see six pictures. Five were selected from one random orbit of 1-variable tops, rendered by colour-stealing. The stealing IFS also corresponds to Table 5.3 with λ = 0.5, and the picture PC from which colours were stolen is illustrated at lower left. As predicted by Theorem 5.10.1 and our earlier discussion of homeomorphisms, all these pictures are homeomorphic to one another and to the picture from which the colours were stolen. It is astonishing to see these images appear on the screen of a computer, one after another, each one momentarily a new delight. Figures 5.13 and 5.15 were produced similarly, but in neither of these cases is the picture PC included. You’ll have to guess what it looks like. Can you?

Figures 5.16 and 5.18 illustrate a different 1-variable IFS, where each of two IFSs involved is constructed using four affine transformations that form a collage of a triangle. Figure 5.16 shows pictures of the attractors, both rendered using the same IFS colouring, of two such IFSs. A similar IFS was used for colourstealing. The IFSs were chosen to have the same code space structure, ensuring that all the resulting 1-variable pictures are homeomorphic. Figure 5.17 involves more extreme distortions but each mathematical picture is homeomorphic to the original.

Imagine that the superfractal to which the pictures in Figure 5.18 belong is an art gallery full of triangular seascapes. By means of the chaos game you may rush about in the gallery, from picture to picture, sampling its contents according to the push-forwards of an invariant measure of the IFS F(1).

5.11 Other sets of 1-variable fractal objects

In addition to providing the superfractal of 1-variable fractal sets A(1) = { Aσ : σ {1,2,...,M}} and the set of 1-variable tops, {τσ : σ {1,2,...,M}}, the superIFS {X; F1, F2, . . . , FM } may be used to describe many other collections of 1-variable fractal objects and, more generally, V -variable fractal objects. All these collections arise quite naturally and are interesting, at the very least, because of their potential for applications in computer graphics. Some of these collections are easiest to describe in the 1-variable case, so we do this next. Then their generalizations may be inferred after we formalize the concept of V -variablility for V = 1, 2, 3, . . .

408

Superfractals

Figure 5.17 Pictures belonging to a 1-variable superfractal. Three IFSs were used, one for colour-stealing and two to construct F(1). Each IFS is of the form illustrated in Figure 5.16, and each has the same code structure, which ensures that the mathematical pictures are homeomorphic.

are μ1 P(X), which is the measure attractor
P(1)
P(1)
P(1)

5.11 Other sets of 1-variable fractal objects

409

The superfractal of 1-variable fractal measures

 

The superIFS in Equation (5.3.1) may be used to define the hyperbolic IFS

 

FP(1) = {P(X); F1, F2, . . . , FM ; P1, P2, . . . , PM }.

 

We may call this a 1-variable measure IFS. How do we know that FP(1) is indeed a hyperbolic IFS? Firstly, we know that (P(X), dP(X)) is a compact metric space, by Theorem 2.4.15. Secondly, here each of the IFSs Fm acts as a transformation

Fm : P(X) → P(X)

defined by

Lm

Fm (μ) = plm flm (μ) for m = 1, 2, . . . , M.

l=1

By Theorem 2.4.21, each of these transformations is strictly contractive on P(X) with respect to the Hausdorff metric. That is,

dP (Fm (X ), Fm (Y )) ≤ λm dP (X, Y ) for all X, Y H(X),

for some λm [0, 1) and m = 1, 2, . . . , M.

The set attractor A of the IFS F must be an element of H(P(X)). That is, it must be a nonempty set, compact with respect to the metric dP(X), whose elements are themselves normalized Borel measures on X. Furthermore, this set attractor must be given by

AP(1) = φF P(1) {1,2,...,M} ,

where

φFP(1) : {1,2,...,M} → P(X)

is the code space mapping associated with FP(1). The elements of AP(1) are the points in P(X) that can be written in the form

μσ = φF P(1) (σ ) = lim Fσ1 ◦ Fσ2 ◦ · · · ◦ Fσk (μX ),

k→∞

where μX is an element of P(X). The particular choice of μX makes no difference since the convergence on the right-hand side, with respect to the metric dP(X), is uniform with respect to both μX and σ . We will refer to the measure μσ as a

1-variable fractal measure. We have

AP(1) = μσ : σ {1,2,...,M} ,

which we may refer to as a superfractal of 1-variable fractal measures associated with the superIFS {X; F1, F2, . . . , FM }.

Examples of elements of A

1

 

 

1

 

1

1

1

1

 

 

of the hyperbolic IFS F1 = {X; f1

,

f

2

, . . . ,

fL1

; p1

, p2

, . . . , pL1

}, and μ1312

 

Соседние файлы в папке Ohrimenko+