To see how this may be done, shift back to the
origin by subtracting
from everything. We
now have an ellipse given by
![]()
Now suppose
has a square root
which,
like
and
is symmetric. Then
we can write the above equation as
![]()
since
.
Now if
we have
,
which means that
is on the unit circle,
S1, in
. We can therefore describe the ellipse
as
![]()
![]()

It is easy to draw sets on a computer when they
have been parametrised by a single real number.
The following few lines of C code indicate how
we can trace the path of a circle with time running
from 0 to
, or at least a discrete approximation
to it:
for(int_time = 0; int_time < 629; int_time++){
time = int_time/100;
x = 100* cos(time) + 200;
y = 200 - 100*sin(time);
putpixel(x,y);
};
This will draw a circle at centre (200,200) of
radius 100. The choice of 629 calls for some
explanation
which I leave to the reader. The drawing ellipse,
The result of generating points according to a few gaussian distributions (well, more or less. It was faked, of course) in the plane and displaying them on a computer is shown in Fig.4.1. Six gaussians were chosen so as to produce a ghostly hand which may be seen with the eye of faith.
The ellipses representing not one but 3 standard deviations are (mostly) drawn in the next diagram, Fig.4.2, where they should satisfy the most captious that they are doing something to represent the distribution of the points in the data set all on their own.