Processing Forum

Auto format in Processing 2.0 Beta 9

[11 Replies]
- 19-May-2013 05:14 PM
- Forum: Integration and Hardware
I just downloaded the new Processing and auto format has changed. It now takes a bunch of one line conditionals like this:
1. if (in[i] == 1) out += (i%4) + (i>>2);
2. else if (in[i] == 2) out += abs((i%4)-1) + (i>>2);
3. else if (in[i] == 3) out += abs((i%4)-2) + (i>>2);
4. else if (in[i] == 4) out += abs((i%4)-3) + (i>>2);
5. else if (in[i] == 5) out += (i%4) + abs((i>>2)-1);
6. else if (in[i] == 6) out += abs((i%4)-1) + abs((i>>2)-1);
7. else if (in[i] == 7) out += abs((i%4)-2) + abs((i>>2)-1);
8. else if (in[i] == 8) out += abs((i%4)-3) + abs((i>>2)-1);
9. else if (in[i] == 9) out += (i%4) + abs((i>>2)-2);
10. else if (in[i] == 10) out += abs((i%4)-1) + abs((i>>2)-2);
11. else if (in[i] == 11) out += abs((i%4)-2) + abs((i>>2)-2);
12. else if (in[i] == 12) out += abs((i%4)-3) + abs((i>>2)-2);
13. else if (in[i] == 13) out += (i%4) + abs((i>>2)-3);
14. else if (in[i] == 14) out += abs((i%4)-1) + abs((i>>2)-3);
15. else if (in[i] == 15) out += abs((i%4)-2) + abs((i>>2)-3);
16. else if (in[i] == 0) continue;
And turns it into this (all one line):
1. if (in[i] == 1) out += (i%4) + (i>>2); else if (in[i] == 2) out += abs((i%4)-1) + (i>>2); else if (in[i] == 3) out += abs((i%4)-2) + (i>>2); else if (in[i] == 4) out += abs((i%4)-3) + (i>>2); else if (in[i] == 5) out += (i%4) + abs((i>>2)-1); else if (in[i] == 6) out += abs((i%4)-1) + abs((i>>2)-1); else if (in[i] == 7) out += abs((i%4)-2) + abs((i>>2)-1); else if (in[i] == 8) out += abs((i%4)-3) + abs((i>>2)-1); else if (in[i] == 9) out += (i%4) + abs((i>>2)-2); else if (in[i] == 10) out += abs((i%4)-1) + abs((i>>2)-2); else if (in[i] == 11) out += abs((i%4)-2) + abs((i>>2)-2); else if (in[i] == 12) out += abs((i%4)-3) + abs((i>>2)-2); else if (in[i] == 13) out += (i%4) + abs((i>>2)-3); else if (in[i] == 14) out += abs((i%4)-1) + abs((i>>2)-3); else if (in[i] == 15) out += abs((i%4)-2) + abs((i>>2)-3); else if (in[i] == 0) continue;
This is really quite annoying, can it be set to the old way again somehow?

HashSet in Processing

[1 Reply]
- 11-May-2013 08:27 PM
- Forum: Programming Questions
I need to quickly do lookups for previously stored Strings and wanted to use a HashSet. If I type:
1. HashSet<String> example;
I get an error (cannot find a class or type named "HashSet"). If I instead type:
1. HashMap<String, Integer> example;
It works just fine. I have no need to ever get one of the stored Strings so a HashSet would be better, what am I doing wrong?

Intermediate level workshop

[5 Replies]
- 11-Mar-2013 11:11 PM
- Forum: Events and Opportunities
I was asked to give an Intermediate level workshop on Processing at my lab. Two other people will be giving a Beginner and Advanced level workshops and all of the workshops will be 50 minutes.

