There is no doubt that the snowflake curve is based on the von Koch curve and its iterative construction. However, the picture of the snowflake does not appear in either the original article published in 1904^[3] nor in the extended 1906 memoir.^[4] So one can ask who is the man who constructed the snowflake figure first. An investigation of this question suggests that the snowflake curve is due to the American mathematician Edward Kasner.^[5][6]

The Koch snowflake can be constructed by starting with an equilateral triangle, then recursively altering each line segment as follows:

1. divide the line segment into three segments of equal length.
2. draw an equilateral triangle that has the middle segment from step 1 as its base and points outward.
3. remove the line segment that is the base of the triangle from step 2.

The first iteration of this process produces the outline of a hexagram.

The Koch snowflake is the limit approached as the above steps are followed indefinitely. The Koch curve originally described by Helge von Koch is constructed using only one of the three sides of the original triangle. In other words, three Koch curves make a Koch snowflake.

A Koch curve–based representation of a nominally flat surface can similarly be created by repeatedly segmenting each line in a sawtooth pattern of segments with a given angle.^[7]

Each iteration multiplies the number of sides in the Koch snowflake by four, so the number of sides after ${\displaystyle n}$  iterations is given by:

$${\displaystyle N_{n}=3\cdot 4^{n}\,.}$$ 

If the original equilateral triangle has sides of length ${\displaystyle s}$ , the length of each side of the snowflake after ${\displaystyle n}$  iterations is:

$${\displaystyle S_{n}={\frac {S_{n-1}}{3}}={\frac {s}{3^{n}}}\,,}$$ 

an inverse power of three multiple of the original length. The perimeter of the snowflake after ${\displaystyle n}$  iterations is:

$${\displaystyle P_{n}=N_{n}\cdot S_{n}=3\cdot s\cdot {\left({\frac {4}{3}}\right)}^{n}\,.}$$ 

The Koch curve has an infinite length, because the total length of the curve increases by a factor of ${\displaystyle {\tfrac {4}{3}}}$  with each iteration. Each iteration creates four times as many line segments as in the previous iteration, with the length of each one being ${\displaystyle {\tfrac {1}{3}}}$  the length of the segments in the previous stage. Hence, the length of the curve after ${\displaystyle n}$  iterations will be ${\displaystyle ({\tfrac {4}{3}})^{n}}$  times the original triangle perimeter and is unbounded, as ${\displaystyle n}$  tends to infinity.

As the number of iterations tends to infinity, the limit of the perimeter is:

$${\displaystyle \lim _{n\rightarrow \infty }P_{n}=\lim _{n\rightarrow \infty }3\cdot s\cdot \left({\frac {4}{3}}\right)^{n}=\infty \,,}$$ 

since ${\displaystyle {\tfrac {4}{3}}>1}$ .

An ${\displaystyle {\tfrac {\ln 4}{\ln 3}}}$ -dimensional measure exists, but has not been calculated so far. Only upper and lower bounds have been invented.^{[clarification needed] [8]}

In each iteration a new triangle is added on each side of the previous iteration, so the number of new triangles added in iteration ${\displaystyle n}$  is:

$${\displaystyle T_{n}=N_{n-1}=3\cdot 4^{n-1}={\frac {3}{4}}\cdot 4^{n}\,}$$ 

The area of each new triangle added in an iteration is ${\displaystyle {\tfrac {1}{9}}}$  of the area of each triangle added in the previous iteration, so the area of each triangle added in iteration ${\displaystyle n}$  is:

$${\displaystyle a_{n}={\frac {a_{n-1}}{9}}={\frac {a_{0}}{9^{n}}}\,.}$$ 

where ${\displaystyle a_{0}}$  is the area of the original triangle. The total new area added in iteration ${\displaystyle n}$  is therefore:

$${\displaystyle b_{n}=T_{n}\cdot a_{n}={\frac {3}{4}}\cdot {\left({\frac {4}{9}}\right)}^{n}\cdot a_{0}}$$ 

The total area of the snowflake after ${\displaystyle n}$  iterations is:

$${\displaystyle A_{n}=a_{0}+\sum _{k=1}^{n}b_{k}=a_{0}\left(1+{\frac {3}{4}}\sum _{k=1}^{n}\left({\frac {4}{9}}\right)^{k}\right)=a_{0}\left(1+{\frac {1}{3}}\sum _{k=0}^{n-1}\left({\frac {4}{9}}\right)^{k}\right)\,.}$$ 

Collapsing the geometric sum gives:

$${\displaystyle A_{n}=a_{0}\left(1+{\frac {3}{5}}\left(1-\left({\frac {4}{9}}\right)^{n}\right)\right)={\frac {a_{0}}{5}}\left(8-3\left({\frac {4}{9}}\right)^{n}\right)\,.}$$ 

The limit of the area is:

$${\displaystyle \lim _{n\rightarrow \infty }A_{n}=\lim _{n\rightarrow \infty }{\frac {a_{0}}{5}}\cdot \left(8-3\left({\frac {4}{9}}\right)^{n}\right)={\frac {8}{5}}\cdot a_{0}\,,}$$ 

since ${\displaystyle {\tfrac {4}{9}}<1}$ .

Thus, the area of the Koch snowflake is ${\displaystyle {\tfrac {8}{5}}}$  of the area of the original triangle. Expressed in terms of the side length ${\displaystyle s}$  of the original triangle, this is:^[9] $${\displaystyle {\frac {2s^{2}{\sqrt {3}}}{5}}.}$$ 

