<?xml version="1.0" encoding="UTF-8"?>
<Worksheet><Version major="6" minor="1"/><View-Properties><Hide name="Section Range"/><Hide name="Group Range"/><Zoom percentage="100"/></View-Properties><Styles><Layout alignment="left" firstindent="0.0" leftmargin="0.0" linebreak="space" linespacing="0.0" name="Heading 1259" rightmargin="0.0" spaceabove="8.0" spacebelow="4.0"/><Layout alignment="centred" firstindent="0.0" leftmargin="0.0" linebreak="space" linespacing="0.0" name="Normal257" rightmargin="0.0" spaceabove="0.0" spacebelow="0.0"/><Layout alignment="centred" firstindent="0.0" leftmargin="0.0" linebreak="space" linespacing="0.0" name="Normal256" rightmargin="0.0" spaceabove="0.0" spacebelow="0.0"/><Layout alignment="left" firstindent="0.0" leftmargin="0.0" linebreak="space" linespacing="0.0" name="Heading 1" rightmargin="0.0" spaceabove="8.0" spacebelow="4.0"/><Layout alignment="left" firstindent="0.0" leftmargin="0.0" linebreak="space" linespacing="0.0" name="Normal" rightmargin="0.0" spaceabove="0.0" spacebelow="0.0"/><Layout alignment="left" firstindent="0.0" leftmargin="0.0" linebreak="space" linespacing="0.0" name="Normal260" rightmargin="0.0" spaceabove="0.0" spacebelow="0.0"/><Font background="[0,0,0]" bold="true" executable="false" family="Times New Roman" foreground="[0,0,0]" italic="false" name="Heading 1" readonly="false" size="18" underline="false"/><Font background="[0,0,0]" bold="true" executable="true" family="Monospaced" foreground="[255,0,0]" name="Maple Input"/><Font background="[0,0,0]" family="Times New Roman" name="Page Number" underline="false"/><Font background="[0,0,0]" bold="false" executable="false" family="Times New Roman" foreground="[0,0,0]" italic="false" name="Normal" readonly="false" size="12" underline="false"/><Font background="[0,0,0]" foreground="[0,128,128]" italic="false" name="Hyperlink" underline="true"/><Font background="[0,0,0]" bold="true" executable="false" family="Monospaced" foreground="[0,0,0]" name="_cstyle21"/><Font background="[0,0,0]" bold="false" executable="false" family="Times New Roman" foreground="[0,0,0]" italic="false" name="Normal260" readonly="false" size="14" underline="false"/><Font background="[0,0,0]" italic="true" name="_cstyle267"/><Font background="[0,0,0]" italic="true" name="_cstyle266"/><Font background="[0,0,0]" italic="true" name="_cstyle265"/><Font background="[0,0,0]" name="_cstyle264" size="12"/><Font background="[0,0,0]" name="_cstyle263" size="12"/><Font background="[0,0,0]" name="_cstyle262" size="12"/><Font background="[0,0,0]" bold="false" executable="false" family="Times New Roman" foreground="[0,0,0]" italic="false" name="Normal256" readonly="false" size="12" underline="false"/><Font background="[0,0,0]" name="_cstyle259" size="12"/><Font background="[0,0,0]" name="_cstyle258" size="12"/><Font background="[0,0,0]" family="Times New Roman" name="2D Comment" underline="false"/></Styles><Page-Numbers enabled="false" first-number="1" first-numbered-page="1" horizontal-location="right" style="Page Number" vertical-location="bottom"/><Group><Input><Text-field layout="Normal257" style="_cstyle21"><Font italic="false" size="18" underline="false">PROBABILISTIC APPROACH TO FRACTAL MODELLING OF SHAPES</Font></Text-field><Text-field layout="Normal256" style="Normal256">Wieslaw Kotarski (kotarski@gate.math.us.edu.pl) &amp; Agnieszka Lisowska (alisow@ux2.math.us.edu.pl)</Text-field><Text-field layout="Normal256" style="Normal256">Institute of Computer Science</Text-field><Text-field layout="Normal256" style="Normal256">Silesian University</Text-field><Text-field layout="Normal256" style="Normal256">Bedzinska 39</Text-field><Text-field layout="Normal256" style="Normal256">41-200 Sosnowiec, Poland</Text-field><Text-field layout="Normal256" style="Normal256"/></Input></Group><Section collapsed="true"><Title><Text-field layout="Heading 1" style="Heading 1">1. INTRODUCTION</Text-field></Title><Text-field layout="Normal" style="Normal">         This worksheet is the continuation of the one  published at<Font bold="false" family="Times New Roman" foreground="[0,0,0]" italic="false" style="_cstyle258" underline="false">  Maplesoft home page: </Font><Hyperlink bold="false" executable="false" family="Times New Roman" hyperlink="true" linktarget="http://www.maplesoft.com/applications/app_center_view.aspx?AID=1651 " size="12" style="Hyperlink">http://www.maplesoft.com/applications/app_center_view.aspx?AID=1651 </Hyperlink><Font bold="false" family="Times New Roman" foreground="[0,0,0]" italic="false" style="_cstyle264" underline="false">in February, 2005, by the same authors [3]. We recall that basing on the astonishing result by Goldman [2] it is possible to construct Iterated Function System (IFS) for Bezier curves and render them as attractors of their IFS. That IFS is uniquely determined by Bezier control points. Unfortunately Goldman's method fails for linear segments that are in fact Bezier curves of degree 1. In  [3] we described in details how to construct IFS  both for quadratic Bezier curves and for linear segments. Quadratic Bezier arcs and linear segments create a set of  parts of which one can  made every shape with a sufficient accuracy.  Then in [3] we demonstrated some examples of contours (heart, leaves) generated fractally basing on a suitable set of IFS using deterministic method.. </Font></Text-field><Text-field layout="Normal" style="Normal"><Font bold="false" family="Times New Roman" foreground="[0,0,0]" italic="false" style="_cstyle259" underline="false">         In this worksheet we show the second method for fractal generation of contours basing on IFS but using the probabilistic approach [1]. </Font>Consider the set of contractive mappings IFS={F1,...,Fk} with probabilities P={p1,...,pk}such that  0&lt;p<Font bold="false" family="Times New Roman" foreground="[0,0,0]" size="12" style="_cstyle265" underline="false">i</Font>,  <Font bold="false" family="Times New Roman" foreground="[0,0,0]" size="12" style="_cstyle267" underline="false">i</Font>=1,...,k  and  <Equation input-equation="sum(p*i,i = 1 .. k) = 1" style="2D Comment">NiMvLSUkc3VtRzYkKiYlInBHIiIiJSJpR0YpL0YqO0YpJSJrR0Yp</Equation>. It means that to any mapping Fi, <Font bold="false" family="Times New Roman" foreground="[0,0,0]" size="12" style="_cstyle266" underline="false">i=</Font>1..,k  the probability  pi  is associated. Such a system is called IFS with probabilities [1]. The iteration process starts from any initial point [x0, y0] on the plane. Next  that point is transformed by a  mapping  chosen from IFS, randomly. The process is repeated to the transformed point. After a number of iterations an attractor (a required shape) appears. </Text-field><Text-field layout="Normal" style="Normal">         In this worksheet we present some shapes (heart, fish, fox, flower) generated with he help of random IFS that characterize a given contour. </Text-field></Section><Section collapsed="true"><Title><Text-field layout="Heading 1" style="Heading 1"> 2. MAPLE PROGRAM</Text-field></Title><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">restart;
with(plots):</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">with(linalg):</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">DEFINITION OF HOMOGENOUS POINT IN R2</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">P:=(x,y)-&gt;[x,y,1];</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">DEFINITION OF SCALING MATRIX</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">S:=(s)-&gt;[[s,0,0],[0,s,0],[0,0,1]];</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">DEFINITION OF ROTATION MATRIX</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">R:=(alpha)-&gt;[[cos(alpha),sin(alpha),0],[-sin(alpha),cos(alpha),0],[0,0,1]];</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">DEFINITION OF TRANSLATION MATRIX</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">T:=(tx,ty)-&gt;[[1,0,0],[0,1,0],[tx,ty,1]];</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">DEFINITION OF BERSTEIN POLYNOMIALS</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">B:=(i,n,u)-&gt;(n!/(i!*(n-i)!)*(1-u)^(n-i)*u^i);</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">PROCEDURE FOR CREATING TWO FUNCTIONS f1,f2 FROM GIVEN COEFFICENTS: a,b,c,d,e,f</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">MakeMapFromCoeffs:=proc(a,b,c,d,e,f)
   local x, y;
   unapply([a*x+b*y+e,c*x+d*y+f],x,y);