I was wondering if there is a good estimate of what an Intermediate Processing user would or would not know. I looked at the Learning section ( http://processing.org/learning/ ) to get an idea, and it seems like it is mostly how to manipulate the Coordinate System, Trigonometry, and custom shapes.

If you feel like you are in this range I'd appreciate knowing what kind of Processing sketches you are working on. The workshop is at The University of Illinois in Chicago on the 23rd if anyone is interested in attending.

Edit:

From 4:00 - 8:00 at the Electronic Visualization Labratory (EVL)

842 W Taylor, Room 2032 Chicago, IL 60607

Polymorphism in Processing, access derived class variables

[13 Replies]
- 15-Dec-2012 12:07 PM
- Forum: Programming Questions
I'm trying polymorphism in Processing for the first time and have a class Sphere that extends class Shape. I have an ArrayList<Shape> called objects and when I try to access a variable that is in Shape like:
1. println(objects.get(0).n);
There is no problem. The variable, n, above does not appear in Sphere, only in Shape (Sphere inherits it). On the other hand accessing something that is in Sphere but not in Shape does not seem to work:
1. println(objects.get(0).radius);
I get an error message that tells me "radius cannot be resolved or is not a field". How can I go about accessing this? Code in case that is helpful:
1. ArrayList<Shape> objects;
2. PVector light, prp, vrp;
3. float uMin, uMax, vMin, vMax;
5. void setup() {
6. size(800, 800, P2D);
7. loadPixels();
9. /* Just one light for now:
10. Without the code to handle otherwise, it is assumed
11. that the light produces pure white color */
12. light = new PVector(20.0, 20.0, -5.0);
14. // Prepare Viewing-Reference Coordinate System
15. prp = new PVector(0.0, 0.0, 0.0);
16. vrp = new PVector(0.0, -20.0, -40.0);
17. uMin = -40.0;
18. uMax = 40.0;
19. vMin = -40.0;
20. vMax = 40.0;
22. // Prepare objects
23. objects = new ArrayList<Shape>();
25. // Silver Sphere
26. PVector ssCen = new PVector(15.0, -5.0, -80.0);
27. Color ssKa = new Color(0.231, 0.231, 0.231);
28. Color ssKd = new Color(0.278, 0.278, 0.278);
29. Color ssKs = new Color(0.774, 0.774, 0.774);
30. objects.add(new Sphere(ssCen, 12.0, ssKa, ssKd, ssKs, 89.6, true));
32. // Test Silver Sphere duplicate 1
33. PVector test = new PVector(-10.0, 0.0, -80.0);
34. objects.add(new Sphere(test, 12.0, ssKa, ssKd, ssKs, 89.6, true));
36. // Test Silver Sphere duplicate 2
37. PVector test2 = new PVector(0.0, -25.0, -80.0);
38. objects.add(new Sphere(test2, 12.0, ssKa, ssKd, ssKs, 89.6, true));
39. }
41. void draw() {
42. println(objects.get(0).radius);
44. // Delta i and j
45. float di = (uMax-uMin)/width;
46. float dj = (vMax-vMin)/height;
48. // Fire a ray that bounces recursively
49. float left = uMin+vrp.x;
50. for (int i = 0; i < width; i++) {
51. float top = vMax+vrp.y; // Up is up, not down!
52. for (int j = 0; j < height; j++) {
53. // Rays fire from the prp to a point on the vrp
54. PVector direction = new PVector(left, top, vrp.z);
55. Color intensity = rayTrace(prp, direction, 0);
57. // Map the colors and make sure none exceed 255
58. int r = (int)(min(intensity.r, 1.0)*255.0);
59. int g = (int)(min(intensity.g, 1.0)*255.0);
60. int b = (int)(min(intensity.b, 1.0)*255.0);
61. pixels[i+j*width] = (255<<24)|(r<<16)|(g<<8)|b;
62. top -= dj;
63. }
64. left += di;
65. }
66. updatePixels();
67. }
69. class Color {
70. float r, g, b;
71. Color(float inR, float inG, float inB) {
72. r = inR;
73. g = inG;
74. b = inB;
75. }
76. }
78. class Shape {
79. boolean reflects;
80. float n;
81. Color ka, kd, ks;
82. Shape(Color inKa, Color inKd, Color inKs, float inN, boolean inRe) {
83. ka = inKa;
84. kd = inKd;
85. ks = inKs;
86. n = inN;
87. reflects = inRe;
88. }
89. float intersection(PVector a, PVector b) {
90. return -1.0;
91. }
92. PVector surfaceNormal(PVector in) {
93. PVector out = new PVector(0.0, 0.0, 0.0);
94. return out;
95. }
96. }
98. class Sphere extends Shape {
99. float radius, radSq;
100. PVector center;
101. Sphere(PVector inC, float inR, Color inKa, Color inKd, Color inKs, float inN, boolean inRe) {
102. super(inKa, inKd, inKs, inN, inRe);
103. center = inC;
104. radius = inR;
106. // Math simplification
107. radSq = radius*radius;
108. }
109. float intersection(PVector a, PVector b) {
110. // Delta x, y, and z
111. float dx = b.x-a.x;
112. float dy = b.y-a.y;
113. float dz = b.z-a.z;
115. // Math simplifications
116. float rxa = a.x-center.x;
117. float rya = a.y-center.y;
118. float rza = a.z-center.z;
120. // Prepare Quadratic Formula
121. float qa = dx*dx+dy*dy+dz*dz;
122. float qb = 2*(dx*rxa+dy*rya+dz*rza);
123. float qc = rxa*rxa+rya*rya+rza*rza-radSq;
125. // Parametric t value
126. float t = -1;
128. // Calculate (up to) two intersections
129. float qRight = sqrt(qb*qb-4*qa*qc);
130. if (!Float.isNaN(qRight)) {
131. float twoQa = 2*qa;
132. t = min((-qb+qRight)/twoQa, (-qb-qRight)/twoQa);
133. }
134. return t;
135. }
136. PVector surfaceNormal(PVector in) {
137. PVector out = new PVector(
138. (in.x-center.x)/radius,
139. (in.y-center.y)/radius,
140. (in.z-center.z)/radius);
141. return out;
142. }
143. }
145. Color rayTrace(PVector a, PVector b, int depth) {
146. Color out = new Color(0.0, 0.0, 0.0);
148. // Determine which object (if any) is closest
149. float t = 1000000; // Arbitrarily large
150. int id = -1;
151. for (int i = 0; i < objects.size(); i++) {
152. float objDist = objects.get(i).intersection(a, b);
153. if (objDist > 0 && objDist < t) {
154. t = objDist;
155. id = i;
156. }
157. }
159. // If an object was intersected
160. if (id != -1) {
161. // Add ambient light
162. out.r += objects.get(id).ka.r;
163. out.g += objects.get(id).ka.g;
164. out.b += objects.get(id).ka.b;
166. // Point of intersection
167. PVector intVec = new PVector(
168. a.x+t*(b.x-a.x),
169. a.y+t*(b.y-a.y),
170. a.z+t*(b.z-a.z));
172. // Get normalized surface normal vector
173. PVector surNor = objects.get(id).surfaceNormal(intVec);
175. // Get normalized light direction vector
176. PVector ligVec = new PVector(light.x-intVec.x, light.y-intVec.y, light.z-intVec.z);
177. ligVec.normalize();
179. // Calculate (N*L)
180. float dotNL = surNor.dot(ligVec);
181. if (dotNL > 0) {
182. // Add diffuse light
183. out.r += objects.get(id).kd.r*dotNL;
184. out.g += objects.get(id).kd.g*dotNL;
185. out.b += objects.get(id).kd.b*dotNL;
187. // Get normalized reflection direction vector
188. PVector refVec = new PVector(2*surNor.x*dotNL-ligVec.x,
189. 2*surNor.y*dotNL-ligVec.y,
190. 2*surNor.z*dotNL-ligVec.z);
191. refVec.normalize();
193. // Get normalized viewer direction vector
194. PVector vieVec = new PVector(a.x-intVec.x, a.y-intVec.y, a.z-intVec.z);
195. vieVec.normalize();
197. // Calculate (R*V) to the nth power
198. float dotRVSq = refVec.dot(vieVec);
199. dotRVSq = pow(dotRVSq, objects.get(id).n);
200. if (dotRVSq > 0) {
201. // Add specular light
202. out.r += objects.get(id).ks.r*dotRVSq;
203. out.g += objects.get(id).ks.g*dotRVSq;
204. out.b += objects.get(id).ks.b*dotRVSq;
205. }
207. // Recursively get the bounce light
208. if (objects.get(id).reflects && depth < 3) {
209. PVector direction = new PVector(intVec.x+refVec.x, intVec.y+refVec.y, intVec.z+refVec.z);
210. Color reflection = rayTrace(intVec, direction, depth+1);
211. out.r += reflection.r*objects.get(id).ks.r;
212. out.g += reflection.g*objects.get(id).ks.g;
213. out.b += reflection.b*objects.get(id).ks.b;
214. }
215. }
216. }
217. return out;
218. }
Edit: Realized highlighting would probably be helpful

When is it bad to use text Processing highlights?

[5 Replies]
- 14-Dec-2012 09:08 PM
- Forum: General Discussion
I was just starting to write a class for vectors and noticed that my normalize method appears as blue. It doesn't seem to cause an error. When is it problematic to use text that Processing highlights?

Here is the class so far (far from done):
1. class Vec {
2. float x, y, z;
3. Vec() {
4. x = 0;
5. y = 0;
6. z = 0;
7. }
8. Vec(float inX, float inY, float inZ) {
9. x = inX;
10. y = inY;
11. z = inZ;
12. }
13. void normalize() {
14. float mag = sqrt(x*x+y*y+z*z);
15. x /= mag;
16. y /= mag;
17. z /= mag;
18. }
19. }
Edit: The text that is highlighted is normalize

Processing 2.0 changed how pixels works?

[6 Replies]
- 29-Nov-2012 10:11 PM
- Forum: Programming Questions
I tried running an old sketch I made in an earlier version of Processing and it doesn't work anymore. If I replace the line highlighted in red with:
1. pixels[i+j*width] = color(steps);
Then it works, but it used to work how it is in the code below. What changed?
1. float minThreshold = 0.0001;
2. int maxDepth = 800;
3. float angle = 0;
5. void setup() {
6. size(400, 300, P2D);
7. //noLoop();
8. }
10. void draw() {
11. float x = cos(angle+HALF_PI)*50;
12. float z = sin(angle+HALF_PI)*50;
13. background(0);
14. loadPixels();
15. for (int i = 0; i < width; i++) {
16. for (int j = 0; j < height; j++) {
17. float dx = (float)i/width-0.5;
18. float dy = ((float)j/height-0.5)*(float)height/width;
19. float dz = 1.0;
20. float normVec = 1.0/sqrt(dx*dx+dy*dy+dz*dz);
21. dx *= normVec;
22. dy *= normVec;
23. dz *= normVec;
24. float rayX = 0;
25. float rayY = 0;
26. float rayZ = 0;
27. float rayLength = 0;
28. int steps = 255;
29. while (steps > 0 && rayLength < maxDepth) {
30. // Rotation Y-axis
31. float rotX = rayX*cos(angle)-rayZ*sin(angle);
32. float rotZ = rayZ*cos(angle)+rayX*sin(angle);
34. // Sphere
35. float sphereDist = sqrt(sq(rayX)+sq(rayY)+sq(rayZ-50))-5;
37. // Cube
38. //float cubeDist = max(abs(rayX)-5, max(abs(rayY-10)-5, abs(rayZ-50)-5));
39. float cubeDist = max(abs(rotX-x)-5, max(abs(rayY-10)-5, abs(rotZ-z)-5));
41. // Torus
42. //float q = sqrt(sq(rayX)+sq(rayY+10))-3.33;
43. //float torusDist = sqrt(sq(q)+sq(rayZ-50))-1.67;
44. float q = sqrt(sq(rotX-x)+sq(rayY+10))-3.33;
45. float torusDist = sqrt(sq(q)+sq(rotZ-z))-1.67;
47. float smallestDist = min(sphereDist, min(cubeDist, torusDist))*0.5;
48. if (smallestDist < minThreshold) {
49. pixels[i+j*width] = (steps<<16)+(steps<<8)+steps;
50. break;
51. }
52. else {
53. rayLength += smallestDist;
54. rayX = dx*rayLength;
55. rayY = dy*rayLength;
56. rayZ = dz*rayLength;
57. steps--;
58. }
59. }
60. }
61. }
62. updatePixels();
63. angle += TWO_PI/36;
64. }

Test for NaN as a conditional

[2 Replies]
- 28-Nov-2012 08:11 PM
- Forum: Programming Questions
I'm practicing parametric intersections of a line and a circle. There can be 0, 1, or 2 intersections among the two. If there are less than 2 intersections I end up with NaN as one of my intersection variables (which is fine, the equation is trying to calculate an intersection that doesn't exist). What is the standard way to test for NaN? Right now I just am drawing the intersection point if its intersection variable is greater than 0:
1. float theta = 0;
2. float rx, ry;
3. float cr, cx, cy;
5. void setup() {
6. size(600, 600);
7. noFill();
8. smooth();
9. cr = 50;
10. cx = 300;
11. cy = 500;
12. ry = height;
13. }
15. void draw() {
16. background(255);
17. line(0, 0, rx, ry);
18. ellipse(cx, cy, cr*2, cr*2);
20. theta += TWO_PI/1000;
21. rx = (cos(theta)+1)*width/2;
23. float t1 = (rx*cx+ry*cy + sqrt(cr*cr*(rx*rx+ry*ry)-sq(rx*cy-ry*cx)))/(rx*rx+ry*ry);
24. float t1x = t1*rx;
25. float t1y = t1*ry;
26. if (t1 > 0) {
27. ellipse(t1x, t1y, 5, 5);
28. //println("t1 = "+t1);
29. }
31. float t2 = (rx*cx+ry*cy - sqrt(cr*cr*(rx*rx+ry*ry)-sq(rx*cy-ry*cx)))/(rx*rx+ry*ry);
32. float t2x = t2*rx;
33. float t2y = t2*ry;
34. if (t2 > 0) {
35. ellipse(t2x, t2y, 5, 5);
36. //println("t2 = "+t2);
37. }
38. }
EDIT: t1 and t2 are the variables that are NaN when either one has no intersection

