Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Tetrahedron_packing> ?p ?o }
Showing triples 1 to 51 of
51
with 100 triples per page.
- Tetrahedron_packing abstract "In 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.".
- Tetrahedron_packing thumbnail Tetrahedron_packing_structure_png.png?width=300.
- Tetrahedron_packing wikiPageExternalLink 16056329?story_id=16056329.
- Tetrahedron_packing wikiPageExternalLink mg20627604.100-pyramids-are-the-best-shape-for-packing.html.
- Tetrahedron_packing wikiPageExternalLink 05tetr.html.
- Tetrahedron_packing wikiPageID "17918135".
- Tetrahedron_packing wikiPageLength "8021".
- Tetrahedron_packing wikiPageOutDegree "20".
- Tetrahedron_packing wikiPageRevisionID "677307814".
- Tetrahedron_packing wikiPageWikiLink Aristotle.
- Tetrahedron_packing wikiPageWikiLink Category:History_of_geometry.
- Tetrahedron_packing wikiPageWikiLink Category:Packing_problems.
- Tetrahedron_packing wikiPageWikiLink Cell-transitive.
- Tetrahedron_packing wikiPageWikiLink Disphenoid_tetrahedral_honeycomb.
- Tetrahedron_packing wikiPageWikiLink Geometry.
- Tetrahedron_packing wikiPageWikiLink Isohedral.
- Tetrahedron_packing wikiPageWikiLink Isohedral_figure.
- Tetrahedron_packing wikiPageWikiLink John_Horton_Conway.
- Tetrahedron_packing wikiPageWikiLink Monte_Carlo_method.
- Tetrahedron_packing wikiPageWikiLink Packing_density.
- Tetrahedron_packing wikiPageWikiLink Packing_problem.
- Tetrahedron_packing wikiPageWikiLink Packing_problems.
- Tetrahedron_packing wikiPageWikiLink Quasicrystal.
- Tetrahedron_packing wikiPageWikiLink Sphere_packing.
- Tetrahedron_packing wikiPageWikiLink Tessellation.
- Tetrahedron_packing wikiPageWikiLink Tetragonal_disphenoid_honeycomb.
- Tetrahedron_packing wikiPageWikiLink Tetrahedron.
- Tetrahedron_packing wikiPageWikiLink Triakis_truncated_tetrahedral_honeycomb.
- Tetrahedron_packing wikiPageWikiLink Ulams_packing_conjecture.
- Tetrahedron_packing wikiPageWikiLink File:Tetrahedral_Milk_Carton_Arrangement.jpg.
- Tetrahedron_packing wikiPageWikiLink File:Tetrahedron_packing_structure_png.png.
- Tetrahedron_packing wikiPageWikiLinkText "Tetrahedra".
- Tetrahedron_packing wikiPageWikiLinkText "Tetrahedron packing".
- Tetrahedron_packing wikiPageWikiLinkText "polyhedra".
- Tetrahedron_packing wikiPageWikiLinkText "tetrahedra".
- Tetrahedron_packing wikiPageWikiLinkText "tetrahedron packing".
- Tetrahedron_packing hasPhotoCollection Tetrahedron_packing.
- Tetrahedron_packing wikiPageUsesTemplate Template:Packing_problem.
- Tetrahedron_packing wikiPageUsesTemplate Template:Reflist.
- Tetrahedron_packing subject Category:History_of_geometry.
- Tetrahedron_packing subject Category:Packing_problems.
- Tetrahedron_packing hypernym Problem.
- Tetrahedron_packing type Disease.
- Tetrahedron_packing comment "In 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.".
- Tetrahedron_packing label "Tetrahedron packing".
- Tetrahedron_packing sameAs m.047s7y_.
- Tetrahedron_packing sameAs Q7706530.
- Tetrahedron_packing sameAs Q7706530.
- Tetrahedron_packing wasDerivedFrom Tetrahedron_packing?oldid=677307814.
- Tetrahedron_packing depiction Tetrahedron_packing_structure_png.png.
- Tetrahedron_packing isPrimaryTopicOf Tetrahedron_packing.
