Revision as of 14:26, 12 April 2016 edit R'n'B (talk \| contribs) Administrators 425,841 edits m Disambiguated: Time Warp → Time Warp (algorithm); Unlinked: Time Warp Tag: Dispenser [1.0] ← Previous edit		Revision as of 00:32, 17 June 2016 edit undo Lembit Staan (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 69,433 edits No edit summary Next edit →
Line 1: '''Lubachevsky-Stillinger (compression) algorithm''' (LS algorithm, LSA, or LS protocol) is a numerical procedure that simulates or imitates a physical process of compressing an assembly 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.png\|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]] In was suggested by [[F. H. Stillinger]] and B.D. Lubachevcky ==Phenomenology==

Lubachevsky–Stillinger algorithm: Difference between revisions