Concept

Truncated square tiling

Related concepts (8)
List of Euclidean uniform tilings
This table shows the 11 convex uniform tilings (regular and semiregular) of the Euclidean plane, and their dual tilings. There are three regular and eight semiregular tilings in the plane. The semiregular tilings form new tilings from their duals, each made from one type of irregular face. John Conway called these uniform duals Catalan tilings, in parallel to the Catalan solid polyhedra. Uniform tilings are listed by their vertex configuration, the sequence of faces that exist on each vertex. For example 4.
Snub square tiling
In geometry, the snub square tiling is a semiregular tiling of the Euclidean plane. There are three triangles and two squares on each vertex. Its Schläfli symbol is s{4,4}. Conway calls it a snub quadrille, constructed by a snub operation applied to a square tiling (quadrille). There are 3 regular and 8 semiregular tilings in the plane. There are two distinct uniform colorings of a snub square tiling. (Naming the colors by indices around a vertex (3.3.4.3.4): 11212, 11213.
Conway polyhedron notation
In geometry, Conway polyhedron notation, invented by John Horton Conway and promoted by George W. Hart, is used to describe polyhedra based on a seed polyhedron modified by various prefix operations. Conway and Hart extended the idea of using operators, like truncation as defined by Kepler, to build related polyhedra of the same symmetry. For example, tC represents a truncated cube, and taC, parsed as t(aC), is (topologically) a truncated cuboctahedron. The simplest operator dual swaps vertex and face elements; e.
Square tiling
In geometry, the square tiling, square tessellation or square grid is a regular tiling of the Euclidean plane. It has Schläfli symbol of {4,4}, meaning it has 4 squares around every vertex. Conway called it a quadrille. The internal angle of the square is 90 degrees so four squares at a point make a full 360 degrees. It is one of three regular tilings of the plane. The other two are the triangular tiling and the hexagonal tiling. There are 9 distinct uniform colorings of a square tiling.
Uniform coloring
In geometry, a uniform coloring is a property of a uniform figure (uniform tiling or uniform polyhedron) that is colored to be vertex-transitive. Different symmetries can be expressed on the same geometric figure with the faces following different uniform color patterns. A uniform coloring can be specified by listing the different colors with indices around a vertex figure. In addition, an n-uniform coloring is a property of a uniform figure which has n types vertex figure, that are collectively vertex transitive.
Uniform tiling
In geometry, a uniform tiling is a tessellation of the plane by regular polygon faces with the restriction of being vertex-transitive. Uniform tilings can exist in both the Euclidean plane and hyperbolic plane. Uniform tilings are related to the finite uniform polyhedra which can be considered uniform tilings of the sphere. Most uniform tilings can be made from a Wythoff construction starting with a symmetry group and a singular generator point inside of the fundamental domain.
Isogonal figure
In geometry, a polytope (e.g. a polygon or polyhedron) or a tiling is isogonal or vertex-transitive if all its vertices are equivalent under the symmetries of the figure. This implies that each vertex is surrounded by the same kinds of face in the same or reverse order, and with the same angles between corresponding faces. Technically, one says that for any two vertices there exists a symmetry of the polytope mapping the first isometrically onto the second.
Vertex figure
In geometry, a vertex figure, broadly speaking, is the figure exposed when a corner of a polyhedron or polytope is sliced off. Take some corner or vertex of a polyhedron. Mark a point somewhere along each connected edge. Draw lines across the connected faces, joining adjacent points around the face. When done, these lines form a complete circuit, i.e. a polygon, around the vertex. This polygon is the vertex figure. More precise formal definitions can vary quite widely, according to circumstance.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.