mandelbrot-orbits-rust
| Crates.io | mandelbrot-orbits-rust |
| lib.rs | mandelbrot-orbits-rust |
| version | 0.1.0 |
| source | src |
| created_at | 2022-12-21 10:41:58.304438 |
| updated_at | 2022-12-21 10:41:58.304438 |
| description | A console command to generate an image of the Mandelbrot Set where each pixel color represents the period of the complex point (if the point belongs to the Set). |
| homepage | |
| repository | |
| max_upload_size | |
| id | 743053 |
| size | 4,201,972 |
Jose Celano (josecelano)
documentation
README
Mandelbrot Orbits
This is a small project to learn Rust.
It generates an image of the Mandelbrot Set where each pixel color represents the period of the complex point if the point belongs to the Set.
More info about Mandelbrot Set Periods.
For now, it's using a greyscale color scheme.
Requirements
cargo:^1.62.1.rustc:^1.62.1.
Use
git clone git@github.com:josecelano/mandelbrot-orbits-rust.git
cargo run ./output/mandelbrot_2048x2048.png 2048x2048 -2.0,2.00 2.0,-2.0
Development
Execute MegaLinter locally:
./bin/ml.sh
Run tests:
cargo test
Math
You can find an explanation here.
And I'm trying to find and write a more formal explanation of the math behind the algorithm.
Credits
- Jeremy Rifkin pointed me at the solution. I have copied/pasted part of his code to detect the period.
- Jim Blandy, Programming Rust Book's Author.
- Jason Orendorff, Programming Rust Book's Author.
Links
Repositories
- Same thing in C++ by Jeremy Rifkin.
- Mandelbrot Trajectory Infima by Jeremy Rifkin.
- Initial code to plot the Mandelbrot Set was forked from the O'Reilly Programming Rust book.
- Mandelbrot in C language with arbitrary precision.
- Periodic points of a complex quadratic polynomial using Newton method by Adam Majewski.
- Numerical periodicity detection of a polynomial and rational Julia set.
Papers
- An Introduction to Complex Dynamics and the Mandelbrot Set by professor Robert L. Benedetto.
- Displaying the Internal Structure of the Mandelbrot Set by Adam Cunningham.
- Newton's method in practice II: The iterated refinement Newton method and near-optimal complexity for finding all roots of some polynomials of very large degrees.