Generate Lévy C-Curve

The Lévy C-curve generator renders one of the most elegant self-similar fractals in mathematics — a curve built entirely through repeated right-angle segment folding. Named after French mathematician Paul Lévy, who described it in 1938, the curve begins as a single straight line segment. At each iteration, every segment is replaced by two segments of equal length meeting at a 90-degree angle, effectively folding outward from the midpoint. After enough iterations, the result is a intricate, space-filling curve with a distinctive angular, zigzag aesthetic that bears an unmistakable resemblance to a stretched letter C — hence the name. This tool lets you visualize the Lévy C-curve interactively, giving you full control over iteration depth, canvas dimensions, line color, background color, and stroke thickness. Whether you're a student exploring fractal geometry, a teacher building visual aids for a mathematics class, a developer studying recursive algorithms, or a digital artist hunting for geometric inspiration, this generator makes it easy to explore the curve's growth across iterations without writing a single line of code. Increase the depth and watch the curve evolve from a simple bent line into a densely packed fractal pattern. Adjust colors and thickness to produce publication-ready visuals or striking generative art. The tool runs entirely in your browser for instant, lag-free rendering.

Options
Levy Fractal Options
Levy Fractal's Colors
Line Width and Padding
Output (Levy C-Curve)

What It Does

The Lévy C-curve generator renders one of the most elegant self-similar fractals in mathematics — a curve built entirely through repeated right-angle segment folding. Named after French mathematician Paul Lévy, who described it in 1938, the curve begins as a single straight line segment. At each iteration, every segment is replaced by two segments of equal length meeting at a 90-degree angle, effectively folding outward from the midpoint. After enough iterations, the result is a intricate, space-filling curve with a distinctive angular, zigzag aesthetic that bears an unmistakable resemblance to a stretched letter C — hence the name. This tool lets you visualize the Lévy C-curve interactively, giving you full control over iteration depth, canvas dimensions, line color, background color, and stroke thickness. Whether you're a student exploring fractal geometry, a teacher building visual aids for a mathematics class, a developer studying recursive algorithms, or a digital artist hunting for geometric inspiration, this generator makes it easy to explore the curve's growth across iterations without writing a single line of code. Increase the depth and watch the curve evolve from a simple bent line into a densely packed fractal pattern. Adjust colors and thickness to produce publication-ready visuals or striking generative art. The tool runs entirely in your browser for instant, lag-free rendering.

How It Works

Generate Lévy C-Curve produces new output from rules, parameters, or patterns instead of editing an existing document. That makes input settings more important than input text, because the settings are what define the shape of the result.

Generators are only as useful as the settings behind them. When the output seems off, check the count, range, delimiter, seed values, or pattern options before judging the result itself.

All processing happens in your browser, so your input stays on your device during the transformation.

Common Use Cases

  • Study how fractal complexity grows with each iteration by stepping through iteration depths and observing the curve's structural evolution.
  • Generate high-contrast Lévy C-curve visuals for use in mathematics textbooks, lecture slides, or academic papers on fractal geometry.
  • Use the curve as a generative art element — experiment with color palettes and stroke weights to produce original geometric artwork.
  • Compare the Lévy C-curve's space-filling behavior to other iterated function system (IFS) fractals like the Heighway dragon or Koch snowflake.
  • Visualize recursive algorithms for computer science students, using the curve as a concrete, visual example of depth-first recursion.
  • Produce animated or static fractal backgrounds for websites, presentations, or design mockups using the exported canvas output.
  • Explore the mathematical concept of self-similarity by zooming in mentally at each iteration level and observing the repeating structure.

How to Use

  1. Set your canvas size by entering the desired width and height in pixels — larger canvases give more room for detail at higher iteration depths.
  2. Choose an iteration depth between 1 and around 16; lower values show the early folding stages clearly, while higher values (12+) reveal the dense fractal structure.
  3. Select a line color and background color using the color pickers — high contrast combinations like white-on-black or gold-on-navy produce the most striking visuals.
  4. Adjust the line thickness slider to control stroke weight; thinner strokes work best at high iteration depths where segments become very small.
  5. Click the Generate or Render button to draw the curve on the canvas using your chosen settings.
  6. Once rendered, use your browser's right-click save or the download button (if available) to export the image for use in documents, presentations, or design projects.

