Lubachevsky–Stillinger algorithm: Difference between revisions

Revision as of 05:48, 10 June 2011

Revision as of 15:21, 13 June 2011

Line 6:

of hard particles. As the LSA may need thousands of arithmetic operations even for a few particles,

it is usually carried out on a [[digital computer]].

[[File:1000_triangles_packed_in_rectangle.pdf|thumb|Using a variant of Lubachevsky-Stillinger algorithm, 1000 congruent isosceles triangles are randomly packed by compression in a rectangle with periodic (wrap-around) boundary. The rectangle which is the period of pattern repetition in both directions is shown. Packing density =is 0.8776. Shading intensity is made to depend on triangle orientation]]

==Phenomenology (what is being simulated)==