This algorithm generates a realisation
of the uniform Poisson line process, and divides the window
win into tiles separated by these lines.
The argument lambda must be a positive number.
It controls the intensity of the process. The expected number of
lines intersecting a convex region of the plane is equal to
lambda times the perimeter length of the region.
The expected total length of the lines crossing a region of the plane
is equal to lambda * pi times the area of the region.