Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

n-flake

From Wikipedia, the free encyclopedia

Ann-flake,polyflake, orSierpinskin-gon,[1]: 1  is afractal constructed starting from ann-gon. Thisn-gon is replaced by a flake of smallern-gons, such that the scaled polygons are placed at thevertices, and sometimes in the center. This process is repeated recursively to result in the fractal. Typically, there is also the restriction that then-gons must touch yet not overlap.

In two dimensions

[edit]

The most common variety ofn-flake is two-dimensional (in terms of itstopological dimension) and is formed of polygons. The four most common special cases are formed with triangles, squares, pentagons, and hexagons, but it can be extended to any polygon.[1]: 2  Its boundary is thevon Koch curve of varying types – depending on then-gon – and infinitely many Koch curves are contained within. The fractals occupy zero area yet have an infinite perimeter.

The formula of thescale factorr for anyn-flake is:[2]

r=12(1+k=1n/4cos2πkn){\displaystyle r={\frac {1}{2\left(1+\displaystyle \sum _{k=1}^{\lfloor n/4\rfloor }{\cos {\frac {2\pi k}{n}}}\right)}}}

where cosine is evaluated in radians andn is the number of sides of then-gon. TheHausdorff dimension of an-flake islogmlogr{\displaystyle \textstyle {\frac {\log m}{\log r}}}, wherem is the number of polygons in each individual flake andr is the scale factor.

Sierpinski triangle

[edit]

TheSierpinski triangle is ann-flake formed by successive flakes of three triangles. Each flake is formed by placing triangles scaled by 1/2 in each corner of the triangle they replace. ItsHausdorff dimension is equal tolog(3)log(2){\displaystyle \textstyle {\frac {\log(3)}{\log(2)}}} ≈ 1.585. Thelog(3)log(2){\displaystyle \textstyle {\frac {\log(3)}{\log(2)}}} is obtained because each iteration has 3 triangles that are scaled by 1/2.

  • The sixth iteration of the Sierpinski triangle.
    The sixth iteration of the Sierpinski triangle.
  • The Sierpinski triangle created by the chaos game.
    The Sierpinski triangle created by thechaos game.

Vicsek fractal

[edit]
See also:Cantor dust,Sierpinski carpet, andSierpinski curve
The fifth iteration of the Vicsek fractal

If a sierpinski 4-gon were constructed from the given definition, the scale factor would be 1/2 and the fractal would simply be a square. A more interesting alternative, theVicsek fractal, rarely called a quadraflake, is formed by successive flakes of five squares scaled by 1/3. Each flake is formed either by placing a scaled square in each corner and one in the center or one on each side of the square and one in the center. Its Hausdorff dimension is equal tolog(5)log(3){\displaystyle \textstyle {\frac {\log(5)}{\log(3)}}} ≈ 1.4650. Thelog(5)log(3){\displaystyle \textstyle {\frac {\log(5)}{\log(3)}}} is obtained because each iteration has 5 squares that are scaled by 1/3. The boundary of the Vicsek Fractal is aType 1 quadratic Koch curve.

Pentaflake

[edit]
Zooming into the boundary of a variation of the pentaflake

A pentaflake, or sierpinski pentagon, is formed by successive flakes of six regular pentagons.[3]Each flake is formed by placing a pentagon in each corner and one in the center. Its Hausdorff dimension is equal tolog(6)log(1+φ){\displaystyle \textstyle {\frac {\log(6)}{\log(1+\varphi )}}} ≈ 1.8617, whereφ=1+52{\displaystyle \textstyle {\varphi ={\frac {1+{\sqrt {5}}}{2}}}} (golden ratio). Thelog(6)log(1+φ){\displaystyle \textstyle {\frac {\log(6)}{\log(1+\varphi )}}} is obtained because each iteration has 6 pentagons that are scaled by11+φ{\displaystyle \textstyle {\frac {1}{1+\varphi }}}. The boundary of a pentaflake is the Koch curve of 72 degrees.

There is also a variation of the pentaflake that has no central pentagon. Its Hausdorff dimension equalslog(5)log(1+φ){\displaystyle \textstyle {\frac {\log(5)}{\log(1+\varphi )}}} ≈ 1.6723. This variation still contains infinitely many Koch curves, but they are somewhat more visible.

  • 3rd iteration, with center pentagons
    3rd iteration, with center pentagons
  • 4th iteration, with center pentagons
    4th iteration, with center pentagons
  • 5th iteration, with center pentagons
    5th iteration, with center pentagons
  • 2nd iteration, without center pentagons
    2nd iteration, without center pentagons
  • 3rd iteration, without center pentagons
    3rd iteration, without center pentagons
  • 4th iteration, without center pentagons
    4th iteration, without center pentagons
  • 5th iteration, without center pentagons
    5th iteration, without center pentagons