end:
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">GENERATOR OF UNIFORM RANDOMLY DISTRIBUTED NUMBERS 1 or 2 </Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">d:=rand(1..2):
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">PROCEDURE FOR GENERATING OF QUADRATIC BEZIER CURVE (three non-colinear points P0,P1,P2, starting point [x0,y0] and n the number of iterations should be given) </Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">BezProb:=proc(P0,P1,P2,x0,y0,n)
local L, M, PP, LP, MP, i, l, z, dd, x, y, f1, f2:
L:= [[B(0,0,1/2),0,0],[B(0,1,1/2),B(1,1,1/2),0],[B(0,2,1/2),B(1,2,1/2),B(2,2,1/2)]];</Font></Text-field><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">M:=[[B(0,2,1/2),B(1,2,1/2),B(2,2,1/2)],[0,B(0,1,1/2),B(1,1,1/2)],[0,0,B(0,0,1/2)]];
PP:=[P0,P1,P2];</Font></Text-field><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">LP:=evalm(inverse(PP)&amp;*L&amp;*PP);</Font></Text-field><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">MP:=evalm(inverse(PP)&amp;*M&amp;*PP);</Font></Text-field><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">f1:=MakeMapFromCoeffs(LP[1,1],LP[2,1],LP[1,2],LP[2,2],LP[3,1],LP[3,2]);
f2:=MakeMapFromCoeffs(MP[1,1],MP[2,1],MP[1,2],MP[2,2],MP[3,1],MP[3,2]);</Font></Text-field><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">x[0]:=x0:
y[0]:=y0:
z[0]:=[x[0],y[0]]:
for i from 0 to n do
dd:=d():
if  dd=1 then z[i+1]:=evalf(f1(z[i][1],z[i][2])): 
else z[i+1]:=evalf(f2(z[i][1],z[i][2])):
fi:
od:
i:='i':
l:={seq(z[i],i=0..n)}:
pointplot(l,symbol=CROSS,axes=none,color=black):
end:
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">AN EXAMPLE - BEZIER CURVE FRACTALLY GENERATED IN A PROBABILISTIC WAY</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">BezProb(P(-1,3),P(4,1),P(1,-3),1,2,500);
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">PROCEDURE FOR GENERATING OF A LINEAR SEGMENT (two points P0,P1 of segment,starting point [x0,y0] and n the number of iterations should be given). The first P0 point should have smaller x-coordinate than the second one P1!  </Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">SegProb:=proc(P1,P2,x0,y0,n)
local i, k, alpha, tt, M, invM, F1, F2, FM1, FM2, f1, f2, x, y, z, l, dd;
k:=sqrt((P1[1]-P2[1])*(P1[1]-P2[1])+(P1[2]-P2[2])*(P1[2]-P2[2]));
if P1[1]-P2[1]&lt;&gt;0 then
    alpha:=arctan((P1[2]-P2[2])/(P1[1]-P2[1]));
