-
-
Notifications
You must be signed in to change notification settings - Fork 360
Add Barnsley Farn java implementation #830
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
Changes from 4 commits
d3e98dc
af34bc2
df42909
d147092
a7f0d1e
e1f39bd
0b65d81
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,91 @@ | ||
import java.io.FileWriter; | ||
import java.io.IOException; | ||
import java.util.Random; | ||
|
||
public class Barnsley { | ||
|
||
private static class Point { | ||
double x, y, z; | ||
|
||
public Point(double x, double y, double z) { | ||
this.x = x; | ||
this.y = y; | ||
this.z = z; | ||
} | ||
|
||
public double[] toDoubleArray() { | ||
return new double[]{this.x, this.y, this.z}; | ||
} | ||
} | ||
|
||
// This is a function that reads in the Hutchinson operator and corresponding | ||
// probabilities and outputs a randomly selected transform | ||
// This works by choosing a random number and then iterating through all | ||
// probabilities until it finds an appropriate bin | ||
public static double[][] selectArray(double[][][] hutchinsonOp, double[] probabilities) { | ||
Random rng = new Random(); | ||
// Random number to be binned | ||
double rand = rng.nextDouble(); | ||
|
||
// This checks to see if a random number is in a bin, if not, that | ||
// probability is subtracted from the random number and we check the | ||
// next bin in the list | ||
for (int i = 0; i < probabilities.length; i++) { | ||
if (rand < probabilities[i]) | ||
return hutchinsonOp[i]; | ||
rand -= probabilities[i]; | ||
} | ||
return null; | ||
} | ||
|
||
// This is a general function to simulate a chaos game | ||
// n is the number of iterations | ||
// initialLocation is the starting point of the chaos game | ||
// hutchinsonOp is the set of functions to iterate through | ||
// probabilities is the set of probabilities corresponding to the likelihood | ||
// of choosing their corresponding function in hutchinsonOp | ||
public static Point[] chaosGame(int n, Point initialLocation, double[][][] hutchinsonOp, double[] probabilities) { | ||
// Initializing output points | ||
Point[] outputPoints = new Point[n]; | ||
Point point = initialLocation; | ||
|
||
for (int i = 0; i < n; i++) { | ||
outputPoints[i] = point; | ||
point = matrixMultiplication(selectArray(hutchinsonOp, probabilities), point.toDoubleArray()); | ||
} | ||
|
||
return outputPoints; | ||
} | ||
|
||
public static Point matrixMultiplication(double[][] operation, double[] point) { | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Java does not support matrix multiplication in its standard library, so this function was necessary. There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Maybe you could integrate the matrix multiplication logic to the There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I think you should either not do the conversion at the end and return a There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. I've decided on keeping it consistent by using double arrays, because it is easier to work with them here. However is checking for the array length in the constructor really necessary? |
||
double[] result = new double[3]; | ||
for (int j = 0; j < operation[0].length; j++) | ||
for (int i = 0; i < operation.length; i++) | ||
result[j] += operation[j][i] * point[i]; | ||
stormofice marked this conversation as resolved.
Show resolved
Hide resolved
|
||
return new Point(result[0], result[1], result[2]); | ||
} | ||
|
||
public static void main(String[] args) throws IOException { | ||
stormofice marked this conversation as resolved.
Show resolved
Hide resolved
|
||
double[][][] barnsleyHutchinson = { | ||
{{0.0, 0.0, 0.0}, | ||
{0.0, 0.16, 0.0}, | ||
{0.0, 0.0, 1.0}}, | ||
{{0.85, 0.04, 0.0}, | ||
{-0.04, 0.85, 1.60}, | ||
{0.0, 0.0, 1.0}}, | ||
{{0.20, -0.26, 0.0}, | ||
{0.23, 0.22, 1.60}, | ||
{0.0, 0.0, 1.0}}, | ||
{{-0.15, 0.28, 0.0}, | ||
{0.26, 0.24, 0.44}, | ||
{0.0, 0.0, 1.0}} | ||
}; | ||
double[] barnsleyProbabilities = new double[]{0.01, 0.85, 0.07, 0.07}; | ||
Point[] outputPoints = chaosGame(10000, new Point(0.0, 0.0, 1.0), barnsleyHutchinson, barnsleyProbabilities); | ||
FileWriter fw = new FileWriter("barnsley.dat"); | ||
for (Point p : outputPoints) | ||
fw.write(p.x + "\t" + p.y + "\n"); | ||
fw.close(); | ||
} | ||
|
||
} |
Uh oh!
There was an error while loading. Please reload this page.