Make Binary Tree return some kind of flag when inserting a duplicate

[15 Replies]
- 17-Nov-2012 05:26 PM
- Forum: Programming Questions
I'm making a Binary Search tree for the first time. So far it seems to work, but I would like to be able to test if I am inserting a duplicate element. Right now it simply doesn't insert anything if the tree already contained the element and prints a message saying "Duplicate". Can I make this return a boolean so I could test if it didn't insert anything?
I realize that I could use contains() first, but I'd prefer insert() to return a boolean. Also, as this is the first time I'm writing a Binary Search tree any pointers on improvements are welcome.
BTree tree = new BTree();

void setup() {

size(400, 400);

tree.insert(4);

tree.insert(8);

tree.insert(8);

tree.insert(2);

tree.insert(3);

println(tree.contains(2));

}

void draw() {

}

class BTree {

Node root;

BTree() {

root = null;

}

boolean contains(int in) {

return contains(in, root);

}

boolean contains(int in, Node curr) {

if (curr == null) return false;

if (in < curr.val) return contains(in, curr.left);

else if (in > curr.val) return contains(in, curr.right);

else return true;

}

boolean isEmpty() {

return root == null;

}

void insert(int in) {

root = insert(in, root);

}

Node insert(int in, Node curr) {

if (curr == null) return new Node(in, null, null);

if (in < curr.val) curr.left = insert(in, curr.left);

else if (in > curr.val) curr.right = insert(in, curr.right);

else println("Duplicate");

return curr;

}

void makeEmpty() {

root = null;

}

}

class Node {

int val;

Node left;

Node right;

Node(int v) {

val = v;

left = null;

right = null;

}

Node(int v, Node l, Node r) {

val = v;

left = l;

right = r;

}

}

Easy way to visually flip Processing's y-axis? (P3D)

[2 Replies]
- 03-Nov-2012 04:32 PM
- Forum: General Discussion
I have some programs I wrote for OpenGL where positive y-axis is up. When I convert them to Processing everything is upside down (Processing positive y-axis is down). What is the easiest way to visually reverse this without changing all the math of the original program?

Transitioning from Processing to plain Java

[8 Replies]
- 29-Oct-2012 06:21 PM
- Forum: General Discussion
I started school this semester and am working in Java and C++, both of which are completely new to me. I had used Processing for a while (~4 years) and am accustomed to learning programming visually. In C++ I am using OpenGL to work visually by modifying class projects but do not know where to start for Java.

Does anyone know of a good place to learn how to make a window that can be drawn to like Processing? I have seen examples that create an applet for web but I would prefer to find something that could run in a terminal (if that is possible).

Shorthand for double array?

[2 Replies]
- 25-Aug-2012 05:52 PM
- Forum: Programming Questions
I have to manually write the values of a double array for a sketch I am making for later reference. I know that a normal array can be written like this (preferred):
1. int[] a = {
2. 1, 5, 3, 6, 4, 6
3. };
instead of (not preferred):
1. int[] a = new int[6];
2. a[0] = 1;
3. a[1] = 5;
4. a[2] = 3;
5. a[3] = 6;
6. a[4] = 4;
7. a[5] = 6;
Can this be done for double arrays somehow?

Help finding centroid (and SubD data structure help)

[2 Replies]
- 31-Jul-2012 09:56 PM
- Forum: Programming Questions
I've been trying to teach myself the Catmull-Clark algorithm: http://en.wikipedia.org/wiki/Catmull-Clark_subdivision_surface
So far I'm just working in 2D getting faces to subdivide. The linked wiki page has steps for how to do the algorithm and the first one says to find the centroid of a face. I've never tried to do that, and I have a hunch my method (highlighted in red below) is not finding the centroid. Can anyone verify this and help if I am doing it wrong?

