You are here

The Trouble with von Koch Curves Built from \(n\)-gons

Tamás Keleti (Eötvös Loránd University) and Elliot Paquette (Univ. of Washington)

Tamás Keleti
Department of Analysis, Eötvös Loránd University

Elliot Paquette
Department of Mathematics, University of Washington

Abstract: The von Koch Curve, by Helge von Koch's own admission, can be quite naturally generalized. One such family of natural generalizations can be built using n-gons. To build these curves, fix some positive scalar c less than one. Draw a line segment with length L. Replace the middle cL portion of the segment with the sides of a regular n-gon whose own sides are length cL. This produces a total of n+1 line segments. Recursively apply this procedure to each line segment, and take the limit to produce the (n,c)-von Koch Curve. For fixed n and c sufficiently large, the curve intersects itself. Likewise, for c sufficiently small, the curve does not. The trouble with the (n,c)-von Koch curve is what happens in between. We show that the set of c for which the curve self-intersects is not necessarily an interval.

American Mathematical Monthly, February 2010 (vol. 117, no. 2, pp. 124-137).

The applet and materials below supplement the article.



The (n,c)-von Koch curve is constructed recursively. On a closed line segment of length L, glue a regular n-gon with side length cL to the middle of the line segment, and delete the interior of the overlapped middle-cL segment. This produces n+1 line segments from 1, and so it may be repeated, always gluing the polygons with a consistent orientation outward. The "edges" field in the applet specifies n; the value of c can be entered directly into the "c" field or changed using the "Increment c" and "Decrement c" buttons below the graph. The applet repeats the procedure for the number of times specified in the "generations" field, provided the length of the line segments added in the next generation is greater than the value in the "detail threshold" field. The limit of this procedure is the (n,c)-von Koch curve, so the applet renders an approximation to this curve, using the specified parameters.

For every n there is a c sufficiently small so that the von Koch curve embeds naturally into the plane. By the same token, there is a c sufficiently large so that the von Koch curve can be assured to intersect itself. To answer more exacting questions about the set of pairs (n,c) for which the (n,c)-von Koch curve self-intersects, a particular wedge of the curve is critical.

This wedge is located between the largest n-gon and the baseline of the curve. By studying this wedge, it becomes apparent that there is a meshing phenomenon that takes place, wherein the curve intersects itself at some c1 but does not at some c2 larger than c1. Enabling "only show wedge" in the applet focuses the graph on this wedge. A table of some parameters that demonstrate this property is given below.

To view these examples, enable "only show wedge" and set "generations" = 10 and "detail threshold" = 0.1.

n c1 c2
14 0.032 0.037
19 0.014670 0.018424
20 0.014571 0.018028
26 0.0074988 0.0090564
27 0.0074905 0.0089699
28 0.0074653 0.0089045
29 0.0074555 0.0088275
30 0.0074584 0.0087413
37 0.0038070 0.0043831
38 0.0037970 0.0043604
39 0.0037992 0.0043343
40 0.0037966 0.0043054
41 0.0038046 0.0042890
42 0.0037935 0.0042692
43 0.0037928 0.0042601


Tamás Keleti (Eötvös Loránd University) and Elliot Paquette (Univ. of Washington), "The Trouble with von Koch Curves Built from \(n\)-gons," Convergence (February 2010), DOI:10.4169/loci003283