Generation of 2D fractal trees

This small function is used for generation and visualisation of fractal trees

% This function allow you to bild fractal trees
% by using modified algorithms based on the so-called Kantor`s array
% and method of inverse trace
% These methods allow you to economise time and computer memory
% considerably
% It`s arguments:
% Fraktal(n,r,phi,xb,yb)
% n - number of iterations
% r - scale factor
% in case of nonuniform fractals where different scale-factors take
% place, r may be vector (in this case the lengths of r and phi must be equal)
% phi - vector of angles in fractal generator that are calculated
% relative to the horizontal axis connecting end points of generator
% xb and yb - coordinates of trunk
%
% For example for famous Pifagorus`s tree in it`s vertical position the call of this function is
% so:
% FraktalT(n,0.5,[pi/4,-pi/4],[0,0],[0,1])
% n is recommended to be in range 1..12 not to call the overloaded of stack