Honeycomb (geometry)

From Wikipedia, the free encyclopedia

(Redirected from Tessellation of space)
Jump to: navigation, search

In geometry, a honeycomb is a space filling or close packing of polyhedral cells, so that there are no gaps. It is a three-dimensional example of the more general mathematical tiling or tessellation in any number of dimensions.

Honeycomb is also sometimes used for higher dimensional tessellations as well. For clarity, George Olshevsky advocates limiting the term honeycomb to 3-space tessellations and expanding a systematic terminology for higher dimensions: tetracomb as tessellations of 4-space, and pentacomb as tessellations of 5-space, and so on.

Space-filling tessellations of hyperbolic space are also called honeycombs.

Contents

It is possible to fill the plane with polygons which do not meet at their corners, for example using rectangles, as in a brick wall pattern:

This is not a proper tiling because corners lie part way along the edge of a neighbouring polygon. Similarly, in a proper honeycomb, there must be no edges or vertices lying part way along the face of a neighbouring cell.

Just as a plane tiling is in some respects an infinite polyhedron or apeirohedron, so a honeycomb is in some respects an infinite four-dimensional polycell/polychoron.

There are infinitely many honeycombs, which have never been fully classified. The more regular ones have attracted the most interest, while a rich and varied assortment of others continue to be discovered.

The simplest honeycombs to build are formed from stacked layers or slabs of prisms based on some tessellation of the plane. In particular, for every parallelepiped, copies can fill space, with the cubic honeycomb being special because it is the only regular honeycomb in ordinary (Euclidean) space.

A uniform honeycomb is a honeycomb in Euclidean 3-space composed of uniform polyhedral cells, and having all vertices the same (i.e. it is vertex-transitive or isogonal). There are 28 convex examples, also called the Archimedean honeycombs. Of these, just one is regular and one quasiregular:

  • Regular honeycomb: Cubes.
  • Quasiregular honeycomb: Octahedra and tetrahedra.

A honeycomb having all cells identical within its symmetries is said to be cell-transitive or isochoric. A cell is said to be a space-filling polyhedron. Well-known examples include:


Truncated octahedra

Rhombic dodecahedra

rhombo-hexagonal dodecahedra

Weaire-Phelan structure
(With two types of cells)

Documented examples are rare. Two classes can be distinguished:

  • Non-convex cells which pack without overlapping, analogous to tilings of concave polygons. These include a packing of the small stellated rhombic dodecahedron.
  • Overlapping of cells whose positive and negative densities 'cancel out' to form a uniformly dense continuum, analogous to overlapping tilings of the plane.

Hyperbolic space behaves rather differently from ordinary Euclidean space, with cells fitting together according to rather different rules. Several hyperbolic honeycombs are already documented.

For every honeycomb there is a dual honeycomb, which may be obtained by exchanging:

cells for vertices.
walls for edges.

These are just the rules for dualising four-dimensional polychora, except that the usual finite method of reciprocation about a concentric hypersphere can run into problems.

The more regular honeycombs dualise neatly:

  • The cubic honeycomb is self-dual.
  • That of octahedra and tetrahedra is dual to that of rhombic dodecahedra.
  • The slab honeycombs derived from uniform plane tilings are dual to each other in the same way that the tilings are.
  • The duals of the remaining Archimedean honeycombs are all cell-transitive and have been described by Inchbald (1997).

  • Grünbaum & Shepherd, Uniform tilings of 3-space.
  • Coxeter; Regular polytopes.
  • Williams, R.; The geometrical foundation of natural structure.
  • Critchlow, K.; Order in space.
  • Pearce, P.; Structure in nature is a strategy for design.
  • Inchbald, G.: The Archimedean Honeycomb duals, The Mathematical Gazette 81, July 1997, p.p. 213-219.

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.