Zobrazeno 1 - 10
of 105
pro vyhledávání: '"tetrahedron packing"'
Publikováno v:
Chemical Science
While the [TO4] tetrahedron packing rule leads to millions of likely zeolite structures, there are currently only 252 types of zeolite frameworks reported after decades of synthetic efforts. The subtle synthetic conditions, e.g. the structure-directi
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Fomin, D.V., Eremin, I.E.
reviewed the problem of filling of space bounded by an arbitrary parallelepiped using tetrahedrons placed according to rules of the tetrahedral model of the hexagonal close packed structures. Described flaws of the basic and the improved algorithms o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae015eab6732df01f94ada2257da1624
Autor:
Chuanming Zong
In 1900, as a part of his 18th problem, Hilbert proposed the question to determine the densest congruent (or translative) packings of a given solid, such as the unit ball or the regular tetrahedron of unit edges. Up to now, our knowledge about this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::98f19f69e418a6c37fdc0d504c254e0a
http://arxiv.org/abs/1805.02222
http://arxiv.org/abs/1805.02222
Publikováno v:
Particuology. 23:109-117
The random packing of tetrahedral particles is studied by applying the discrete element method (DEM), which simulates the effects of friction, height ratio, and eccentricity. The model predictions are analyzed in terms of packing density and coordina
Autor:
David J. T. Liu, Qiang Du
Publikováno v:
International Journal of Computational Geometry & Applications. 25:37-56
While two-dimensional triangles are always subdivision invariant, the same does not always hold for their three-dimensional counterparts. We consider several interesting properties of those three-dimensional tetrahedra which are subdivision invariant
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Physics Letters A. 378:835-838
We investigate the excluded volumes of clusters in tetrahedral particle packing using an ideal tetrahedron model and Monte Carlo simulation. Both the influences of the size and topology of clusters on the excluded volume are studied. We find that the
Publikováno v:
Journal of Combinatorial Optimization. 29:197-215
While the problem of packing two-dimensional squares into a square, in which a set of squares is packed into a big square, has been proved to be NP-complete, the computational complexity of the d-dimensional ( $$ d\ge 3 $$ d ? 3 ) problems of packing
Publikováno v:
Computational Geometry. 47:52-60
For a set D of polyominoes, a packing of the plane with D is a maximal set of copies of polyominoes from D that are not overlapping. A packing with smallest density is called a clumsy packing. We give an example of a set D such that any clumsy packin