 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations .(May 2014) |
In mathematics, the T-square is a two-dimensional fractal. It has a boundary of infinite length bounding a finite area. Its name comes from the drawing instrument known as a T-square. [1]
It can be generated from using this algorithm:
The method of creation is rather similar to the ones used to create a Koch snowflake or a Sierpinski triangle, "both based on recursively drawing equilateral triangles and the Sierpinski carpet." [1]
The T-square fractal has a fractal dimension of ln(4)/ln(2) = 2.[ citation needed ] The black surface extent is almost everywhere in the bigger square, for once a point has been darkened, it remains black for every other iteration; however some points remain white.
The fractal dimension of the boundary equals .
Using mathematical induction one can prove that for each n ≥ 2 the number of new squares that are added at stage n equals .
The T-square fractal can also be generated by an adaptation of the chaos game, in which a point jumps repeatedly half-way towards the randomly chosen vertices of a square. The T-square appears when the jumping point is unable to target the vertex directly opposite the vertex previously chosen. That is, if the current vertex is v[i] and the previous vertex was v[i-1], then v[i] ≠ v[i-1] + vinc, where vinc = 2 and modular arithmetic means that 3 + 2 = 1, 4 + 2 = 2:
![Randomly chosen v[i] [?] v[i-1] + 2 V4 ban1 inc2.gif](http://upload.wikimedia.org/wikipedia/commons/thumb/3/3e/V4_ban1_inc2.gif/200px-V4_ban1_inc2.gif)
If vinc is given different values, allomorphs of the T-square appear that are computationally equivalent to the T-square but very different in appearance:
![Randomly chosen v[i] [?] v[i-1] + 0 V4 ban1.gif](http://upload.wikimedia.org/wikipedia/commons/thumb/a/a5/V4_ban1.gif/200px-V4_ban1.gif) | ![Randomly chosen v[i] [?] v[i-1] + 1 V4 ban1 inc1.gif](http://upload.wikimedia.org/wikipedia/commons/thumb/8/89/V4_ban1_inc1.gif/200px-V4_ban1_inc1.gif) |
The T-square fractal can be derived from the Sierpiński triangle, and vice versa, by adjusting the angle at which sub-elements of the original fractal are added from the center outwards.
 |
In mathematics, Hausdorff dimension is a measure of roughness, or more specifically, fractal dimension, that was introduced in 1918 by mathematician Felix Hausdorff. For instance, the Hausdorff dimension of a single point is zero, of a line segment is 1, of a square is 2, and of a cube is 3. That is, for sets of points that define a smooth shape or a shape that has a small number of corners—the shapes of traditional geometry and science—the Hausdorff dimension is an integer agreeing with the usual sense of dimension, also known as the topological dimension. However, formulas have also been developed that allow calculation of the dimension of other less simple objects, where, solely on the basis of their properties of scaling and self-similarity, one is led to the conclusion that particular objects—including fractals—have non-integer Hausdorff dimensions. Because of the significant technical advances made by Abram Samoilovitch Besicovitch allowing computation of dimensions for highly irregular or "rough" sets, this dimension is also commonly referred to as the Hausdorff–Besicovitch dimension.
In mathematics, a self-similar object is exactly or approximately similar to a part of itself. Many objects in the real world, such as coastlines, are statistically self-similar: parts of them show the same statistical properties at many scales. Self-similarity is a typical property of fractals. Scale invariance is an exact form of self-similarity where at any magnification there is a smaller piece of the object that is similar to the whole. For instance, a side of the Koch snowflake is both symmetrical and scale-invariant; it can be continually magnified 3x without changing shape. The non-trivial similarity evident in fractals is distinguished by their fine structure, or detail on arbitrarily small scales. As a counterexample, whereas any portion of a straight line may resemble the whole, further detail is not revealed.
The Sierpiński carpet is a plane fractal first described by Wacław Sierpiński in 1916. The carpet is a generalization of the Cantor set to two dimensions; another such generalization is the Cantor dust.
The Sierpiński triangle, also called the Sierpiński gasket or Sierpiński sieve, is a fractal with the overall shape of an equilateral triangle, subdivided recursively into smaller equilateral triangles. Originally constructed as a curve, this is one of the basic examples of self-similar sets—that is, it is a mathematically generated pattern that is reproducible at any magnification or reduction. It is named after the Polish mathematician Wacław Sierpiński, but appeared as a decorative pattern many centuries before the work of Sierpiński.
The Koch snowflake is a fractal curve and one of the earliest fractals to have been described. It is based on the Koch curve, which appeared in a 1904 paper titled "On a Continuous Curve Without Tangents, Constructible from Elementary Geometry" by the Swedish mathematician Helge von Koch.
In mathematics, the Menger sponge is a fractal curve. It is a three-dimensional generalization of the one-dimensional Cantor set and two-dimensional Sierpinski carpet. It was first described by Karl Menger in 1926, in his studies of the concept of topological dimension.
In mathematics, a fractal dimension is a term invoked in the science of geometry to provide a rational statistical index of complexity detail in a pattern. A fractal pattern changes with the scale at which it is measured. It is also a measure of the space-filling capacity of a pattern, and it tells how a fractal scales differently, in a fractal (non-integer) dimension.
In mathematics, iterated function systems (IFSs) are a method of constructing fractals; the resulting fractals are often self-similar. IFS fractals are more related to set theory than fractal geometry. They were introduced in 1981.
Sierpiński curves are a recursively defined sequence of continuous closed plane fractal curves discovered by Wacław Sierpiński, which in the limit completely fill the unit square: thus their limit curve, also called the Sierpiński curve, is an example of a space-filling curve.
In mathematics, the term chaos game originally referred to a method of creating a fractal, using a polygon and an initial point selected at random inside it. The fractal is created by iteratively creating a sequence of points, starting with the initial random point, in which each point in the sequence is a given fraction of the distance between the previous point and one of the vertices of the polygon; the vertex is chosen at random in each iteration. Repeating this iterative process a large number of times, selecting the vertex at random on each iteration, and throwing out the first few points in the sequence, will often produce a fractal shape. Using a regular triangle and the factor 1/2 will result in the Sierpinski triangle, while creating the proper arrangement with four points and a factor 1/2 will create a display of a "Sierpinski Tetrahedron", the three-dimensional analogue of the Sierpinski triangle. As the number of points is increased to a number N, the arrangement forms a corresponding (N-1)-dimensional Sierpinski Simplex.
The Hilbert curve is a continuous fractal space-filling curve first described by the German mathematician David Hilbert in 1891, as a variant of the space-filling Peano curves discovered by Giuseppe Peano in 1890.
In statistical mechanics, the two-dimensional square lattice Ising model is a simple lattice model of interacting magnetic spins. The model is notable for having nontrivial interactions, yet having an analytical solution. The model was solved by Lars Onsager for the special case that the external magnetic field H = 0. An analytical solution for the general case for has yet to be found.
In geometry, pinwheel tilings are non-periodic tilings defined by Charles Radin and based on a construction due to John Conway. They are the first known non-periodic tilings to each have the property that their tiles appear in infinitely many orientations.
In graph theory, a random geometric graph (RGG) is the mathematically simplest spatial network, namely an undirected graph constructed by randomly placing N nodes in some metric space and connecting two nodes by a link if and only if their distance is in a given range, e.g. smaller than a certain neighborhood radius, r.
In mathematics the Vicsek fractal, also known as Vicsek snowflake or box fractal, is a fractal arising from a construction similar to that of the Sierpiński carpet, proposed by Tamás Vicsek. It has applications including as compact antennas, particularly in cellular phones.
An n-flake, polyflake, or Sierpinski n-gon, is a fractal constructed starting from an n-gon. This n-gon is replaced by a flake of smaller n-gons, such that the scaled polygons are placed at the vertices, and sometimes in the center. This process is repeated recursively to result in the fractal. Typically, there is also the restriction that the n-gons must touch yet not overlap.
The Mosely snowflake is a Sierpiński–Menger type of fractal obtained in two variants either by the operation opposite to creating the Sierpiński-Menger snowflake or Cantor dust i.e. not by leaving but by removing eight of the smaller 1/3-scaled corner cubes and the central one from each cube left from the previous recursion (lighter) or by removing only corner cubes (heavier).
The Fibonacci word fractal is a fractal curve defined on the plane from the Fibonacci word.
The Ulam–Warburton cellular automaton (UWCA) is a 2-dimensional fractal pattern that grows on a regular grid of cells consisting of squares. Starting with one square initially ON and all others OFF, successive iterations are generated by turning ON all squares that share precisely one edge with an ON square. This is the von Neumann neighborhood. The automaton is named after the Polish-American mathematician and scientist Stanislaw Ulam and the Scottish engineer, inventor and amateur mathematician Mike Warburton.
In fractal geometry, the open set condition (OSC) is a commonly imposed condition on self-similar fractals. In some sense, the condition imposes restrictions on the overlap in a fractal construction. Specifically, given an iterated function system of contractive mappings , the open set condition requires that there exists a nonempty, open set V satisfying two conditions:
