Performance of Random Lattice Algorithms
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 for the two types of random lattices and find that the average computation time is proportional to the number of points on the lattice.
cond-mat↗