Levy C Curve Generator - Classic Levy Fractal Visualizer

What is the Lévy C Curve Fractal?

The Lévy C Curve (sometimes referred to simply as the Lévy Curve) is a beautiful self-similar fractal curve first studied by the French mathematician Paul Lévy in 1938, though its geometric construction was first noted by Ernesto Cesàro in 1906. It is constructed starting from a single straight line segment, recursively replacing it with two perpendicular segments that form a right-isosceles triangle.

As the recursion depth increases, the curve folds back on itself in dense, nested, and self-similar spiraling loops, eventually forming an exceptionally complex shape resembling the letter "C" with highly intricate ornamental borders.

Mathematical Formulation

The construction of the Lévy C Curve can be modeled using an L-System or direct coordinate transformations. At each step $n$:

Each line segment of length $L$ is replaced by $N = 2$ segments.
The length of each new segment is scaled down by a factor of $S = \frac{1}{\sqrt{2}} \approx 0.7071$.
The segments are joined at a $90^\circ$ angle, turning left and right by $45^\circ$ relative to the original segment vector.

To compute the Hausdorff fractal dimension $D$ of the Lévy C Curve boundary: $$D = \frac{\ln(N)}{\ln(1/S)} = \frac{\ln(2)}{\ln(\sqrt{2})} = 2.0$$

Although the curve has a fractal dimension of $2$ (implying that it completely fills a two-dimensional area in the limit), the actual boundary is highly complex, resembling a dense set of overlapping loops that never intersect in a self-overlapping manner, resulting in a shape with a finite area but an infinite perimeter.

Interactive Controls

Our tool offers an interactive platform to visualize and customize the Lévy C Curve with various premium features:

Recursion Depth: Adjust the recursion order from $0$ up to $12$ to see the transition from a simple segment to a dense, ornate spiral.
Neon glow: Toggle the neon glow effect to make the curve shine brightly over dark Slate viewports.
Drawing Animations: Visualize the turtle-graphics path dynamically with adjustable drawing speeds from Slow to Very Fast.
Multiple Exports: Download the final fractal as a high-resolution PNG, a scale-free vector SVG, or download the calculated raw vertices as JSON data.

Frequently Asked Questions

What happens to the Lévy C Curve at high iterations?

As the iterations grow, the curve becomes extremely dense and detailed. Because each segment is split into 2, the total number of segments grows exponentially as $2^n$. At Order 12, the curve contains $2^{12} = 4,096$ distinct segments, creating a highly decorative structure that fills the C-shape boundary.

Is the Lévy C Curve related to the Dragon Curve?

Yes, they are closely related! Both are generated by replacing segments with two perpendicular lines scaled by $\frac{1}{\sqrt{2}}$. However, the Dragon Curve rotates the segments in alternating directions (folding left and right based on paperfolding sequences), whereas the Lévy C Curve always rotates them outward, causing the curve to fold symmetrically into a C-shape.

What is the total length of the Lévy C Curve?

If the starting segment has a length of $1$, each recursion increases the total length of the path by a factor of $\sqrt{2}$. Therefore, the total length at iteration $n$ is $(\sqrt{2})^n$. As $n$ approaches infinity, the length of the curve becomes infinite, despite being contained within a finite boundary box.