Hexagon circle) with vertices given by the six intersections of the edges of a triangle and the three lines that are parallel to the edges that pass through its symmedian point. If the successive sides of a cyclic hexagon are "a", "b", "c", "d", "e", "f", then the three main diagonals intersect in a single point if and only if . If, for each side of a cyclic hexagon, the adjacent sides are extended to their intersection, forming a triangle exterior to the given side, then the segments connecting the circumcenters of opposite triangles are concurrent. If a hexagon has vertices
Heesch's problem a tile may be surrounded, its Heesch number is said to be infinite. In this case, an argument based on Kőnig's lemma can be used to show that there exists a tessellation of the whole plane by congruent copies of the tile. Consider the non-convex polygon "P" shown in the figure to the right, which is formed from a regular hexagon by adding projections on two of its sides and matching indentations on three sides. The figure shows a tessellation consisting of 61 copies of "P", one large infinite region, and four small diamond-shaped polygons within the fourth layer. The