Performance of Random Lattice Algorithms

Details Performance of Random Lattice Algorithms Performance of Random Lattice Algorithms

1993-05-05

arxiv.org/abs/cond-mat/9305003v1

Int.J.Mod.Phys. C5 (1994) 909-922

Physics

Condensed Matter

12 pages (without figures), LaTeX, HLRZ-Preprint 30/93

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Performance of Random Lattice Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Performance of Random Lattice Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance of Random Lattice Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494354