Ana Sayfa
Matematikçiler
Makaleler
Matematik Seçkileri
Fraktallar
=> Apollonian Gasket
=> Barnsley's Fern
=> Barnsley's Tree
=> Batrachion
=> Blancmange Function
=> Box Fractal
=> Brown Function
=> Cactus Fractal
=> Cantor Dust
=> Cantor Function
=> Cantor Set
=> Cantor Square Fractal
=> Capacity Dimension
=> Carotid-Kundalini Fractal
=> Cesàro Fractal
=> Chaos Game
=> Circles-and-Squares Fractal
=> Coastline Paradox
=> Correlation Exponent
=> Count
=> Cross-Stitch Curve
=> Curlicue Fractal
=> Delannoy Number
=> Dendrite Fractal
=> Devil's Staircase
=> Douady's Rabbit Fractal
=> Dragon Curve
=> Elephant Valley
=> Exterior Snowflake
=> Gosper Island
=> H-Fractal
=> Haferman Carpet
=> Hénon Map
=> Hilbert Curve
=> Householder's Method
=> Ice Fractal
=> Julia Set
=> Koch Antisnowflake
=> Koch Snowflake
=> Lévy Fractal
=> Lévy Tapestry
=> Lindenmayer System
=> Mandelbrot Set
=> Mandelbrot Set Lemniscate
=> Mandelbrot Tree
=> Menger Sponge
=> Minkowski Sausage
=> Mira Fractal
=> Newton's Method
=> Peano Curve
=> Peano-Gosper Curve
=> Pentaflake
=> Plane-Filling Function
=> Pythagoras Tree
=> Randelbrot Set
=> Rep-Tile
=> Reverend Back's Abbey Floor
=> San Marco Fractal
=> Sea Horse Valley
=> Siegel Disk Fractal
=> Sierpiński Arrowhead Curve
=> Sierpiński Carpet
=> Sierpiński Curve
=> Sierpiński Sieve
=> Star Fractal
=> Strange Attractor
=> Tetrix
Paradokslar
Sayılar Teorisi
Ziyaretçi defteri
 

Koch Snowflake

KochSnowflake

A fractal, also known as the Koch island, which was first described by Helge von Koch in 1904. It is built by starting with an equilateral triangle, removing the inner third of each side, building another equilateral triangle at the location where the side was removed, and then repeating the process indefinitely. The Koch snowflake can be simply encoded as a Lindenmayer system with initial string "F--F--F", string rewriting rule "F" -> "F+F--F+F", and angle 60 degrees. The zeroth through third iterations of the construction are shown above. The fractal can also be constructed using a base curve and motif, illustrated below.

KochSnowflakeMotif

Let N_n be the number of sides, L_n be the length of a single side, l_n be the length of the perimeter, and A_n the snowflake's area after the nth iteration. Further, denote the area of the initial n=0 triangle Delta, and the length of an initial n=0 side 1. Then

N_n = 3·4^n
(1)
L_n = (1/3)^n
(2)
l_n = N_nL_n
(3)
= 3(4/3)^n
(4)
A_n = A_(n-1)+1/4N_nL_n^2Delta
(5)
= A_(n-1)+1/3(4/9)^(n-1).
(6)

Solving the recurrence equation with A_0=Delta gives

 A_n={1-3/5[1-(4/9)^n]}Delta,
(7)

so as n->infty,

 A_infty=8/5Delta.
(8)

The capacity dimension is then

d_(cap) = -lim_(n->infty)(lnN_n)/(lnL_n)
(9)
= log_34
(10)
= (2ln2)/(ln3)
(11)
= 1.261859507...
(12)

(Sloane's A100831).

KochSnowflakeTilings

Some beautiful tilings, a few examples of which are illustrated above, can be made with iterations toward Koch snowflakes.

KochSnowflakeTiling

In addition, two sizes of Koch snowflakes in area ratio 1:3 tile the plane, as shown above.

KochFrillFlake3

Another beautiful modification of the Koch snowflake involves inscribing the constituent triangles with filled-in triangles, possibly rotated at some angle. Some sample results are illustrated above for 3 and 4 iterations.


Bugün 34 ziyaretçi (51 klik) kişi burdaydı!
Bu web sitesi ücretsiz olarak Bedava-Sitem.com ile oluşturulmuştur. Siz de kendi web sitenizi kurmak ister misiniz?
Ücretsiz kaydol