Tetrahedron packing
Channel:
Subscribers:
8,830
Published on ● Video Link: https://www.youtube.com/watch?v=o57VA7YJnIU
0In geometry, tetrahedron packing is the problem of arranging identical regular tetrahedra throughout three-dimensional space so as to fill the maximum possible fraction of space.
Currently, the best lower bound achieved on the optimal packing fraction of regular tetrahedra is 85.63%. Tetrahedra do not tile space, and an upper bound below 100% (namely, 1 − (2.6...)·10−25) has been reported.
Source: https://en.wikipedia.org/wiki/Tetrahedron_packing
Created with WikipediaReaderReborn (c) WikipediaReader
Other Videos By WikiReader
| 2021-07-31 | Glenamoy |
| 2021-07-31 | Phrynocephalus theobaldi |
| 2021-07-31 | Lisewko |
| 2021-07-31 | List of members of the European Parliament for Sweden, 2019–2024 |
| 2021-07-31 | Los Angeles Police Department resources |
| 2021-07-31 | Theodosia Monson, Baroness Monson |
| 2021-07-31 | Sylvester W. Osborn |
| 2021-07-31 | Open-circuit voltage |
| 2021-07-31 | Hymenolaena |
| 2021-07-31 | Warrenton High School (Missouri) |
| 2021-07-31 | Tetrahedron packing |
| 2021-07-31 | Malchus |
| 2021-07-31 | Chris McGrath (footballer) |
| 2021-07-31 | Kingston Hospital (disambiguation) |
| 2021-07-31 | SS Ava |
| 2021-07-31 | 1936–37 Svenska mästerskapet (men's handball) |
| 2021-07-31 | Jon Jackson |
| 2021-07-31 | Gogó Andreu |
| 2021-07-31 | Velia Abdel-Huda |
| 2021-07-31 | Milzau |
| 2021-07-31 | Freewind Bumble B |
Tags:
Apolloniangasket
Apollonianspherepacking
ArXividentifier
Aristotle
Bibcodeidentifier
Binpackingproblem
BulletinoftheAmericanMathematicalSociety
Celltransitive