Please register and log-in to create and edit pages

User Tools

    Please register and log-in to create and edit pages

Site Tools


Main Menu

Main menu
Click categories to expand


A-Z listingplugin-autotooltip__plain plugin-autotooltip_bigA-Z listing

This is an alphabetical index of all content pages.


Other categories

Utilities

Contacts
Register

Also see

Importance Ratings
News
Legal
Donate/Sponsor


Wikenigma supports:


Feeds etc
rss / xml feed
sitemap file
A-Z listing (archived)


Auto-Translate Site

Wikenigma - an Encyclopedia of Unknowns Wikenigma - an Encyclopedia of the Unknown

The Kelvin problem (3-D packing)

In 2 dimensions, the most efficient packing mechanism is an array of hexagons - a honeycomb. In 1887, William Thomson (Lord Kelvin) asked the question 'What is the most efficient 3-D packing system?“

See (the original paper) : On the Division of Space with Minimla Partitional Area

He suggested that it was the 'bitruncated cubic honeycomb' which, until 1993, was widely recognised as the most efficient possible.

It was succeeded, however, by the Weaire–Phelan Structure (see Wikipedia) - found by computerised simulations of foam generation - which is currently the most efficient form yet found.

The question of whether the Weaire–Phelan Structure is the most efficient 3-D packing structure - having the smallest surface area per cell - is however still open. Subsequent mathematical simulations suggest that it is optimal - but this remains unproven.


Also see : Ulam's packing conjectureplugin-autotooltip__plain plugin-autotooltip_bigUlam's packing conjecture

When packing convex identical 3-dimensional objects into a defined space, is a sphere the most 'efficient' shape when considering the amount of free space in the gaps?

According to the conjecture, the sphere is the convex solid which forces t…


    Share this page :

Dear reader : Do you have any suggestions for the site's content?

Ideas for new topics, and suggested additions / corrections for old ones, are always welcome.

If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !


Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.

( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)

Automatic Translation

You are currently viewing an auto-translated version of Wikenigma

Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.

Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.

Show another (random) page

DOKUWIKI IMPLEMENTATION DESIGN BY UNIV.ORG.UK SEPTEMBER 2021