-
Notifications
You must be signed in to change notification settings - Fork 119
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Implement Super Simplex noise #168
Conversation
… to hopefully make more sense
…ost 2x faster overall
Awesome! Thanks for adding this! That must have taken a while to figure out the conversion from the original java implementation, and dealing with the issues that came up. My only request at this point would be that the |
Works fine for me. If there were an open source alternative to Mathematica I'd also be happy to convert it at a later date. I tried to convert it to Rust, but for some reason it was returning provably wrong results. I can try again later, but for now I'll just remove the Mathematica file from the repo. |
Request re-evaluation |
Implemented in 2D and 3D, no 4D implementation was available to port, so it was left out.
The maximum values were determined in Mathematica, and as such should be as exact as possible, so the output range should be [-1,1]. The Mathematica script used to produce the maximum values is included both in the comments in the new example, and also in the find_maximum_super_simplex.nb file.
The example produces the necessary lookup tables, and was originally going to produce the maximum value before the computation was moved to Mathematica, since the Newton's method code I wrote (and then deleted) was producing incorrect values which were provably not maximum.
Closes #161