The volume of the solid of revolution of the Koch snowflake about an axis of symmetry of the initiating equilateral triangle of unit side is ${\displaystyle {\frac {11{\sqrt {3}}}{135}}\pi .}$ ^[10]

The Koch snowflake is self-replicating with six smaller copies surrounding one larger copy at the center. Hence, it is an irrep-7 irrep-tile (see Rep-tile for discussion).

The fractal dimension of the Koch curve is ${\displaystyle {\tfrac {\ln 4}{\ln 3}}\approx 1.26186}$ . This is greater than that of a line (${\displaystyle =1}$ ) but less than that of Peano's space-filling curve (${\displaystyle =2}$ ).

It is impossible to draw a tangent line to any point of the curve.

The Koch curve arises as a special case of a de Rham curve. The de Rham curves are mappings of Cantor space into the plane, usually arranged so as to form a continuous curve. Every point on a continuous de Rham curve corresponds to a real number in the unit interval. For the Koch curve, the tips of the snowflake correspond to the dyadic rationals: each tip can be uniquely labeled with a distinct dyadic rational.

It is possible to tessellate the plane by copies of Koch snowflakes in two different sizes. However, such a tessellation is not possible using only snowflakes of one size. Since each Koch snowflake in the tessellation can be subdivided into seven smaller snowflakes of two different sizes, it is also possible to find tessellations that use more than two sizes at once.^[11] Koch snowflakes and Koch antisnowflakes of the same size may be used to tile the plane.

A turtle graphic is the curve that is generated if an automaton is programmed with a sequence. If the Thue–Morse sequence members are used in order to select program states:

• If ${\displaystyle t(n)=0}$ , move ahead by one unit,
• If ${\displaystyle t(n)=1}$ , rotate counterclockwise by an angle of ${\displaystyle {\tfrac {\pi }{3}}}$ ,

the resulting curve converges to the Koch snowflake.

The Koch curve can be expressed by the following rewrite system (Lindenmayer system):

Alphabet : F

Constants : +, −

Axiom : F

Production rules : F → F+F--F+F

Here, F means "draw forward", - means "turn right 60°", and + means "turn left 60°".

To create the Koch snowflake, one would use F--F--F (an equilateral triangle) as the axiom.

Following von Koch's concept, several variants of the Koch curve were designed, considering right angles (quadratic), other angles (Cesàro), circles and polyhedra and their extensions to higher dimensions (Sphereflake and Kochcube, respectively)

Squares can be used to generate similar fractal curves. Starting with a unit square and adding to each side at each iteration a square with dimension one third of the squares in the previous iteration, it can be shown that both the length of the perimeter and the total area are determined by geometric progressions. The progression for the area converges to ${\displaystyle 2}$  while the progression for the perimeter diverges to infinity, so as in the case of the Koch snowflake, we have a finite area bounded by an infinite fractal curve.^[18] The resulting area fills a square with the same center as the original, but twice the area, and rotated by ${\displaystyle {\tfrac {\pi }{4}}}$  radians, the perimeter touching but never overlapping itself.

The total area covered at the ${\displaystyle n}$ th iteration is: $${\displaystyle A_{n}={\frac {1}{5}}+{\frac {4}{5}}\sum _{k=0}^{n}\left({\frac {5}{9}}\right)^{k}\quad {\mbox{giving}}\quad \lim _{n\rightarrow \infty }A_{n}=2\,,}$$ 

while the total length of the perimeter is: $${\displaystyle P_{n}=4\left({\frac {5}{3}}\right)^{n}a\,,}$$  which approaches infinity as ${\displaystyle n}$  increases.

In addition to the curve, the paper by Helge von Koch that has established the Koch curve shows a variation of the curve as an example of a continuous everywhere yet nowhere differentiable function that was possible to represent geometrically at the time. From the base straight line, represented as AB, the graph can be drawn by recursively applying the following on each line segment:

• Divide the line segment (XY) into three parts of equal length, divided by dots C and E.
• Draw a line DM, where M is the middle point of CE, and DM is perpendicular to the initial base of AB, having the length of ${\displaystyle {\frac {CE{\sqrt {3}}}{2}}}$ .
• Draw the lines CD and DE and erase the lines CE and DM.

Each point of AB can be shown to converge to a single height. If ${\displaystyle y=\phi (x)}$  is defined as the distance of that point to the initial base, then ${\displaystyle \phi (x)}$  as a function is continuous everywhere and differentiable nowhere.^[3]

• List of fractals by Hausdorff dimension
• Gabriel's Horn (infinite surface area but encloses a finite volume)
• Gosper curve (also known as the Peano–Gosper curve or flowsnake)
• Osgood curve
• Self-similarity
• Teragon
• Weierstrass function
• Coastline paradox

• (2000) "von Koch Curve", efg's Computer Lab at the Wayback Machine (archived 20 July 2017)
• The Koch Curve poem by Bernt Wahl, Wahl.org. Retrieved 23 September 2019.
• Weisstein, Eric W. "Koch Snowflake". MathWorld. Retrieved 23 September 2019.
  • "7 iterations of the Koch curve". Wolfram Alpha Site. Retrieved 23 September 2019.
  • "Square Koch Fractal Curves". Wolfram Demonstrations Project. Retrieved 23 September 2019.
  • "Square Koch Fractal Surface". Wolfram Demonstrations Project. Retrieved 23 September 2019.
• Application of the Koch curve to an antenna
• A WebGL animation showing the construction of the Koch surface, tchaumeny.github.io. Retrieved 23 September 2019.
• "A mathematical analysis of the Koch curve and quadratic Koch curve" (PDF). Archived from the original (pdf) on 26 April 2012. Retrieved 22 November 2011.