Note:
- I know I am not moving the original vertices of the faces in the code below (one of the steps of the wiki article says to do that). I'm not worried about that step yet.
- It took me a long time to figure out the subdividing recursion. The data structure I'm using is something I made up that works but may not be the best. I'd gladly take suggestions on improvement.
Code (centroid attempt in red):
int faceVerts = 4;

ArrayList<Face> faces = new ArrayList<Face>();

ArrayList<Vert> verts = new ArrayList<Vert>();

void setup() {

size(800, 800);

smooth();

noFill();

int[] vList = new int[faceVerts];

for (int i = 0; i < faceVerts; i++) {

float ang = TWO_PI/faceVerts*i;

verts.add(new Vert(width/2+cos(ang)*350, height/2+sin(ang)*350, i));

vList[i] = i;

}

faces.add(new Face(vList));

}

void draw() {

background(255);

for (int i = 0; i < faces.size(); i++) {

Face iFace = faces.get(i);

beginShape();

for (int j = 0; j < iFace.num; j++) vertex(iFace.x[j], iFace.y[j]);

endShape(CLOSE);

}

for (int i = 0; i < verts.size(); i++) {

Vert iVert = verts.get(i);

ellipse(iVert.x, iVert.y, 5, 5);

}

}

class Face {

int num;

float[] x;

float[] y;

int[] id;

Face(int[] inIDs) {

num = inIDs.length;

x = new float[num];

y = new float[num];

id = new int[num];

for (int i = 0; i < num; i++) {

Vert iVert = verts.get(inIDs[i]);

x[i] = iVert.x;

y[i] = iVert.y;

id[i] = inIDs[i];

}

}

}

class Vert {

float x, y;

int id;

Vert(float inX, float inY, int inID) {

x = inX;

y = inY;

id = inID;

}

}

void mousePressed() {

for (int i = faces.size()-1; i > -1; i--) {

Face iFace = faces.get(i);

// Place vertex at center of face

float newX = 0;

float newY = 0;

for (int j = 0; j < iFace.num; j++) {

newX += iFace.x[j];

newY += iFace.y[j];

}

verts.add(new Vert(newX/iFace.num, newY/iFace.num, verts.size()-1));

// Place vertices at midpoint of each edge

for (int j = 0; j < iFace.num-1; j++) verts.add(new Vert((iFace.x[j]+iFace.x[j+1])/2, (iFace.y[j]+iFace.y[j+1])/2, verts.size()-1));

verts.add(new Vert((iFace.x[0]+iFace.x[iFace.num-1])/2, (iFace.y[0]+iFace.y[iFace.num-1])/2, verts.size()-1));

// Add new faces and remove the original face

int[] vList = {

iFace.id[0], verts.size()-iFace.num, verts.size()-iFace.num-1, verts.size()-1

};

faces.add(new Face(vList));

for (int j = 0; j < iFace.num-1; j++) {

vList[0] = iFace.id[j+1];

vList[1] = verts.size()-iFace.num+j+1;

vList[2] = verts.size()-iFace.num-1;

vList[3] = verts.size()-iFace.num+j;

faces.add(new Face(vList));

}

faces.remove(i);

}

}

Platonic Solid Images in Exhibition

[6 Replies]
- 25-Jul-2012 11:54 PM
- Forum: General Discussion
There are a series of amazing geometry sketches in exhibition: http://www.michael-hansmeyer.com/projects/platonic_solids.html?screenSize=1&color=0

I would like to learn how this was done. Does anyone know anything about this project or have a suggestion on where to learn about it?

Mysterious annoying error, IndexOutOfBounds

[3 Replies]
- 16-Jul-2012 10:15 PM
- Forum: Programming Questions
I have continued working on the polygon sketch I shared here a few times but have come up against an error I cannot figure out. To trigger the error:

- Click on a polygon. It will make "selectors" appear, clicking on one of them adds a new polygon in that direction

- If that new polygon (or any new polygon after) is selected and then the mouse clicks on an area that is not a "selector" the error happens

- The error does not happen after new polygons are added if the mouse clicked on a "selector"

Unfortunately Processing doesn't tell me which line caused the error, and I can't seem to figure it out. If anyone could help me figure it out I'd really appreciate it. Some side notes about the sketch:

- Right now if a new polygon is added it is correctly placed. However, if vertices are added / removed it no longer is tangent to its parent polygon. This is not really an error / problem so much as I have not implemented a correction to it yet as I am distracted by the error

- I have not optimized all of the code by the suggestions from earlier threads on this sketch (I promise I will, the suggestions were wonderful, thank you again to everyone that helped)
1. float unit = 50;
2. float selUnit = unit/4;
3. int selected = -1;
4. ArrayList<Polygon> polys = new ArrayList<Polygon>();
5. ArrayList<Float> selAng = new ArrayList<Float>();
6. ArrayList<Float> selX = new ArrayList<Float>();
7. ArrayList<Float> selY = new ArrayList<Float>();
9. void setup() {
10. size(400, 400);
11. smooth();
12. polys.add(new Polygon(-HALF_PI, width/2, height/2, 3));
13. }
15. void draw() {
16. background(255);
17. for (int i = 0; i < polys.size(); i++) {
18. Polygon pGet = polys.get(i);
19. if (selected == i) {
20. fill(255, 0, 0);
21. for (int j = 0; j < selAng.size(); j++) ellipse(selX.get(j), selY.get(j), selUnit, selUnit);
22. }
23. else fill(192, 128);
24. beginShape();
25. for (int j = 0; j < pGet.verts; j++) vertex(pGet.vx.get(j), pGet.vy.get(j));
26. endShape(CLOSE);
27. }
28. }
30. class Polygon {
31. float rad, rot, x, y;
32. int verts;
33. ArrayList<Float> vx = new ArrayList<Float>();
34. ArrayList<Float> vy = new ArrayList<Float>();
35. Polygon(float inRo, float inX, float inY, int inVe) {
36. rot = inRo;
37. x = inX;
38. y = inY;
39. verts = inVe;
40. rad = (unit/2)/sin(PI/verts);
41. for (int i = 0; i < verts; i++) {
42. float vertAngle = rot+TWO_PI/verts*i;
43. vx.add(x+cos(vertAngle)*rad);
44. vy.add(y+sin(vertAngle)*rad);
45. }
46. }
47. void updateVerts() {
48. rad = (unit/2)/sin(PI/verts);
49. vx.clear();
50. vy.clear();
51. for (int i = 0; i < verts; i++) {
52. float vertAngle = rot+TWO_PI/verts*i;
53. vx.add(x+cos(vertAngle)*rad);
54. vy.add(y+sin(vertAngle)*rad);
55. }
56. }
57. }
59. boolean pointInPolygon(float x, float y, int id) {
60. /* Determine if a point is in a polygon by pretending that neighboring polygon
61. vertices are connected to the mouse as triangles and summing the internal angles.
62. If the sum is about TWO_PI that polygon is selected */
63. Polygon pGet = polys.get(id);
64. float sideA = sqrt(sq(x-pGet.vx.get(0))+sq(y-pGet.vy.get(0)));
65. float sideB = sqrt(sq(x-pGet.vx.get(pGet.verts-1))+sq(y-pGet.vy.get(pGet.verts-1)));
66. float totalAng = acos((sq(sideA)+sq(sideB)-sq(unit))/(2*sideA*sideB));
67. for (int j = 0; j < pGet.verts-1; j++) {
68. sideA = sqrt(sq(x-pGet.vx.get(j))+sq(y-pGet.vy.get(j)));
69. sideB = sqrt(sq(x-pGet.vx.get(j+1))+sq(y-pGet.vy.get(j+1)));
70. totalAng += acos((sq(sideA)+sq(sideB)-sq(unit))/(2*sideA*sideB));
71. }
72. if (totalAng > TWO_PI-0.01 && totalAng < TWO_PI+0.01) return true;
73. else return false;
74. }
76. void setSelectors() {
77. selAng.clear();
78. selX.clear();
79. selY.clear();
80. Polygon pGet = polys.get(selected);
81. for (int i = 0; i < pGet.verts; i++) {
82. float getAngle = pGet.rot+TWO_PI/pGet.verts*i+PI/pGet.verts;
83. float getRad = sqrt(sq(pGet.rad)-sq(unit/2))+selUnit;
84. float newX = pGet.x+cos(getAngle)*getRad;
85. float newY = pGet.y+sin(getAngle)*getRad;
86. boolean inPolygon = false;
87. for (int j = 0; j < polys.size(); j++) {
88. if (pointInPolygon(newX, newY, j)) {
89. inPolygon = true;
90. break;
91. }
92. }
93. if (!inPolygon) {
94. selAng.add(getAngle);
95. selX.add(newX);
96. selY.add(newY);
97. }
98. }
99. }
101. void mousePressed() {
102. /* Determine if a polygon adding selector was selected */
103. if (selected != -1) {
104. Polygon pGet = polys.get(selected);
105. for (int i = 0; i < pGet.verts; i++) {
106. if (sqrt(sq(mouseX-selX.get(i))+sq(mouseY-selY.get(i))) < selUnit/2) {
107. float getRad = sqrt(sq(pGet.rad)-sq(unit/2))*2;
108. float getAngle = selAng.get(i);
109. float newAngle = pGet.rot+TWO_PI/((pGet.verts%2)+1);
110. float newX = pGet.x+cos(getAngle)*getRad;
111. float newY = pGet.y+sin(getAngle)*getRad;
112. polys.add(new Polygon(newAngle, newX, newY, pGet.verts));
113. break;
114. }
115. }
116. }
118. /* Determine if a polygon was selected */
119. selected = -1;
120. for (int i = 0; i < polys.size(); i++) {
121. if (pointInPolygon(mouseX, mouseY, i)) {
122. selected = i;
123. setSelectors();
124. break;
125. }
126. }
127. }
129. void keyPressed() {
130. if (selected != -1 && key == CODED) {
131. if (keyCode == UP) {
132. Polygon pGet = polys.get(selected);
133. pGet.verts++;
134. pGet.updateVerts();
135. setSelectors();
136. }
137. if (keyCode == DOWN && polys.get(selected).verts > 3) {
138. Polygon pGet = polys.get(selected);
139. pGet.verts--;
140. pGet.updateVerts();
141. setSelectors();
142. }
143. }
144. }

