PERFORMANCE OF RANDOM LATTICE ALGORITHMS

Kent Bækgaard Lauritsen (), Harald Puhl () and Hans-Jürgen Tillemans
Additional contact information
Kent Bækgaard Lauritsen: HLRZ, Forschungszentrum Jülich, D-52425 Jülich, Germany
Harald Puhl: HLRZ, Forschungszentrum Jülich, D-52425 Jülich, Germany
Hans-Jürgen Tillemans: HLRZ, Forschungszentrum Jülich, D-52425 Jülich, Germany

International Journal of Modern Physics C (IJMPC), 1994, vol. 05, issue 06, 909-922

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.

Keywords: Delaunay Random Lattices; Voronoi Tessellations; Algorithms; Dynamic Pointer Structures (search for similar items in EconPapers)
Date: 1994
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183194001045
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:05:y:1994:i:06:n:s0129183194001045

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183194001045

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().