'''Lubachevsky-Stillinger (compression) algorithm''' (LS algorithm, LSA, or LS protocol) is a numerical procedure suggested by [[F. H. Stillinger]] and B.Boris D. Lubachevsky that simulates or imitates a physical process of compressing an assembly of hard particles.<ref name="StillingerLubachevskyJStat">{{cite journal|doi=10.1007/bf01025983|url=https://www.princeton.edu/~fhs/geodisk/geodisk.pdf|title=Geometric properties of random disk packings|journal=Journal of Statistical Physics|volume=60|issue=5–6|pages=561–583|year=1990|last1=Lubachevsky|first1=Boris D.|last2=Stillinger|first2=Frank H.|bibcode=1990JSP....60..561L|s2cid=15485746 }}</ref> As the LSA may need thousands of arithmetic operations even for a few particles, it is usually carried out on a 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]]