Point in polygon optimization

[10 Replies]
- 10-Jul-2012 03:01 AM
- Forum: Programming Questions
I wrote a sketch where I can select among regular polygons on the screen accurately with the mouse. Right now the selection is done with the mouse, but in a future sketch it will probably be performed many times by an AI planning tessellations. The code highlighted in red below works but I want to make sure it is optimized before I write something that will use that test many times.

On a side note, the method below (again, in red) is the only way I could think of to accurately select the area of a regular polygon. If someone knows of a better way I'd love to know:
1. float unit = 50;
2. boolean somethingSelected = false;
3. int selected = 0;
4. ArrayList<Polygon> polys = new ArrayList<Polygon>();
6. void setup() {
7. size(800, 400);
8. smooth();
9. polys.add(new Polygon(-HALF_PI, width/5, height/2, 3));
10. polys.add(new Polygon(-HALF_PI, width/2, height/2, 4));
11. polys.add(new Polygon(-HALF_PI, width-width/5, height/2, 5));
12. }
14. void draw() {
15. background(255);
16. for (int i = 0; i < polys.size(); i++) {
17. if (somethingSelected && selected == i) fill(255, 0, 0);
18. else fill(255);
19. Polygon pGet = polys.get(i);
20. float rad = (unit/2)/sin(PI/pGet.verts);
21. beginShape();
22. for (int j = 0; j < pGet.verts; j++) {
23. vertex(pGet.x+cos(pGet.rot+TWO_PI/pGet.verts*j)*rad,
24. pGet.y+sin(pGet.rot+TWO_PI/pGet.verts*j)*rad);
25. }
26. endShape(CLOSE);
27. }
28. }
30. class Polygon {
31. float rot, x, y;
32. int verts;
33. Polygon(float inRo, float inX, float inY, int inVe) {
34. rot = inRo;
35. x = inX;
36. y = inY;
37. verts = inVe;
38. }
39. }
41. void mousePressed() {
42. /* Determine which polygon is selected by pretending that neighboring polygon
43. vertices are connected to the mouse as triangles and summing the internal
44. angles. If the sum is about TWO_PI that polygon is selected */
45. somethingSelected = false;
46. for (int i = 0; i < polys.size(); i++) {
47. Polygon pGet = polys.get(i);
48. float rad = (unit/2)/sin(PI/pGet.verts);
49. ArrayList<Float> vx = new ArrayList<Float>();
50. ArrayList<Float> vy = new ArrayList<Float>();
51. for (int j = 0; j < pGet.verts; j++) {
52. vx.add(pGet.x+cos(pGet.rot+TWO_PI/pGet.verts*j)*rad);
53. vy.add(pGet.y+sin(pGet.rot+TWO_PI/pGet.verts*j)*rad);
54. }
55. float sideA = sqrt(sq(mouseX-vx.get(0))+sq(mouseY-vy.get(0)));
56. float sideB = sqrt(sq(mouseX-vx.get(pGet.verts-1))+sq(mouseY-vy.get(pGet.verts-1)));
57. float totalAng = acos((sq(sideA)+sq(sideB)-sq(unit))/(2*sideA*sideB));
58. for (int j = 0; j < pGet.verts-1; j++) {
59. sideA = sqrt(sq(mouseX-vx.get(j))+sq(mouseY-vy.get(j)));
60. sideB = sqrt(sq(mouseX-vx.get(j+1))+sq(mouseY-vy.get(j+1)));
61. totalAng += acos((sq(sideA)+sq(sideB)-sq(unit))/(2*sideA*sideB));
62. }
63. if (totalAng > TWO_PI-0.01 && totalAng < TWO_PI+0.01) {
64. selected = i;
65. somethingSelected = true;
66. break;
67. }
68. }
69. }
71. void keyPressed() {
72. if (somethingSelected && key == CODED) {
73. if (keyCode == UP) polys.get(selected).verts++;
74. if (keyCode == DOWN && polys.get(selected).verts > 3) polys.get(selected).verts--;
75. }
76. }

Uniform edge length for NGon