Concentric patterns of pentaflake boundary shaped tiles can cover the plane, with the central point being covered by a third shape formed of segments of 72-degree Koch curve, also with 5-fold rotational and reflective symmetry.

  • Pentaflake tiling. Center point not covered.
    Pentaflake tiling. Center point not covered.
  • Pentaflake tiling. Center point covered.
    Pentaflake tiling. Center point covered.

Hexaflake

[edit]

Ahexaflake, is formed by successive flakes of seven regular hexagons.[4] Each flake is formed by placing a scaled hexagon in each corner and one in the center. Each iteration has 7 hexagons that are scaled by 1/3. Therefore the hexaflake has 7n−1 hexagons in itsnth iteration, and its Hausdorff dimension is equal tolog(7)log(3){\displaystyle \textstyle {\frac {\log(7)}{\log(3)}}} ≈ 1.7712. The boundary of a hexaflake is the standard Koch curve of 60 degrees and infinitely manyKoch snowflakes are contained within. Also, the projection of thecantor cube onto the planeorthogonal to its main diagonal is a hexaflake.The hexaflake has been applied in the design ofantennas[4] andoptical fibers.[5]

Like the pentaflake, there is also a variation of the hexaflake, called the Sierpinski hexagon, that has no central hexagon.[6] Its Hausdorff dimension equalslog(6)log(3){\displaystyle \textstyle {\frac {\log(6)}{\log(3)}}} ≈ 1.6309. This variation still contains infinitely many Koch curves of 60 degrees.

  • Hexaflake
    Hexaflake
  • The first six iterations of the hexaflake.
    The first six iterations of the hexaflake.
  • Fourth iteration of the Sierpinski hexagon.
    Fourth iteration of the Sierpinski hexagon.
  • Orthogonal projection of a cantor cube showing a hexaflake.
    Orthogonal projection of a cantor cube showing a hexaflake.

Polyflake

[edit]
n-flakes (without central polygons) from sides 3 to 10 and orders 0 to 4[7] (click or tap to enlarge).
n-flakes (with central polygons) from sides 3 to 10 and orders 0 to 4[7] (click or tap to enlarge).

n-flakes of higher polygons also exist, though they are less common and usually do not have a central polygon. [If a central polygon is generated, the scale factor differs for odd and evenn{\displaystyle n}:R=12r{\displaystyle R=1-2r} for evenn{\displaystyle n} andR=1rcos(π/n)r{\displaystyle \textstyle {R={\frac {1-r}{cos(\pi /n)}}-r}} for oddn{\displaystyle n}.] Some examples are shown below; the 7-flake through 12-flake. While it may not be obvious, these higher polyflakes still contain infinitely many Koch curves, but the angle of the Koch curves decreases asn increases. Their Hausdorff dimensions are slightly more difficult to calculate than lowern-flakes because their scale factor is less obvious. However, the Hausdorff dimension is always less than two but no less than one. An interestingn-flake is the ∞-flake, because as the value ofn increases, ann-flake's Hausdorff dimension approaches 1,[1]: 7 

  • The first four iterations of the heptaflake or 7-flake.
    The first four iterations of the heptaflake or 7-flake.
  • The first four iterations of the octoflake or 8-flake.
    The first four iterations of the octoflake or 8-flake.
  • The first four iterations of the enneaflake or 9-flake.
    The first four iterations of the enneaflake or 9-flake.
  • The first four iterations of the decaflake or 10-flake.
    The first four iterations of the decaflake or 10-flake.
  • The first four iterations of the hendecaflake or 11-flake.
    The first four iterations of the hendecaflake or 11-flake.
  • The first four iterations of the dodecaflake or 12-flake.
    The first four iterations of the dodecaflake or 12-flake.

In three dimensions

[edit]

n-flakes can generalized to higher dimensions, in particular to atopological dimension of three.[8] Instead of polygons, regularpolyhedra are iteratively replaced. However, while there are an infinite number of regular polygons, there are only five regular, convex polyhedra. Because of this, three-dimensional n-flakes are also calledplatonic solid fractals.[9] In three dimensions, the fractals' volume is zero.

Sierpinski tetrahedron

[edit]

ASierpinski tetrahedron is formed by successive flakes of four regular tetrahedrons. Each flake is formed by placing atetrahedron scaled by 1/2 in each corner. Its Hausdorff dimension is equal tolog(4)log(2){\displaystyle \textstyle {\frac {\log(4)}{\log(2)}}}, which is exactly equal to 2. On every face there is a Sierpinski triangle and infinitely many are contained within.

  • The third iteration of the Sierpinski tetrahedron.
    The third iteration of the Sierpinski tetrahedron.

