We have implemented different algorithms for generating Poissonian and
vectorizable random lattices. The random lattices fulfil the Voronoi/
Delaunay construction. We measure the performance of our algorithms fo
r the two types of random lattices and find that the average computati
on time is proportional to the number of points on the lattice.