PERFORMANCE OF RANDOM LATTICE ALGORITHMS

Citation
Kb. Lauritsen et al., PERFORMANCE OF RANDOM LATTICE ALGORITHMS, International journal of modern physics C, 5(6), 1994, pp. 909-922
Citations number
18
Categorie Soggetti
Mathematical Method, Physical Science","Physycs, Mathematical","Computer Science Interdisciplinary Applications
ISSN journal
01291831
Volume
5
Issue
6
Year of publication
1994
Pages
909 - 922
Database
ISI
SICI code
0129-1831(1994)5:6<909:PORLA>2.0.ZU;2-9
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 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.