Timeline for Random Sequential Adsorption of Discs on a Plane - What is the best known lowerbound for the number of circles (of some radius $r$) guaranteed to fit on $[0, 1]^2$?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2013 at 7:29 | vote | accept | FloatingLantern | ||
| Apr 13, 2013 at 7:29 | comment | added | FloatingLantern | @DouglasZare Oh, I'm sorry I sloppily misread your posting. | |
| Apr 13, 2013 at 7:22 | comment | added | Douglas Zare | @FloatingLantern: Covering by discs of radius $2r$ is the same thing as being unable to place a disc of radius $r$. | |
| Apr 13, 2013 at 5:34 | comment | added | FloatingLantern | @DouglasZare I'm not really asking how efficient the packing can be. I'm asking, given that the circles are placed on the surface randomly, what value of $N$ can strictly be achieved without jamming. | |
| Apr 13, 2013 at 5:33 | vote | accept | FloatingLantern | ||
| Apr 13, 2013 at 5:33 | |||||
| Apr 13, 2013 at 4:48 | history | answered | Douglas Zare | CC BY-SA 3.0 |