Features

  • Iterative right-angle segment folding rendered recursively, faithfully reproducing the mathematical definition of the Lévy C-curve at any depth.
  • Configurable iteration depth from 1 to 16+, letting users observe every stage of the fractal's growth from a simple bent line to a complex space-filling shape.
  • Full color customization for both the curve line and canvas background, enabling high-contrast academic visuals or stylized generative art.
  • Adjustable line thickness control so strokes remain crisp and readable at both low-iteration sketches and high-iteration dense renders.
  • Flexible canvas size options that accommodate everything from small thumbnail previews to large high-resolution exports.
  • Runs entirely client-side in the browser — no server processing, no file uploads, and no installation required for instant fractal rendering.
  • Consistent mathematical accuracy across all iteration levels, ensuring the curve's proportions and angles remain geometrically correct at every depth.

Examples

Below is a representative input and output so you can see the transformation clearly.

Input
Order: 0
Size: 100
Angle: 90
Output
Path:
(0,0)
(100,0)

Edge Cases

  • Very large inputs can still stress the browser, especially when the tool is working across many numbers. Split huge jobs into smaller batches if the page becomes sluggish.
  • Empty or whitespace-only input is technically valid but may produce unchanged output, which can look like a failure at first glance.
  • If the output looks wrong, compare the exact input and option values first, because Generate Lévy C-Curve should be repeatable with the same settings.

Troubleshooting

  • Unexpected output often means the input is being split or interpreted at the wrong unit. For Generate Lévy C-Curve, that unit is usually numbers.
  • If a previous run looked different, check for hidden whitespace, changed separators, or a setting that was toggled accidentally.
  • If nothing changes, confirm that the input actually contains the pattern or structure this tool operates on.
  • If the page feels slow, reduce the input size and test a smaller sample first.

Tips

For the clearest visual results, start at iteration depth 1 and step upward one level at a time — this helps you build intuition for how the folding process works before the curve becomes dense. At depths above 12, reduce line thickness to 0.5px or less to prevent adjacent segments from blending into solid blocks of color. If you're using the output for print or high-resolution display, set your canvas size to at least 1200×1200 pixels before rendering at high iteration depths. Dark backgrounds with bright, saturated line colors tend to make the fractal's self-similar structure far more visible than light-on-white combinations.

The Lévy C-curve sits at a fascinating intersection of geometry, recursion theory, and visual mathematics. It was formally described by Paul Lévy in his 1938 paper on self-similar curves, though its geometric intuition is straightforward enough to explain to a high school student: take a line segment, replace it with two equal segments bent at a 90-degree angle, then repeat that operation on every new segment forever. The resulting limit object is a fractal — a shape that is self-similar at every scale, meaning any small portion of it looks like a scaled-down copy of the whole. What makes the Lévy C-curve particularly interesting is its fractal dimension. Unlike a regular curve, which has a topological dimension of 1, the Lévy C-curve has a Hausdorff dimension of approximately 1.9342 — close to 2, meaning it almost fills a two-dimensional plane as the number of iterations approaches infinity. This near-space-filling property explains the dense, overlapping appearance the curve takes on at higher iteration depths. At around iteration 10 or 11, the curve begins to visually resemble a filled region rather than a line, which is a direct consequence of its high fractal dimension. The construction method belongs to a broader family of techniques called Iterated Function Systems (IFS). An IFS works by defining a small set of geometric transformations — in the Lévy C-curve's case, two similarity transforms — and repeatedly applying them to every existing segment. After enough iterations, the resulting shape converges to what mathematicians call an attractor: a stable geometric object that the process homes in on regardless of the exact starting conditions. The Lévy C-curve's attractor is that iconic angular, C-shaped fractal you see at higher depths. Compared to other famous fractals, the Lévy C-curve occupies an interesting middle ground. The Koch snowflake, for example, uses a 60-degree angle replacement rule and grows outward in a spiky, snowflake-like shape. The Heighway dragon curve uses a similar segment-folding approach to the Lévy curve but alternates the direction of each fold, producing a distinctly different, more compact shape. The Lévy C-curve, by contrast, always folds outward in the same direction, which gives it that distinctive elongated, crescent-like silhouette at low iteration depths before collapsing into density at high depths. From a computer science perspective, the Lévy C-curve is a clean, accessible exercise in recursive algorithm design. The generator function mirrors the mathematical definition almost exactly: a function that, given a line segment and a depth counter, either draws the segment (base case) or recursively draws two sub-segments at right angles (recursive case). This makes it a popular teaching example in algorithms courses, right alongside the classic recursive tree, Sierpinski triangle, and fractal fern. The visual output gives immediate feedback on whether the recursion is working correctly, which is invaluable for debugging and learning. Beyond the classroom, Lévy C-curves appear in digital art, procedural generation, and even antenna engineering, where fractal geometries can produce compact, broadband antenna designs. The curve's aesthetic versatility — angular and precise at low depths, richly complex at high depths — makes it a favorite among generative artists exploring mathematical beauty.

