AI summary by TwinMind
The Plotting of Beautiful Curves (Euler Spirals and Sierpiński Triangles) - Numberphile
Numberphile
16m 11s
Turtle Graphics Introduction
- Turtle graphics system controls virtual turtle robot drawing on screen
- Basic commands: forward distance d, turn angle theta, pen down/up
- Pen down draws lines while moving, pen up moves without drawing
- Simple example: forward 1, turn 90°, repeat 4 times = square
- Simplified notation: assume pen always down, forward 1 after each turn
- Programs reduced to list of angles only
Progressive Angle Spiral Curves
- Program: theta, 2theta, 3theta, 4theta, 5theta... (increasing angles)
- With theta = 1°: gradual spiral tightening toward center
- 360 steps: turtle spirals in, then back out (180° rotation)
- 1° = 360th of full turn, creates repeating pattern
- Non-integer degrees (1.02°, 1.03°) create non-repeating, chaotic patterns
- Very sensitive to angle changes - small variations produce totally different results
- Resembles Euler/Cornu spirals but uses discrete turns vs continuous curves
Physical Plotter Implementation
- Python code generates instructions sent via USB to plotter machine
- D_theta parameter chosen to keep drawing within paper bounds
- First spiral cut short (~1000 steps) due to impatience
- 10,000 steps would create spiral of spirals pattern
- 100,000 steps: macro-scale Euler spiral of Euler spirals
- Scale comparison: physical drawing represents tiny portion of full mathematical curve
Sierpinski Triangle Arrowhead Curve
- Goal: draw Sierpinski triangle as single continuous path (no pen up)
- Arrowhead curve draws entire fractal in one stroke
- Uses only 60° left/right turns with consistent step size
- Generated through substitution system with two rules:
- X → Y + X + Y
- Y → X - Y - X
- Plus (+) = turn right 60°, Minus (-) = turn left 60°
Substitution System Iterations
- Iteration 1: X (starting point)
- Iteration 2: Y + X + Y (3 elements)
- Iteration 3: X - Y - X + Y + X + Y + X - Y - X (9 elements)
- Iteration 4: 27 elements
- Each iteration triples complexity (3^n pattern)
- Hand-drawn iterations 1-3 on triangular grid
- Iterations 4+ require computer/plotter assistance
Fractal Pattern Recognition
- Each iteration contains all previous iterations as components
- N=6 and N=7 iterations suitable for machine plotting
- Halfway through plotting reveals self-similar structure
- Next iteration created by lining up previous iterations and reflecting
- Demonstrates recursive fractal construction principle
Advanced Concepts Mentioned
- Potential exploration of pi digits as turtle instructions
- Connection to chaos theory and sensitive dependence
- Relationship between discrete turtle graphics and continuous mathematical curves