[12 Replies]
- 08-Jul-2012 02:37 PM
- Forum: Programming Questions
I have a sketch that can increase / decrease the number of vertices for a polygon. Right now I have a variable, "unit", which is set to 50. All of the polygons' vertices are drawn from the center of the polygon with a distance of 50 from the center. This is not what I actually want, I want all of the edges of the polygons to have the length of 50 (polygons with more vertices will be bigger than polygons with less vertices). How can I do this?
1. float unit = 50;
2. int selected = 0;
3. ArrayList<Polygon> polys = new ArrayList<Polygon>();
5. void setup() {
6. size(800, 400);
7. smooth();
8. polys.add(new Polygon(-HALF_PI, width/5, height/2, 3));
9. polys.add(new Polygon(-HALF_PI, width/2, height/2, 4));
10. polys.add(new Polygon(-HALF_PI, width-width/5, height/2, 5));
11. }
13. void draw() {
14. background(255);
15. for (int i = 0; i < polys.size(); i++) {
16. if (selected == i) fill(255, 0, 0);
17. else fill(255);
18. beginShape();
19. for (int j = 0; j < polys.get(i).verts; j++) {
20. vertex(polys.get(i).x+cos(polys.get(i).rot+TWO_PI/polys.get(i).verts*j)*unit,
21. polys.get(i).y+sin(polys.get(i).rot+TWO_PI/polys.get(i).verts*j)*unit);
22. }
23. endShape(CLOSE);
24. }
25. }
27. class Polygon {
28. float rot, x, y;
29. int verts;
30. Polygon(float inRo, float inX, float inY, int inVe) {
31. rot = inRo;
32. x = inX;
33. y = inY;
34. verts = inVe;
35. }
36. }
38. void keyPressed() {
39. if (key == CODED) {
40. if (keyCode == LEFT && selected > 0) selected--;
41. if (keyCode == RIGHT && selected < polys.size()-1) selected++;
42. if (keyCode == UP) polys.get(selected).verts++;
43. if (keyCode == DOWN && polys.get(selected).verts > 3) polys.get(selected).verts--;
44. }
45. }

Complicated ArrayList structure problem

[6 Replies]
- 08-Jul-2012 11:03 AM
- Forum: Programming Questions
I am trying to set up a structure that will let me add or remove polygons from a future geometry sketch. I also want to be able to change the number of vertices for a polygon and the vertices' positions. I have never used an ArrayList of ArrayLists and can't see what is wrong with the last line in setup() (highlighted in red). This structure seems a bit complicated, if there is a suggestion of a better way to do it I am willing to change the structure.
1. ArrayList<ArrayList> polygons = new ArrayList<ArrayList>();
3. void setup() {
4. size(800, 800);
5. // -------------------------------------------------------------------
6. // Structure of polygons (ArrayList)
7. // 0 = Polygon x position (Float)
8. // 1 = Polygon y position (Float)
9. // 2 = Vertices (ArrayList)
10. // - 2.0 = Number of vertices (Integer)
11. // - 2.1 = Vertices x position (Float)
12. // - 2.2 = Vertices y position (Float)
13. // -------------------------------------------------------------------
14. polygons.add(new ArrayList<Float>()); // X position
15. polygons.add(new ArrayList<Float>()); // Y position
16. polygons.add(new ArrayList<ArrayList>()); // Vertices
17. polygons.get(2).add(new ArrayList<Integer>()); // Number of vertices
18. polygons.get(2).add(new ArrayList<Float>()); // Vertices x position
19. polygons.get(2).add(new ArrayList<Float>()); // Vertices y position
21. // Initialize the first element of polygons
22. polygons.get(0).add(width/2);
23. polygons.get(1).add(height/2);
25. // Why doesn't this work?
26. // I want it to be a triangle later so it should have 3 vertices
27. polygons.get(2).get(0).add(3);
28. }
30. void draw() {
31. }

HashMap value usage

[3 Replies]
- 24-Jun-2012 10:17 PM
- Forum: Programming Questions
I have only used HashMap once so I am not too familiar with it. What I am trying to do is build a list of URLs I have visited with a spider. If the spider has not visited a site then it should be added to the HashMap to get visited later (Note, in the code below the spider does not visit sites stored in the HashMap yet).

Right now if I am adding a new URL (stored as a String) to the HashMap I just store the String and assign the key to be 1. Does it matter what the key is for my purpose? I really am only interested in having a list of sites not visit to avoid repetition of visitation. I imagine the list will become large when it visits multiple sites so I figured a HashMap was the way to go. Here is the code so far:
1. String urlBase = "http://www.processing.org";
2. String[] source = loadStrings("http://www.processing.org/");
3. HashMap<String, Integer> visited = new HashMap<String, Integer>();
5. void setup() {
6. size(200, 200);
7. doVisit(join(source, ""));
8. println(visited);
9. }
11. void draw() {
12. }
14. String[] cleanURLs(String[] in) {
15. int valid = 0;
16. for (int i = 0; i < in.length; i++) {
17. String lowerIn = in[i].toLowerCase();
19. // See if urlBase needs to be added
20. if (match(lowerIn, "http://") == null && match(lowerIn, "https://") == null) {
21. // If the URL would be valid if urlBase was added do so
22. if (lowerIn.indexOf("/", 0) == 0) {
23. in[i] = urlBase+in[i];
24. valid++;
25. }
26. else in[i] = null;
27. }
28. else valid++;
29. }
31. // Build a String[] of non null elements
32. int count = 0;
33. String[] hasAttribute = new String[valid];
34. for (int i = 0; i < in.length; i++) {
35. if (in[i] != null) {
36. hasAttribute[count] = in[i];
37. count++;
38. }
39. }
40. return hasAttribute;
41. }
43. // Always make sure attribute is lowercase
44. String[] getAttributes(String[] in, String attribute) {
45. int valid = 0;
46. for (int i = 0; i < in.length; i++) {
47. String lowerIn = in[i].toLowerCase();
49. // Make sure the attribute is present
50. if (match(lowerIn, attribute) != null) {
51. int index = lowerIn.indexOf(attribute, 0);
53. // Make sure quotes are found
54. int start = lowerIn.indexOf('"', index);
55. int end = lowerIn.indexOf('"', start+1);
56. if (start == -1 || end == -1) {
57. start = lowerIn.indexOf("'", index);
58. end = lowerIn.indexOf("'", start+1);
59. if (start == -1 || end == -1) in[i] = null;
60. else {
61. in[i] = in[i].substring(start+1, end);
62. valid++;
63. }
64. }
65. else {
66. in[i] = in[i].substring(start+1, end);
67. valid++;
68. }
69. }
70. else in[i] = null;
71. }
73. // Build a String[] of non null elements
74. int count = 0;
75. String[] hasAttribute = new String[valid];
76. for (int i = 0; i < in.length; i++) {
77. if (in[i] != null) {
78. hasAttribute[count] = in[i];
79. count++;
80. }
81. }
82. return hasAttribute;
83. }
85. // Always make sure start and end are lowercase
86. String[] getTags(String in, String start, String end) {
87. ArrayList startIndexes = new ArrayList();
88. ArrayList endIndexes = new ArrayList();
89. String lowerIn = in.toLowerCase();
90. boolean noMatch = false;
91. int position = 0;
93. // Get all the indexes of start and end keywords
94. while (true) {
95. int index = lowerIn.indexOf(start, position);
96. if (index != -1) {
97. startIndexes.add(index);
98. position = index+1;
99. int indexStop = lowerIn.indexOf(end, position);
100. if (indexStop != -1) endIndexes.add(indexStop+end.length());
101. else {
102. noMatch = true;
103. break;
104. }
105. }
106. else break;
107. }
109. // Return a list of found tags assuming there is not a problem
110. if (startIndexes.size() == 0) {
111. println(start+" not found");
112. String[] thatsBad = new String[0];
113. return thatsBad;
114. }
115. else if (noMatch) {
116. println(end+" not found for every case of "+start);
117. String[] thatsBad = new String[0];
118. return thatsBad;
119. }
120. else {
121. String[] subs = new String[startIndexes.size()];
122. for (int i = 0; i < subs.length; i++) {
123. subs[i] = in.substring((Integer)startIndexes.get(i), (Integer)endIndexes.get(i));
124. }
125. return subs;
126. }
127. }
129. void doVisit(String in) {
130. // Get the information from the visited website
131. String[] anchors = getTags(in, "<a", "</a>");
132. if (anchors.length != 0) {
133. String[] hrefs = getAttributes(anchors, "href");
134. if (hrefs.length != 0) {
135. String[] urls = cleanURLs(hrefs);
136. if (urls.length != 0) {
137. // If information was found add it to the HashMap
138. for (int i = 0; i < urls.length; i++) if (!visited.containsKey(urls[i])) visited.put(urls[i], 1);
139. }
140. else println("URL array empty for "+in);
141. }
142. else println("Href array empty for "+in);
143. }
144. else println("Anchor array empty for "+in);
145. }