Frequently Asked Questions

What is the Lévy C-curve?

The Lévy C-curve is a self-similar fractal curve named after French mathematician Paul Lévy, who described it in 1938. It is constructed by repeatedly replacing each line segment with two equal-length segments that meet at a 90-degree right angle. After many iterations, the curve produces a complex, space-nearly-filling shape with a Hausdorff fractal dimension of approximately 1.9342. It belongs to the family of curves generated by Iterated Function Systems (IFS).

How many iterations does it take to see the full Lévy C-curve?

The curve begins to reveal its characteristic dense, angular structure around iteration 10 to 12. At depths of 13 to 16, it approaches its fractal attractor visually, with segments so small they merge into a filled region. For educational or illustrative purposes, iterations 6 through 10 often offer the best balance between visible complexity and clear individual segments. Going beyond iteration 16 typically requires very large canvas sizes and thin strokes to remain legible.

How is the Lévy C-curve different from the Heighway dragon curve?

Both the Lévy C-curve and the Heighway dragon curve are generated by repeatedly folding line segments at right angles, but they differ in fold direction. The Lévy C-curve always folds in the same rotational direction at every iteration, producing its open, crescent-like shape at low depths. The Heighway dragon alternates fold direction — always folding in the same physical direction as if folding a strip of paper — which produces a much more compact, spiral-like structure. Both are IFS fractals, but their visual characters are quite distinct.

Why does the curve start to look filled in at high iteration depths?

The Lévy C-curve has a Hausdorff dimension of approximately 1.9342, which is very close to 2 — the dimension of a plane. This means that as the number of iterations increases toward infinity, the curve nearly fills a two-dimensional region. At high depths like 13 or 14, the individual segments become so small and the curve so densely packed that adjacent segments overlap visually, giving the appearance of a solid filled shape. This is a direct mathematical consequence of the curve's near-space-filling fractal dimension.

Can I use the Lévy C-curve for generative art or design projects?

Absolutely. The Lévy C-curve's angular, geometric aesthetic makes it a popular choice for generative art, graphic design, and digital illustration. By experimenting with iteration depth, color, and stroke weight, you can produce everything from minimal line-art sketches (low iterations) to richly complex geometric compositions (high iterations). The curves can also be tiled, mirrored, or layered to create more elaborate patterns. Because the generator runs in-browser, you can quickly iterate through visual variations without any specialized software.

What is an Iterated Function System (IFS) and how does it relate to this curve?

An Iterated Function System (IFS) is a method for generating fractals by repeatedly applying a set of geometric transformations to a shape. For the Lévy C-curve, the IFS consists of two similarity transformations: each replaces the current segment with two half-length segments meeting at a right angle. When this process is applied repeatedly to every segment, the shape converges to a mathematically stable object called an attractor. The Lévy C-curve is the attractor of its specific IFS, meaning any starting segment will eventually converge to the same fractal shape.

Is the Lévy C-curve used in any real-world applications?

Yes, fractal curves including variants of the Lévy C-curve appear in several applied fields. In antenna engineering, fractal geometries are used to design compact multiband antennas that pack a long effective conductor length into a small physical area. In computer graphics and procedural generation, Lévy-style curves are used to create organic-looking terrain features, coastline simulations, and artistic textures. The curve is also widely used in mathematics and computer science education as an accessible, visually compelling example of recursion and fractal geometry.

What iteration depth should I use for a math class or presentation?

For teaching purposes, iteration depths 1 through 6 are ideal for showing the folding process step by step — each iteration is visually distinct and the structure is easy to explain. Depth 8 or 9 works well for showing a 'mature' fractal that still has clear individual segments. For a final, impressive visual used on a poster or slide, depth 11 to 13 on a large canvas produces a striking, densely complex image. It's often effective in presentations to show a side-by-side progression from depth 1 to depth 12 to communicate the iterative nature of fractal construction.