else
    alpha:=Pi/2;
end if;
tt:=[P1[1],P1[2]];
M:=evalm(S(k)&amp;*R(alpha)&amp;*T(tt[1],tt[2]));
invM:=inverse(evalm(S(k)&amp;*R(alpha)&amp;*T(tt[1],tt[2])));
F1:=[[1/2,0,0],[0,1/2,0],[0,0,1]];
F2:=[[1/2,0,0],[0,1/2,0],[1/2,0,1]];
FM1:=evalf(evalm(invM&amp;*F1&amp;*M)):
FM2:=evalf(evalm(invM&amp;*F2&amp;*M));
f1:=MakeMapFromCoeffs(FM1[1,1],FM1[2,1],FM1[1,2],FM1[2,2],FM1[3,1],FM1[3,2]);
f2:=MakeMapFromCoeffs(FM2[1,1],FM2[2,1],FM2[1,2],FM2[2,2],FM2[3,1],FM2[3,2]);
x[0]:=x0:
y[0]:=y0:
z[0]:=[x[0],y[0]]:
for i from 0 to n do
dd:=d():
if  dd=1 then z[i+1]:=evalf(f1(z[i][1],z[i][2])): 
else z[i+1]:=evalf(f2(z[i][1],z[i][2])):
fi:
od:
i:='i':
l:={seq(z[i],i=0..n)}:
pointplot(l,symbol=CROSS,axes=none,color=black):
end:
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">AN EXAMPLE - LINEAR SEGMENT FRACTALLY GENERATED IN A PROBABILISTIC WAY</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">SegProb(P(2,2),P(3,5),1,2,500);
</Font></Text-field></Input></Group></Section><Section collapsed="true"><Title><Text-field layout="Heading 1" style="Heading 1">3. EXAMPLES </Text-field></Title><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">EXAMPLE 1 - A HEART GENERATED FRACTALLY</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">for n from 0 by 50 to 300 do
display(
BezProb(P(-1,0,1),P(-1,1,1),P(0,0,1),1,2,n),
BezProb(P(0,0,1),P(1,1,1),P(1,0,1),1,2,n),
BezProb(P(-1,0,1),P(-1,-1,1),P(0,-2,1),1,2,n),
BezProb(P(0,-2,1),P(1,-1,1),P(1,0,1),1,2,n),
title="HEART" ,scaling=constrained);
print(Iteration = n);
od;
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">EXAMPLE 2 - A FISH GENERATED FRACTALLY</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">for n from 50 by 50 to 200 do
display(
BezProb(P(166,62), P(193,80), P(202,107),1,2,n),
BezProb(P(202,107), P(202,118), P(259,113),1,2,n),
SegProb(P(259,113), P(315,145),1,2,n),
BezProb(P(315,145), P(262,231), P(226,222),1,2,n),
SegProb(P(208,267),P(226,222), 1,2,n),
BezProb(P(208,267), P(181,252), P(190,222),1,2,n),
SegProb(P(175,217),P(190,222),1,2,n),
BezProb(P(175,217), P(166,199), P(140,246),1,2,n),
SegProb(P(116,205),P(140,246),1,2,n),
SegProb(P(48,264),P(116,205),1,2,n),
SegProb(P(48,264), P(60,202),1,2,n),
BezProb(P(60,202), P(33,181), P(15,145),1,2,n),
SegProb(P(15,145), P(98,175),1,2,n),
BezProb(P(98,175), P(128,166), P(146,136),1,2,n),
BezProb(P(146,136), P(128,104), P(166,62),1,2,n), 
scaling=constrained, title="FISH");
print(Iteration = n);
od;
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">EXAMPLE 3 - A FOX GENERATED FRACTALLY</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">n:=100;</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">fox:=display(
SegProb(P(239,48),P(250,62), 1,2,n), 
BezProb(P(239,48), P(252,65), P(236,75), 1,2,n),
SegProb(P(235,58),P(236,75), 1,2,n),
SegProb(P(215,75),P(235,58), 1,2,n),
SegProb(P(215,75), P(218,58), 1,2,n),
BezProb(P(218,58), P(202,72), P(210,94), 1,2,n),
SegProb(P(193,118),P(210,94),1,2,n),
SegProb(P(193,118), P(200,150), 1,2,n),
BezProb(P(200,150), P(253,213), P(244,221), 1,2,n),
BezProb(P(244,221), P(171,171), P(114,80), 1,2,n),
BezProb(P(114,80), P(125,65), P(120,49), 1,2,n),
SegProb(P(96,63),P(120,49),1,2,n),
SegProb(P(69,45),P(96,63),1,2,n),
BezProb(P(69,45), P(80,58), P(49,80), 1,2,n),
BezProb(P(49,80), P(33,73), P(25,87), 1,2,n),
BezProb(P(25,87), P(35,105), P(60,115), 1,2,n),
BezProb(P(60,115), P(86,163), P(70,158), 1,2,n),
BezProb(P(70,158), P(75,150), P(85,181), 1,2,n),
SegProb(P(85,181), P(85,202), 1,2,n),
SegProb(P(37,250),P(85,202), 1,2,n),
SegProb(P(15,259),P(37,250), 1,2,n),
SegProb(P(15,259), P(45,262), 1,2,n),
BezProb(P(45,262), P(58,242), P(89,234), 1,2,n),
SegProb(P(57,266),P(89,234), 1,2,n),
BezProb(P(57,266), P(45,262), P(29,277), 1,2,n),
BezProb(P(29,277), P(24,282), P(56,282), 1,2,n),
SegProb(P(56,282), P(92,266), 1,2,n),
SegProb(P(87,284),P(92,266), 1,2,n),
BezProb(P(87,284), P(109,289), P(123,279), 1,2,n),
BezProb(P(123,279), P(149,294), P(228,265), 1,2,n),
BezProb(P(228,265), P(257,287), P(295,273), 1,2,n),
SegProb(P(295,273), P(313,252), 1,2,n),
BezProb(P(313,252), P(325,210), P(280,163), 1,2,n),
BezProb(P(280,163), P(271,126), P(295,98), 1,2,n),
SegProb(P(281,97),P(295,98),1,2,n),
SegProb(P(281,97), P(288,84), 1,2,n),
SegProb(P(276,97),P(288,84), 1,2,n),
BezProb(P(276,97), P(250,69), P(277,58), 1,2,n),
BezProb(P(277,58), P(265,63), P(250,47), 1,2,n),
SegProb(P(250,47), P(250,62), 1,2,n), scaling=constrained):
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">We rotate the fox using the build-in Maple function</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">plottools[rotate](fox,Pi);</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">EXAMPLE 4 - A FLOWER GENERATED FRACTALLY</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">n:=300;</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">flower:=display(
SegProb(P(111,16), P(118,41),1,2,n),
BezProb(P(118,41), P(102,36), P(92,45),1,2,n),
BezProb(P(92,45), P(86,64), P(115,65),1,2,n),
BezProb(P(115,65), P(94,62), P(91,83),1,2,n),
BezProb(P(91,83), P(96,103), P(118,97),1,2,n),
BezProb(P(118,97), P(99,114), P(115,131),1,2,n),
BezProb(P(115,131), P(125,143), P(148,110),1,2,n),
SegProb(P(142,132),P(148,110),1,2,n),
SegProb(P(142,132), P(152,192),1,2,n),
BezProb(P(152,192), P(127,189), P(99,213),1,2,n),
SegProb(P(99,213), P(107,298),1,2,n),
BezProb(P(107,298), P(142,328), P(190,306),1,2,n),
SegProb(P(190,306), P(214,220),1,2,n),
BezProb(P(214,220), P(190,196), P(167,198),1,2,n),
SegProb(P(167,198), P(206,169),1,2,n),
BezProb(P(206,169), P(178,185), P(158,170),1,2,n),
BezProb(P(158,170), P(181,152), P(175,121),1,2,n),
SegProb(P(175,121), P(192,149),1,2,n),
SegProb(P(192,149), P(209,159),1,2,n),
BezProb(P(209,159), P(221,150), P(207,127),1,2,n),
BezProb(P(207,127), P(222,138), P(236,125),1,2,n),
BezProb(P(236,125), P(243,106), P(220,97),1,2,n),
SegProb(P(220,97), P(231,73),1,2,n),
SegProb(P(207,62),P(231,73),1,2,n),
SegProb(P(207,62), P(219,38),1,2,n),
BezProb(P(219,38), P(202,30), P(181,53),1,2,n),
SegProb(P(181,53), P(187,28),1,2,n),
SegProb(P(162,16),P(187,28),1,2,n),
BezProb(P(162,16), P(149,12), P(152,49),1,2,n),
SegProb(P(135,15),P(152,49),1,2,n),
SegProb(P(111,16),P(135,15),1,2,n)):
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">display(plottools[rotate](flower,Pi),title="FLOWER");</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">EXAMPLE 5 - Flower - Animation</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">for n from 0 by 5 to 50 do
flower[n]:=display(
SegProb(P(111,16), P(118,41),1,2,n),
BezProb(P(118,41), P(102,36), P(92,45),1,2,n),
BezProb(P(92,45), P(86,64), P(115,65),1,2,n),
BezProb(P(115,65), P(94,62), P(91,83),1,2,n),
BezProb(P(91,83), P(96,103), P(118,97),1,2,n),
BezProb(P(118,97), P(99,114), P(115,131),1,2,n),
BezProb(P(115,131), P(125,143), P(148,110),1,2,n),
SegProb(P(142,132),P(148,110),1,2,n),
SegProb(P(142,132), P(152,192),1,2,n),
BezProb(P(152,192), P(127,189), P(99,213),1,2,n),
SegProb(P(99,213), P(107,298),1,2,n),
BezProb(P(107,298), P(142,328), P(190,306),1,2,n),
SegProb(P(190,306), P(214,220),1,2,n),
BezProb(P(214,220), P(190,196), P(167,198),1,2,n),
SegProb(P(167,198), P(206,169),1,2,n),
BezProb(P(206,169), P(178,185), P(158,170),1,2,n),
BezProb(P(158,170), P(181,152), P(175,121),1,2,n),
SegProb(P(175,121), P(192,149),1,2,n),
SegProb(P(192,149), P(209,159),1,2,n),
BezProb(P(209,159), P(221,150), P(207,127),1,2,n),
BezProb(P(207,127), P(222,138), P(236,125),1,2,n),
BezProb(P(236,125), P(243,106), P(220,97),1,2,n),
SegProb(P(220,97), P(231,73),1,2,n),
SegProb(P(207,62),P(231,73),1,2,n),
SegProb(P(207,62), P(219,38),1,2,n),
BezProb(P(219,38), P(202,30), P(181,53),1,2,n),
SegProb(P(181,53), P(187,28),1,2,n),
SegProb(P(162,16),P(187,28),1,2,n),
BezProb(P(162,16), P(149,12), P(152,49),1,2,n),
SegProb(P(135,15),P(152,49),1,2,n),
SegProb(P(111,16),P(135,15),1,2,n)):
od:</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">display(seq(plottools[rotate](flower[5*i],Pi),i=0..10),insequence=true);</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">EXAMPLE 6 - a LEAF GENERATED FRACTALLY</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">n:=200;</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">display(
BezProb(P(72,168), P(53,146), P(52,113),100,2,n),
BezProb(P(52,113), P(46,97), P(33,83),100,2,n),
BezProb(P(33,83), P(40,90), P(145,84),100,2,n),
SegProb(P(145,84), P(151,77),100,2,n),
BezProb(P(151,77), P(158,44), P(175,15),100,2,n),
BezProb(P(175,15), P(190,41), P(215,51),100,2,n),
SegProb(P(215,51), P(240,80),100,2,n),
BezProb(P(240,80), P(268,132), P(252,157),100,2,n),
BezProb(P(252,157), P(296,152), P(298,159),100,2,n),
SegProb(P(253,164),P(298,159),100,2,n),
BezProb(P(253,164), P(263,215), P(233,253),100,2,n),
SegProb(P(225,267),P(233,253),100,2,n),
BezProb(P(225,267), P(194,284), P(175,314),100,2,n),
BezProb(P(175,314), P(173,296), P(153,255),100,2,n),
SegProb(P(146,251),P(153,255),100,2,n),
SegProb(P(127,252),P(146,251),100,2,n),
SegProb(P(103,259),P(127,252),100,2,n),
BezProb(P(103,259), P(43,252), P(33,263),100,2,n),
BezProb(P(33,263), P(49,256), P(72,168),100,2,n),
scaling=constrained,title="TULIP");
</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">EXAMPLE 7 - Leaf - Animation</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">for n from 0 by 2 to 30 do
tulip[n]:=display(
BezProb(P(72,168), P(53,146), P(52,113),100,2,n),
BezProb(P(52,113), P(46,97), P(33,83),100,2,n),
BezProb(P(33,83), P(40,90), P(145,84),100,2,n),
SegProb(P(145,84), P(151,77),100,2,n),
BezProb(P(151,77), P(158,44), P(175,15),100,2,n),
BezProb(P(175,15), P(190,41), P(215,51),100,2,n),
SegProb(P(215,51), P(240,80),100,2,n),
BezProb(P(240,80), P(268,132), P(252,157),100,2,n),
BezProb(P(252,157), P(296,152), P(298,159),100,2,n),
SegProb(P(253,164),P(298,159),100,2,n),
BezProb(P(253,164), P(263,215), P(233,253),100,2,n),
SegProb(P(225,267),P(233,253),100,2,n),
BezProb(P(225,267), P(194,284), P(175,314),100,2,n),
BezProb(P(175,314), P(173,296), P(153,255),100,2,n),
SegProb(P(146,251),P(153,255),100,2,n),
SegProb(P(127,252),P(146,251),100,2,n),
SegProb(P(103,259),P(127,252),100,2,n),
BezProb(P(103,259), P(43,252), P(33,263),100,2,n),
BezProb(P(33,263), P(49,256), P(72,168),100,2,n),
scaling=constrained,title="TULIP");
od:</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"><Font italic="false" size="12" underline="false">display(seq(tulip[n*2],n=0..15),insequence=true,scaling=constrained);</Font></Text-field></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" prompt="&gt; " style="Maple Input"/></Input></Group><Group><Input><Text-field layout="Normal" style="Normal"/><Text-field layout="Normal" style="_cstyle21"><Font italic="false" size="12" underline="false">We encourage to experiment with your own examples!</Font></Text-field><Text-field layout="Normal" style="_cstyle21"/></Input></Group></Section><Section collapsed="true"><Title><Text-field layout="Heading 1" style="Heading 1">4. CONCLUSIONS</Text-field></Title><Text-field layout="Normal" style="Normal">         In this worksheet we showed some examples of shapes which have been generated by iterations starting from any initial point of the plane. It is clear that if any contour can be represented as a set of linear segments and quadratic Bezier arcs then we can construct the system of IFS that generate the given contour fractally using the probabilistic approach. It is worth to mention that generated contours appear progressively. It means that with the increasing number of iterations the contour is more and more distincly visible. That fact can be of  importance during e.g. transmission of data on shapes through the net. And at the end it should be said that it seems to be possible to extend the method to 3D for fractal generation of Bezier patches.</Text-field></Section><Section collapsed="true"><Title><Text-field layout="Heading 1" style="Heading 1">5. REFERENCES</Text-field></Title><Text-field layout="Heading 1259" style="_cstyle262"><Font bold="false" family="Times New Roman" foreground="[0,0,0]" italic="false" underline="false">[1] Barnsley M.; Fractals Everywhere, Academic Press, Boston, (1993).</Font></Text-field><Text-field layout="Normal260" style="Normal260"><Font bold="false" family="Times New Roman" foreground="[0,0,0]" italic="false" style="_cstyle263" underline="false">[2] Goldman R.; The fractal nature of Bezier curves, Proceedings of the Geometric Modelling and Processing, April 13-15, Beijing, China, 3-11, (2004).
[3] Kotarski W., Lisowska W., On fractal modelling of contours, home page of Maplesoft, (2005), </Font><Hyperlink bold="false" executable="false" family="Times New Roman" hyperlink="true" linktarget="http://www.maplesoft.com/applications/app_center_view.aspx?AID=1651" size="14" style="Hyperlink">http://www.maplesoft.com/applications/app_center_view.aspx?AID=1651</Hyperlink></Text-field><Text-field layout="Normal" style="Normal"/><Text-field layout="Normal" style="Normal"/><Text-field layout="Normal" style="Normal"> The undersigned (the "Author") has developed an Application (the "Application") using Maple and wishes to submit the Application to Maplesoft, a division of Waterloo Maple Inc. for publication by Maplesoft or its agents. 

1. The Author grants to Maplesoft a non-exclusive, perpetual License and right to use all or any part of the Application, to modify or adapt the Application for the promotion of Maplesoft. 
2. The Author represents that the Application is the original work of the Author, the Author has the right to grant a License to Maplesoft with respect to the Application, no other party has any right, title or interest in or to the Application, and that the use of the Application by Maplesoft will not infringe any intellectual property rights of any third party. 
3. The Author agrees to execute such documents and take such other action as Maplesoft may request in order to give effect to the intention of this License Agreement. 
This License Agreement shall be binding upon and inure to the benefit of the Author, and all heirs, executors, administrators, successors and permitted assigns of the Author. 
</Text-field></Section><Text-field layout="Heading 1" style="Heading 1"/><Text-field/></Worksheet>