Performance of Random Lattice Algorithms

TL;DR

This paper evaluates the performance of various algorithms for generating Poissonian and vectorizable random lattices that satisfy Voronoi/Delaunay properties, highlighting the relationship between computation time and lattice size.

Contribution

It introduces and compares algorithms for generating specific types of random lattices and measures their performance characteristics.

Findings

Average computation time scales linearly with the number of points.

Algorithms successfully generate Poissonian and vectorizable lattices.

Performance varies depending on lattice type and algorithm implementation.

Abstract

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.