Convex and discrete geometry Definition
Honeycomb
Builds on TessellationConvex polytopePolyhedron
Definition
Let . A honeycomb in is a tiling of whose tiles, called cells, are -dimensional convex polytopes. In dimension the cells are convex polyhedra.
Remarks
Example: the cubes with form the cubic honeycomb in . The cubes are convex polyhedra, every point lies in the cube with , and distinct cubes have disjoint interiors.
Non-example: copies of a regular tetrahedron cannot form a honeycomb in . Take a generic point on an edge of one cell. The cells through each fill either a wedge with the dihedral angle or a half-space, and these angles add up to . So or for some integer . Both fail, since and neither nor is an integer multiple of it.
Many authors also require the honeycomb to be face-to-face, so that two cells meet in a common face of both or not at all. The term is also used for tilings of hyperbolic space and of spheres by polytopes.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex polytope concept
- Polyhedron concept
- Tessellation concept
- Honeycomb definition
Further reading
About this page
| Tag | GQB3AS4WKQ |
|---|---|
| URI | m2://GQB3AS4WKQ |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52C22, 51M20, 05B45 |
| Defines | Honeycomb |
| Uses | Tessellation, Convex polytope, Polyhedron |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.