Handling loadStrings() from URL error

[3 Replies]
- 21-Jun-2012 09:20 PM
- Forum: Programming Questions
I am using: loadStrings("http://www.processing.org/") right now for testing. When I try to load a URL that is invalid I get an error. How can I set up a conditional to test if it will fail and only perform loadStrings() if it doesn't fail without the error?

Building a spider

[7 Replies]
- 10-Jun-2012 12:29 PM
- Forum: General Discussion
Is it possible to use Processing to visit a website and get the source code? I wanted to try to see if I could build something that visits a website and finds keywords I choose.

Draggable color nodes

[11 Replies]
- 04-Jun-2012 06:05 PM
- Forum: General Discussion
I came across a nice fractal zooming web app the other day and made one like it. I have not included color in my own version and was wondering what would be a good way to make a draggable color selection like the one from this link: http://www.carefullyconstructed.co.uk/projects/fractal/

To see what I am talking about in the link click on the downward pointing arrow, a menu will appear. I realize this is not Processing but I want to make a sketch of something like the color selection in Processing before I try to make it work with my web app.

I'm not sure how to go about starting something like this. Basically what I am looking to do is have an arbitrary number of nodes that are assigned a color and a x position between 0 and 1 to make a color palette. An image that is made of pixels with values between 0 and 1 will receive the appropriate color from this palette. Any help is appreciated.

Set pixels[] once and use it as a background

[4 Replies]
- 13-May-2012 08:29 PM
- Forum: Programming Questions
I have a program that draws a fractal using pixels[]. I want to be able to zoom in by clicking and dragging a rect over a section to make that the new boundaries (then redraw the fractal with the new boundaries). It takes a almost a second to calculate the fractal and draw it so I don't want to draw it every frame. Is there a way to set pixels once so I could call it like a background and be able to drag a rect on top of it?

This would be the equivalent of what I want but with background:
1. int mx, my;
3. void setup() {
4. size(600, 600);
5. noFill();
6. stroke(255);
7. }
9. void draw() {
10. background(128); // I want this to be a call to show what is in pixels[]
11. if (mousePressed) rect(mx, my, mouseX-mx, mouseY-my);
12. }
14. void mousePressed() {
15. mx = mouseX;
16. my = mouseY;
17. }

Pointing at a specific long in an array without testing each

[10 Replies]
- 09-May-2012 08:29 PM
- Forum: Programming Questions
I'm starting a new project for a Chess AI and am just doing the drag and drop selection for human players at the moment. The code I have below works fine, but when I start doing move generation it is going to be really important that the code is as fast as possible.

Right now more than one piece can be on a square (haven't coded a condition to prevent it yet) but later that will never happen. What I would like to be able to do is pick a square on the board (right now with the mouse) and know which long I should be doing my bitwise operations on (there is a long for white pawns, another for white rooks, another for white knights, ect). Right now I just test all of the longs in my array with a bitmask to see if they intersect the square I have selected (with the mouse). It would be ideal not to test all of the longs in an array and just point to the right element somehow, help would be greatly appreciated.

EDIT: I put in comments to help and highlighted the code I was talking about in red.
1. boolean somethingSelected, wTurn;
2. long mSelect;
3. long[] pieces = new long[12];
4. PImage[] pieceImgs = new PImage[12];
6. void setup() {
7. size(801, 801);
8. stroke(128);
9. pieceImgs[0] = loadImage("WhitePawn.png");
10. pieceImgs[1] = loadImage("WhiteRook.png");
11. pieceImgs[2] = loadImage("WhiteKnight.png");
12. pieceImgs[3] = loadImage("WhiteBishop.png");
13. pieceImgs[4] = loadImage("WhiteQueen.png");
14. pieceImgs[5] = loadImage("WhiteKing.png");
15. pieceImgs[6] = loadImage("BlackPawn.png");
16. pieceImgs[7] = loadImage("BlackRook.png");
17. pieceImgs[8] = loadImage("BlackKnight.png");
18. pieceImgs[9] = loadImage("BlackBishop.png");
19. pieceImgs[10] = loadImage("BlackQueen.png");
20. pieceImgs[11] = loadImage("BlackKing.png");
21. initialize();
22. }
24. void draw() {
25. display();
26. }
28. void mousePressed() {
29. somethingSelected = false;
30. mSelect = 1L<<(7-mouseX/100+(7-mouseY/100)*8);
31. if (wTurn) { // If it is White's turn...
32. for (int i = 0; i < 6; i++) { // Test elements corresponding to White pieces
33. if ((mSelect&pieces[i]) != 0) {
34. somethingSelected = true;
35. break;
36. }
37. }
38. }
39. else { // If it is Black's turn...
40. for (int i = 6; i < 12; i++) { // Test elements corresponding to Black pieces
41. if ((mSelect&pieces[i]) != 0) {
42. somethingSelected = true;
43. break;
44. }
45. }
46. }
47. }
49. void mouseReleased() {
50. boolean execute = true;
51. if (mouseX <= 0 || mouseX >= width || mouseY <= 0 || mouseY >= height) execute = false;
52. if (execute) {
53. long newLoc = 1L<<(7-mouseX/100+(7-mouseY/100)*8);
54. if (wTurn) { // If it is White's turn...
55. for (int i = 0; i < 6; i++) { // Test elements corresponding to White pieces
56. if ((mSelect&pieces[i]) != 0) {
57. pieces[i] ^= mSelect;
58. pieces[i] |= newLoc;
59. wTurn = false;
60. break;
61. }
62. }
63. }
64. else { // If it is Black's turn...
65. for (int i = 6; i < 12; i++) { // Test elements corresponding to Black pieces
66. if ((mSelect&pieces[i]) != 0) {
67. pieces[i] ^= mSelect;
68. pieces[i] |= newLoc;
69. wTurn = true;
70. break;
71. }
72. }
73. }
74. }
75. somethingSelected = false;
76. }
78. void display() {
79. int mouseLoc = 7-mouseX/100+(7-mouseY/100)*8;
80. boolean showTargetLoc = true;
81. if (mouseX <= 0 || mouseX >= width || mouseY <= 0 || mouseY >= height) showTargetLoc = false;
82. for (int i = 0; i < 64; i++) {
83. int x = (7-i%8)*100;
84. int y = (7-i/8)*100;
85. if (somethingSelected && 1L<<i == mSelect) fill(128, 0, 0);
86. else if (somethingSelected && showTargetLoc && mouseLoc == i) fill(128, 0, 0);
87. else if ((i%2 == 0 && i/8%2 == 0) || (i%2 == 1 && i/8%2 == 1)) fill(204);
88. else fill(51);
89. rect(x, y, 100, 100);
90. long bitMask = 1L<<i;
91. for (int j = 0; j < 12; j++) {
92. if ((bitMask&pieces[j]) != 0) {
93. image(pieceImgs[j], x, y); // Show appropriate image for corresponding piece
94. break;
95. }
96. }
97. }
98. }
100. void initialize() {
101. wTurn = true;
102. pieces[0] = 0x000000000000ff00L; // White Pawns
103. pieces[1] = 0x0000000000000081L; // White Rooks
104. pieces[2] = 0x0000000000000042L; // White Knights
105. pieces[3] = 0x0000000000000024L; // White Bishops
106. pieces[4] = 0x0000000000000010L; // White Queens
107. pieces[5] = 0x0000000000000008L; // White King
108. pieces[6] = 0x00ff000000000000L; // Black Pawns
109. pieces[7] = 0x8100000000000000L; // Black Rooks
110. pieces[8] = 0x4200000000000000L; // Black Knights
111. pieces[9] = 0x2400000000000000L; // Black Bishops
112. pieces[10] = 0x1000000000000000L; // Black Queens
113. pieces[11] = 0x0800000000000000L; // Black King
114. }

beginShape and arc combination problem for 2D design

[6 Replies]
- 07-May-2012 12:38 AM
- Forum: Programming Questions
I'm trying to design a new chess set in Processing and I have run into a problem with the first piece (the knight). At the top of the knight there is an arc that goes around the knight's head and there are internal lines from the beginShape that I don't want inside that arc (I need to hide them somehow. The lines I'm talking about look like the left, top, and right of a box). I can't find an elegant way to hide these lines. Any help / suggestions would be appreciated.

