enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Hexagonal tiling - Wikipedia

    en.wikipedia.org/wiki/Hexagonal_tiling

    The honeycomb conjecture states that hexagonal tiling is the best way to divide a surface into regions of equal area with the least total perimeter. The optimal three-dimensional structure for making honeycomb (or rather, soap bubbles) was investigated by Lord Kelvin , who believed that the Kelvin structure (or body-centered cubic lattice) is ...

  3. Honeycomb conjecture - Wikipedia

    en.wikipedia.org/wiki/Honeycomb_conjecture

    It is also related to the densest circle packing of the plane, in which every circle is tangent to six other circles, which fill just over 90% of the area of the plane. The case when the problem is restricted to a square grid was solved in 1989 by Jaigyoung Choe who proved that the optimal figure is an irregular hexagon. [4] [5]

  4. List of Euclidean uniform tilings - Wikipedia

    en.wikipedia.org/wiki/List_of_euclidean_uniform...

    This includes the 3 regular tiles (triangle, square and hexagon) and 8 irregular ones. [4] Each vertex has edges evenly spaced around it. Three dimensional analogues of the planigons are called stereohedrons. These dual tilings are listed by their face configuration, the number of faces at each vertex of a face.

  5. Conway criterion - Wikipedia

    en.wikipedia.org/wiki/Conway_criterion

    In Gardner's article, this is called a type 1 hexagon. [7] This is also true of parallelograms . But the translations that match the opposite edges of these tiles are the composition of two 180° rotations—about the midpoints of two adjacent edges in the case of a hexagonal parallelogon , and about the midpoint of an edge and one of its ...

  6. Cairo pentagonal tiling - Wikipedia

    en.wikipedia.org/wiki/Cairo_pentagonal_tiling

    Each hexagon of one tiling surrounds two vertices of the other tiling, and is divided by the hexagons of the other tiling into four of the pentagons in the Cairo tiling. [4] Infinitely many different pentagons can form Cairo tilings, all with the same pattern of adjacencies between tiles and with the same decomposition into hexagons, but with ...

  7. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    The first rigorous proof is attributed to László Fejes Tóth in 1942. [ 1 ] [ 2 ] While the circle has a relatively low maximum packing density, it does not have the lowest possible, even among centrally-symmetric convex shapes : the smoothed octagon has a packing density of about 0.902414, the smallest known for centrally-symmetric convex ...

  8. Euclidean tilings by convex regular polygons - Wikipedia

    en.wikipedia.org/wiki/Euclidean_tilings_by...

    With a final vertex 3 4.6, 4 more contiguous equilateral triangles and a single regular hexagon. However, this notation has two main problems related to ambiguous conformation and uniqueness [2] First, when it comes to k-uniform tilings, the notation does not explain the relationships between the vertices. This makes it impossible to generate a ...

  9. List of second moments of area - Wikipedia

    en.wikipedia.org/wiki/List_of_second_moments_of_area

    Regular polygons; Description Figure Second moment of area Comment A filled regular (equiliteral) triangle with a side length of a = = [6] The result is valid for both a horizontal and a vertical axis through the centroid, and therefore is also valid for an axis with arbitrary direction that passes through the origin.