Hexahedron flake

[edit]

A hexahedron, or cube, flake defined in the same way as the Sierpinski tetrahedron is simply a cube[10] and is not interesting as a fractal. However, there are two pleasing alternatives. One is theMenger Sponge, where every cube is replaced by a three dimensional ring of cubes. Its Hausdorff dimension islog(20)log(3){\displaystyle \textstyle {\frac {\log(20)}{\log(3)}}} ≈ 2.7268.

Another hexahedron flake can be produced in a manner similar to theVicsek fractal extended to three dimensions. Every cube is divided into 27 smaller cubes and the center cross is retained, which is the opposite of theMenger sponge where the cross is removed. However, it is not the Menger Sponge complement. Its Hausdorff dimension islog(7)log(3){\displaystyle \textstyle {\frac {\log(7)}{\log(3)}}} ≈ 1.7712, because a cross of 7 cubes, each scaled by 1/3, replaces each cube.

Octahedron flake

[edit]

An octahedron flake, or sierpinski octahedron, is formed by successive flakes of six regular octahedra. Each flake is formed by placing anoctahedron scaled by 1/2 in each corner. Its Hausdorff dimension is equal tolog(6)log(2){\displaystyle \textstyle {\frac {\log(6)}{\log(2)}}} ≈ 2.5849. On every face there is a Sierpinski triangle and infinitely many are contained within.

  • The third iteration of the octahedron flake.
    The third iteration of the octahedron flake.

Dodecahedron flake

[edit]

A dodecahedron flake, or sierpinski dodecahedron, is formed by successive flakes of twenty regular dodecahedra. Each flake is formed by placing adodecahedron scaled by12+φ{\displaystyle \textstyle {\frac {1}{2+\varphi }}} in each corner. Its Hausdorff dimension is equal tolog(20)log(2+φ){\displaystyle \textstyle {\frac {\log(20)}{\log(2+\varphi )}}} ≈ 2.3296.

  • The second iteration of the dodecahedron fractal flake.
    The second iteration of the dodecahedron fractal flake.

Icosahedron flake

[edit]

An icosahedron flake, or sierpinski icosahedron, is formed by successive flakes of twelve regular icosahedra. Each flake is formed by placing anicosahedron scaled by11+φ{\displaystyle \textstyle {\frac {1}{1+\varphi }}} in each corner. Its Hausdorff dimension is equal tolog(12)log(1+φ){\displaystyle \textstyle {\frac {\log(12)}{\log(1+\varphi )}}} ≈ 2.5819.

  • The third iteration of the icosahedron fractal flake.
    The third iteration of the icosahedron fractal flake.

See also

[edit]

References

[edit]
  1. ^abcDennis, Kevin; Schlicker, Steven,Sierpinskin-Gons(PDF)
  2. ^Riddle, Larry."Sierpinski n-gons". Retrieved9 May 2011.
  3. ^Weisstein, Eric W."Pentaflake".MathWorld.
  4. ^abChoudhury, S.M.; Matin, M.A. (2012), "Effect of FSS ground plane on second iteration of hexaflake fractal patch antenna",7th International Conference onElectrical Computer Engineering (ICECE 2012), pp. 694–697,doi:10.1109/ICECE.2012.6471645.
  5. ^Lai, Zheng-Xuan (2012),Self-similar optical fibers, Ph.D. thesis, Syracuse University, L. C. Smith College of Electrical Engineering and Computer Science.
  6. ^Devaney, Robert L. (November 2004),"Chaos rules!"(PDF),Math Horizons:11–13.
  7. ^abR.Ugalde, Laurence."n-flakes in the Fōrmulæ programming language".Fōrmulæ. RetrievedJune 1, 2024.
  8. ^Kunnen, Aimee; Schlicker, Steven,Regular Sierpinski Polyhedra(PDF)
  9. ^Paul Bourke (December 2005)."Platonic solid fractals and their complements". Archived fromthe original on 9 December 2014. Retrieved4 December 2014.
  10. ^Kunnen, Aimee; Schlicker, Steven,Regular Sierpinski Polyhedra(PDF), p. 3

External links

[edit]
Characteristics
Iterated function
system
Strange attractor
L-system
Escape-time
fractals
Rendering techniques
Random fractals
People
Other
Retrieved from "https://en.wikipedia.org/w/index.php?title=N-flake&oldid=1278837239"
Categories:

[8]ページ先頭

©2009-2025 Movatter.jp