On a different note, can anyone think of an easier way to design something that looks like this in Processing? This method is not exactly the easiest way to create 2D work.
1. boolean[] toggle = new boolean[8];
2. float unit = 800;
4. void setup() {
5. size((int)unit, (int)unit);
6. strokeWeight(3);
7. smooth();
8. toggle[2] = true;
9. //toggle[6] = true;
10. }
12. void draw() {
13. if (toggle[7]) {
14. background(64);
15. fill(255);
16. stroke(0);
17. }
18. else {
19. background(192);
20. fill(0);
21. stroke(255);
22. }
23. if (toggle[0]) pawn();
24. if (toggle[1]) rook();
25. if (toggle[2]) knight();
26. if (toggle[3]) bishop();
27. if (toggle[4]) queen();
28. if (toggle[5]) king();
29. if (toggle[6]) grid();
30. }
32. void pawn() {
33. }
35. void rook() {
36. }
38. void knight() {
39. arc(unit*0.5, unit*0.375, unit*0.75, unit*0.75, 3.93, 7.064);
40. if (toggle[7]) fill(64);
41. else fill(192);
42. arc(unit*0.5, unit*0.375, unit*0.625, unit*0.625, 3.927, 7.068);
43. if (toggle[7]) fill(255);
44. else fill(0);
45. beginShape();
46. vertex(unit*0.375, unit);
47. vertex(unit*0.375, unit*0.6875);
48. vertex(unit*0.4375, unit*0.625);
49. vertex(unit*0.375, unit*0.5625);
50. vertex(unit*0.375, unit*0.5);
51. vertex(unit*0.4375, unit*0.4375);
52. vertex(unit*0.5, unit*0.4375);
53. vertex(unit*0.5625, unit*0.375);
54. vertex(unit*0.5, unit*0.3125);
55. vertex(unit*0.4375, unit*0.375);
56. vertex(unit*0.25, unit*0.375);
57. vertex(unit*0.46875, unit*0.125);
58. vertex(unit*0.46875, unit*0.03125);
59. vertex(unit*0.53125, unit*0.03125);
60. vertex(unit*0.53125, unit*0.125);
61. vertex(unit*0.75, unit*0.375);
62. vertex(unit*0.5625, unit*0.625);
63. vertex(unit*0.625, unit*0.6875);
64. vertex(unit*0.625, unit);
65. endShape(CLOSE);
66. arc(unit*0.4375, unit*0.5, unit*0.125, unit*0.125, PI, PI+HALF_PI);
67. arc(unit*0.5, unit*0.375, unit*0.5, unit*0.5, PI, 4.59);
68. arc(unit*0.5, unit*0.375, unit*0.5, unit*0.5, 4.84, 7.5);
69. if (toggle[7]) fill(64);
70. else fill(192);
71. arc(unit*0.375, unit*0.625, unit*0.125, unit*0.125, PI+HALF_PI, TWO_PI+HALF_PI);
72. arc(unit*0.5, unit*0.375, unit*0.125, unit*0.125, PI, TWO_PI+HALF_PI);
73. arc(unit*0.625, unit*0.625, unit*0.125, unit*0.125, HALF_PI, PI+HALF_PI);
75. line(unit*0.625, unit*0.5625, unit*0.625, unit*0.591);
76. }
78. void bishop() {
79. }
81. void queen() {
82. }
84. void king() {
85. }
87. void grid() {
88. stroke(255, 0, 0);
89. int numAreas = 8;
90. for (int i = 1; i < numAreas; i++) {
91. line(unit/numAreas*i, 0, unit/numAreas*i, unit);
92. line(0, unit/numAreas*i, unit, unit/numAreas*i);
93. }
94. }
96. void keyPressed() {
97. if (key == '1') {
98. for (int i = 0; i < 6; i++) toggle[i] = false;
99. toggle[0] = true;
100. }
101. if (key == '2') {
102. for (int i = 0; i < 6; i++) toggle[i] = false;
103. toggle[1] = true;
104. }
105. if (key == '3') {
106. for (int i = 0; i < 6; i++) toggle[i] = false;
107. toggle[2] = true;
108. }
109. if (key == '4') {
110. for (int i = 0; i < 6; i++) toggle[i] = false;
111. toggle[3] = true;
112. }
113. if (key == '5') {
114. for (int i = 0; i < 6; i++) toggle[i] = false;
115. toggle[4] = true;
116. }
117. if (key == '6') {
118. for (int i = 0; i < 6; i++) toggle[i] = false;
119. toggle[5] = true;
120. }
121. if (key == '7') toggle[6] = !toggle[6];
122. if (key == '8') toggle[7] = !toggle[7];
123. }

Problem with long?

[2 Replies]
- 04-May-2012 07:04 PM
- Forum: Programming Questions
Sorry, this is probably a very dumb question, but I've never used long. The reference said that long uses 64 bits instead of int's 32. I tried this out:
1. long test = 0xfffffffff; // 9 fs
3. void setup() {
4. size(100, 100);
5. println(test);
6. }
and I got the error "The literal 0xfffffffff of type int is out of range". What am I doing wrong? Also, is there a way to print a long as 0s and 1s?

Activity Trend