Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7706530> ?p ?o }
Showing triples 1 to 24 of
24
with 100 triples per page.
- Q7706530 subject Q8519788.
- Q7706530 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.".
- Q7706530 thumbnail Tetrahedron_packing_structure_png.png?width=300.
- Q7706530 wikiPageExternalLink 16056329?story_id=16056329.
- Q7706530 wikiPageExternalLink mg20627604.100-pyramids-are-the-best-shape-for-packing.html.
- Q7706530 wikiPageExternalLink 05tetr.html.
- Q7706530 wikiPageWikiLink Q160003.
- Q7706530 wikiPageWikiLink Q18356153.
- Q7706530 wikiPageWikiLink Q18385933.
- Q7706530 wikiPageWikiLink Q214856.
- Q7706530 wikiPageWikiLink Q232207.
- Q7706530 wikiPageWikiLink Q263214.
- Q7706530 wikiPageWikiLink Q268961.
- Q7706530 wikiPageWikiLink Q3847067.
- Q7706530 wikiPageWikiLink Q3851477.
- Q7706530 wikiPageWikiLink Q5282593.
- Q7706530 wikiPageWikiLink Q7839930.
- Q7706530 wikiPageWikiLink Q8087.
- Q7706530 wikiPageWikiLink Q8519788.
- Q7706530 wikiPageWikiLink Q868.
- Q7706530 wikiPageWikiLink Q900117.
- Q7706530 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.".
- Q7706530 label "Tetrahedron packing".
- Q7706530 depiction Tetrahedron_packing_structure_png.png.