Package processing.core

Examples of processing.core.PVector

135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
     
      bone.global_matrix = m;

      if (bone.getParent() != null && bone.getParent().global_matrix != null)
        m.preApply(bone.getParent().global_matrix);
      m.mult(new PVector(), bone.getAbsPosition());
     
      if (bone.getChildren().size() > 0)
      {
        for (BvhBone child : bone.getChildren())
        {
          update(child);
        }
      }
      else
      {
        m.translate(bone.getEndOffsetX(), bone.getEndOffsetY(), bone.getEndOffsetZ());
        m.mult(new PVector(), bone.getAbsEndPosition());
      }
  }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
     
      bone.global_matrix = m;

      if (bone.getParent() != null && bone.getParent().global_matrix != null)
        m.preApply(bone.getParent().global_matrix);
      m.mult(new PVector(), bone.getAbsPosition());
     
      if (bone.getChildren().size() > 0)
      {
        for (BvhBone child : bone.getChildren())
        {
          update(child);
        }
      }
      else
      {
        m.translate(bone.getEndOffsetX(), bone.getEndOffsetY(), bone.getEndOffsetZ());
        m.mult(new PVector(), bone.getAbsEndPosition());
      }
  }
View Full Code Here
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
    g.stroke(0);
    g.strokeWeight(2);//top curve weight
    g.beginShape();
      for(float a=(float)(float) (Math.PI+(Math.PI/2)) ; a >= (float) (Math.PI/2); a -=0.1f) {
          g.vertex((float)(Math.sin(a)*(r1/2))+0,(float)(Math.cos(a)*(r1/2))+0);
          points.add(new PVector(g.modelX((float)(Math.sin(a)*(r1/2))+0,(float)(Math.cos(a)*(r1/2))+0,0),
              g.modelY((float)(Math.sin(a)*(r1/2))+0,(float)(Math.cos(a)*(r1/2))+0,0),
              g.modelZ((float)(Math.sin(a)*(r1/2))+0,(float)(Math.cos(a)*(r1/2))+0,0)));
    }
    g.endShape();
   
   
    g.strokeWeight(1);
    g.stroke(255,0,0);
    //g.ellipse(0, 0, r1,r1);
    g.popMatrix();
   
   
   
   
    //bottom curve
    g.pushMatrix();
    g.translate(0, len/2.0f, 0);

     worldMatrix = new PMatrix3D();
    g.getMatrix(worldMatrix);
    //billboard matrix
    worldMatrix.m00 = matrixWorldScale;worldMatrix.m01 = 0;worldMatrix.m02 = 0;
    worldMatrix.m10 = 0;worldMatrix.m11 = matrixWorldScale;worldMatrix.m12 = 0;
    //worldMatrix.m20 = 0;worldMatrix.m21 = 0;worldMatrix.m22 = worldMatrix.m22;

    //g.printMatrix();
    g.setMatrix(worldMatrix);
    g.rotate(atan);

   
    g.noStroke();
    g.fill(228);
    g.beginShape();
      for(float a= (float)(Math.PI/2); a >= (float) -(Math.PI/2) ; a -=0.1f) {
          g.vertex((float)(Math.sin(a)*(r2/2))+0,(float)(Math.cos(a)*(r2/2))+0,-0.1f);
          points.add(new PVector(g.modelX((float)(Math.sin(a)*(r2/2))+0,(float)(Math.cos(a)*(r2/2))+0,0),
              g.modelY((float)(Math.sin(a)*(r2/2))+0,(float)(Math.cos(a)*(r2/2))+0,0),
              g.modelZ((float)(Math.sin(a)*(r2/2))+0,(float)(Math.cos(a)*(r2/2))+0,0)));
    }
      g.endShape();
   
    g.noFill();
    g.stroke(0);
    g.strokeWeight(2);
   
    g.beginShape();
      for(float a= (float)(Math.PI/2); a >= (float) -(Math.PI/2) ; a -=0.1f) {
          g.vertex((float)(Math.sin(a)*(r2/2))+0,(float)(Math.cos(a)*(r2/2))+0);
    }
      g.endShape();

    g.strokeWeight(1);
    g.stroke(255,0,0);
    //g.ellipse(0, 0, r2,r2);
   
    g.popMatrix(); 
    //g.endShape();
   
    g.pushMatrix();
    g.resetMatrix();
    //g.translate(-GLOBAL.windowWidth/2, -GLOBAL.windowHeight/2);
    g.translate(-GLOBAL.windowWidth/2, -GLOBAL.windowHeight/2);
    g.stroke(0);
    g.strokeWeight(3);
    g.fill(255);

    g.beginShape();
    for(int i = 0 ; i < points.size() ; i++){
      PVector p = (PVector)points.get(i);
      //g.vertex(p.x,p.y,p.z/matrixWorldScale);
    }
    g.endShape(PApplet.CLOSE);
    g.popMatrix();
    g.noStroke();
View Full Code Here
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
   */
  @Test
  public void test_collideHPolygon() {
    //More extensive testing in test_projectionVectorHPolygon
    //Triangle
    PVector pos1 = new PVector(0,0);
    ArrayList<PVector> points1 = new ArrayList<PVector>();
    points1.add(new PVector(0,0));
    points1.add(new PVector(10,0));
    points1.add(new PVector(0,10));
    HPolygon p1 = new HPolygon(pos1, points1);
   
    //Triangle will collide with first along hypotenuse
    PVector pos2 = new PVector(10,10);
    ArrayList<PVector> points2 = new ArrayList<PVector>();
    points2.add(new PVector(0,0));
    points2.add(new PVector(0,-10));
    points2.add(new PVector(-10,0));
    HPolygon p2 = new HPolygon(pos2, points2);
   
    //Triangle will collide with second at vertex
    PVector pos3 = new PVector(10,0);
    ArrayList<PVector> points3 = new ArrayList<PVector>();
    points3.add(new PVector(10,0));
    points3.add(new PVector(0,0));
    points3.add(new PVector(0,20));
    HPolygon p3 = new HPolygon(pos3, points3);
   
    //Square, will not collide with first or second
    PVector posNo = new PVector(20,20);
    ArrayList<PVector> pointsNo = new ArrayList<PVector>();
    pointsNo.add(new PVector(20,20));
    pointsNo.add(new PVector(0,0));
    pointsNo.add(new PVector(10,0));
    pointsNo.add(new PVector(30,20));
    HPolygon pNo = new HPolygon(posNo, pointsNo);
   
    //HPolygon p3 = new HPolygon(pos3, points3);
   
    assertTrue(p1.collide(p2));
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
   */
  @Test
  public void test_collideHRectangle() {
    //More extensive testing in test_projectionVectorHRectangle
    //Triangle
    PVector pos1 = new PVector(0,0);
    ArrayList<PVector> points1 = new ArrayList<PVector>();
    points1.add(new PVector(0,0));
    points1.add(new PVector(10,0));
    points1.add(new PVector(0,10));
    HPolygon p1 = new HPolygon(pos1, points1);
   
    //Will collide at vertex
    PVector pos2 = new PVector(10,0);
    PVector min1 = new PVector(0,0);
    PVector max1 = new PVector(10,10);
    HRectangle r1 = new HRectangle(pos2, min1, max1);
   
    //Will collide through hypotenuse
    PVector pos3 = new PVector(10,10);
    PVector min2 = new PVector(-5,-5);
    PVector max2 = new PVector(5,5);
    HRectangle r2 = new HRectangle(pos3, min2, max2);
   
    //Does not collide
    PVector pos4 = new PVector(10,10);
    PVector min3 = new PVector(0,0);
    PVector max3 = new PVector(20,20);
    HRectangle r3 = new HRectangle(pos4,min3,max3);
   
    assertTrue(p1.collide(r1));
    assertTrue(p1.collide(r2));
    assertFalse(p1.collide(r3));
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
 
  @Test
  public void test_collideHCircle() {
    //More extensive testing in test_projectionVectorHCircle
    //Triangle
    PVector pos1 = new PVector(0,0);
    ArrayList<PVector> points1 = new ArrayList<PVector>();
    points1.add(new PVector(0,0));
    points1.add(new PVector(10,0));
    points1.add(new PVector(0,10));
    HPolygon p1 = new HPolygon(pos1, points1);
   
    //HCircle that collides
    PVector pos2 = new PVector(10,10);
    HCircle c1 = new HCircle(pos2,8);
    assertTrue(p1.collide(c1));
   
    //HCircle that does not collide
    HCircle c2 = new HCircle(pos2,4);
    assertFalse(p1.collide(c2));
   
    //Other circles that collide
    PVector pos3 = new PVector(20,0);
    HCircle c3 = new HCircle(pos3,10);
    assertTrue(p1.collide(c3));
   
   
  }
View Full Code Here
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
  }
 
  @Test
  public void test_projectionVectorHPolygon() {
    //Triangle
    PVector pos1 = new PVector(0,0);
    ArrayList<PVector> points1 = new ArrayList<PVector>();
    points1.add(new PVector(0,0));
    points1.add(new PVector(10,0));
    points1.add(new PVector(0,10));
    HPolygon p1 = new HPolygon(pos1, points1);
   
    //Triangle will collide with first along hypotenuse
    PVector pos2 = new PVector(10,10);
    ArrayList<PVector> points2 = new ArrayList<PVector>();
    points2.add(new PVector(0,0));
    points2.add(new PVector(0,-10));
    points2.add(new PVector(-10,0));
    HPolygon p2 = new HPolygon(pos2, points2);
    //Test
    assertTrue(p1.collide(p2));
    PVector projectV1 = p1.projectionVector(p2);
    assertEquals(projectV1.x,0,1e-8);
    assertEquals(projectV1.y,0,1e-8);
   
    //Triangle will collide with second at vertex
    PVector pos3 = new PVector(10,0);
    ArrayList<PVector> points3 = new ArrayList<PVector>();
    points3.add(new PVector(10,0));
    points3.add(new PVector(0,0));
    points3.add(new PVector(0,20));
    HPolygon p3 = new HPolygon(pos3, points3);
    //Test
    PVector projectV2 = p1.projectionVector(p3);
    assertEquals(projectV2.x,0,1e-8);
    assertEquals(projectV2.y,0,1e-8);
   
    //Actual collision
    PVector pos4 = new PVector(5,-5);
    ArrayList<PVector> points4 = new ArrayList<PVector>();
    points4.add(new PVector(0,6));
    points4.add(new PVector(-2,5));
    points4.add(new PVector(-1,0));
    points4.add(new PVector(1,0));
    points4.add(new PVector(2,5));
    HPolygon p4 = new HPolygon(pos4, points4);
    //Test
    PVector projectV4 = p1.projectionVector(p4);
    assertEquals(projectV4.x,0,1e-8);
    assertEquals(projectV4.y,-1,1e-8);
   
    //Little quadrilateral within triangle
    PVector pos5 = new PVector(3,3);
    ArrayList<PVector> points5 = new ArrayList<PVector>();
    points5.add(new PVector(-1,-1));
    points5.add(new PVector(1,-1));
    points5.add(new PVector(1,1));
    points5.add(new PVector(-2,1));
    HPolygon p5 = new HPolygon(pos5, points5);
    //Test
    PVector projectV5 = p1.projectionVector(p5);
    assertEquals(projectV5.x,-4,1e-8);
    assertEquals(projectV5.y,0,1e-8);
   
    //Collision from "above"
    PVector pos6 = new PVector(5,10);
    ArrayList<PVector> points6 = new ArrayList<PVector>();
    points6.add(new PVector(-5,-5));
    points6.add(new PVector(-5,0));
    points6.add(new PVector(0,0));
    points6.add(new PVector(1,0));
    points6.add(new PVector(2,5));
    HPolygon p6 = new HPolygon(pos6, points6);
    //Test
    PVector projectV6 = p1.projectionVector(p6);
    assertEquals(projectV6.x,2.5,1e-8);
    assertEquals(projectV6.y,2.5,1e-8);
   
    //Collison with polygon at same exact location
    PVector projectSame = p1.projectionVector(p1);
    assertEquals(projectSame.x,-5,1e-8);
    assertEquals(projectSame.y,-5,1e-8);
   
    ////
    // Colliding rotated squares
    float radius = 25;
    ArrayList<PVector> pointsSquare = new ArrayList<PVector>();
    pointsSquare.add(new PVector(0,radius));
    pointsSquare.add(new PVector(radius,0));
    pointsSquare.add(new PVector(0,-radius));
    pointsSquare.add(new PVector(-radius,0));
   
    PVector pos90 = new PVector(0,0);
    HPolygon s1 = new HPolygon(pos90,pointsSquare);
   
    PVector pos7 = new PVector(50,0);
    HPolygon s2 = new HPolygon(pos7,pointsSquare);
    PVector projectS1 = s1.projectionVector(s2);
    assertEquals(projectS1.x,0,1e-8);
    assertEquals(projectS1.y,0,1e-8);
   
    PVector pos8 = new PVector(49,0);
    HPolygon s3 = new HPolygon(pos8,pointsSquare);
    PVector projectS2 = s1.projectionVector(s3);
    assertEquals(projectS2.x,0.5,1e-6);
    assertEquals(projectS2.y,-0.5,1e-6);
   
    PVector pos9 = new PVector(30,0);
    HPolygon s4 = new HPolygon(pos9,pointsSquare);
    PVector projectS3 = s1.projectionVector(s4);
    assertEquals(projectS3.x,10,1e-6);
    assertEquals(projectS3.y,-10,1e-6);
   
    PVector pos10 = new PVector(20,20);
    HPolygon s5 = new HPolygon(pos10,pointsSquare);
    PVector projectS4 = s1.projectionVector(s5);
    assertEquals(projectS4.x,5,1e-6);
    assertEquals(projectS4.y,5,1e-6);
   
    PVector pos11 = new PVector(51,0);
    HPolygon s6 = new HPolygon(pos11,pointsSquare);
    assertFalse(s1.collide(s6));
  }
View Full Code Here
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
  }
 
  @Test
  public void test_projectionVectorHRectangle() {
    //Triangle
    PVector pos1 = new PVector(0,0);
    ArrayList<PVector> points1 = new ArrayList<PVector>();
    points1.add(new PVector(0,0));
    points1.add(new PVector(10,0));
    points1.add(new PVector(0,10));
    HPolygon p1 = new HPolygon(pos1, points1);
   
    //Will collide at vertex
    PVector pos2 = new PVector(10,0);
    PVector min1 = new PVector(0,0);
    PVector max1 = new PVector(10,10);
    HRectangle r1 = new HRectangle(pos2, min1, max1);
    //Test
    PVector projectV1 = p1.projectionVector(r1);
    assertEquals(projectV1.x,0,1e-8);
    assertEquals(projectV1.y,0,1e-8);
   
    //Will collide at hypotenuse
    PVector pos3 = new PVector(10,10);
    PVector min2 = new PVector(-5,-5);
    PVector max2 = new PVector(5,5);
    HRectangle r2 = new HRectangle(pos3, min2, max2);
    //Test
    PVector projectV2 = p1.projectionVector(r2);
    assertEquals(projectV2.x,0,1e-8);
    assertEquals(projectV2.y,0,1e-8);
   
    //New displaced triangle
    PVector pos4 = new PVector(10,10);
    HPolygon p2 = new HPolygon(pos4,points1);
   
    //Overlaps at corner
    PVector pos5 = new PVector(5,5);
    PVector min3 = new PVector(-2,-2);
    PVector max3 = new PVector(6,6);
    HRectangle r3 = new HRectangle(pos5,min3,max3);
    //Test
    PVector projectV3 = p2.projectionVector(r3);
    assertEquals(projectV3.x,-1,1e-8);
    assertEquals(projectV3.y,0,1e-8);
  }
View Full Code Here
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
  }
 
  @Test
  public void test_projectionVectorHCircle() {
    //Triangle
    PVector pos1 = new PVector(0,0);
    ArrayList<PVector> points1 = new ArrayList<PVector>();
    points1.add(new PVector(0,0));
    points1.add(new PVector(10,0));
    points1.add(new PVector(0,10));
    HPolygon p1 = new HPolygon(pos1, points1);
   
    //HCircle that collides at hypotenuse
    PVector pos2 = new PVector(10,10);
    HCircle c1 = new HCircle(pos2,8);
    PVector projectV1 = p1.projectionVector(c1);
    float result = (float) 0.656854212284881;
    System.out.println(projectV1);
    assertEquals(projectV1.x,result,1e-8);
    assertEquals(projectV1.y,result,1e-8);
   
    //Collides at vertex
    PVector pos3 = new PVector(20,0);
    HCircle c2 = new HCircle(pos3,10);
    assertTrue(p1.collide(c2));
    PVector projectV2 = p1.projectionVector(c2);
    assertEquals(projectV2.x,0,1e-8);
    assertEquals(projectV2.y,0,1e-8);
   
    //Is located just inside triangle
    PVector pos4 = new PVector(1,1);
    HCircle c3 = new HCircle(pos4, 5);
    assertTrue(p1.collide(c3));
    PVector projectV3 = p1.projectionVector(c3);
    assertEquals(projectV3.x,-6,1e-8);
    assertEquals(projectV3.y,0,1e-8);
   
    //Is inside triangle
    PVector posIn = new PVector(3,3);
    HCircle cIn = new HCircle(posIn, 1);
    assertTrue(p1.collide(cIn));
    PVector projectVIn = p1.projectionVector(cIn);
    float res = (float)(5-(3-Math.sqrt(2)/2));
    assertEquals(projectVIn.x,res,1e-8);
    assertEquals(projectVIn.y,res,1e-8);
   
    //Into hypotenuse
    PVector pos5 = new PVector(20,1);
    HCircle c4 = new HCircle(pos5,12);
    PVector projectV4 = p1.projectionVector(c4);
    PVector result4 = new PVector(10,1);
    result4.normalize();
    result4.mult((float)(12-Math.sqrt(101)));
    assertEquals(projectV4.x,result4.x,1e-6);
    assertEquals(projectV4.y,result4.y,1e-6);
   
    //Test with polygon that is not at (0,0) but rather (10,10)
    ArrayList<PVector> points2 = new ArrayList<PVector>();
    points2.add(new PVector(0,0));
    points2.add(new PVector(10,0));
    points2.add(new PVector(0,10));
    HPolygon p2 = new HPolygon(pos2, points2);
   
    //Collides behind HPolygon 2
    PVector pos6 = new PVector(0,10);
    HCircle c5 = new HCircle(pos6,11);
    PVector projectV5 = p2.projectionVector(c5);
    assertEquals(projectV5.x,-1,1e-8);
    assertEquals(projectV5.y,0,1e-8);
   
    ////
    // Colliding rotated squares
    float radius = 25;
    ArrayList<PVector> pointsSquare = new ArrayList<PVector>();
    pointsSquare.add(new PVector(0,radius));
    pointsSquare.add(new PVector(radius,0));
    pointsSquare.add(new PVector(0,-radius));
    pointsSquare.add(new PVector(-radius,0));
   
    PVector pos7 = new PVector(0,0);
    HPolygon s1 = new HPolygon(pos7,pointsSquare);
   
    PVector pos8 = new PVector(30,0);
    HCircle c6 = new HCircle(pos8,5);
    PVector projectS1 = s1.projectionVector(c6);
    assertEquals(projectS1.x,0,1e-8);
    assertEquals(projectS1.y,0,1e-8);
   
    PVector pos9 = new PVector(31,0);
    HCircle c7 = new HCircle(pos9,5);
    assertFalse(s1.collide(c7));
  }
View Full Code Here
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
  }
 
  @Test
  public void test_contains() {
    //Triangle
    PVector pos1 = new PVector(0,0);
    ArrayList<PVector> points1 = new ArrayList<PVector>();
    points1.add(new PVector(0,0));
    points1.add(new PVector(10,0));
    points1.add(new PVector(0,10));
    HPolygon p1 = new HPolygon(pos1, points1);
   
    //Contains own corner?
    assertTrue(p1.contains(new PVector(10,0,0)));
    //Contains inside
    assertTrue(p1.contains(3,3));
    //Does not contain
    assertFalse(p1.contains(10,10));
  }
View Full Code Here
TOP

Related Classes of processing.core.PVector

  • cc.sketchchair.functions.functions
  • com.onformative.leap.LeapMotionP5
  • com.rhizomatiks.bvh.BvhParser
  • de.fhpotsdam.unfolding.events.ZoomMapEvent
  • de.fhpotsdam.unfolding.examples.misc.RotatableMapApp
  • de.fhpotsdam.unfolding.examples.overviewdetail.connection.ConvexHull
  • de.fhpotsdam.unfolding.examples.threed.AnimatedParticle
  • de.fhpotsdam.unfolding.examples.threed.ArcsBezierMap3DApp
  • de.fhpotsdam.unfolding.examples.threed.Map3DApp
  • de.fhpotsdam.unfolding.geo.AbstractProjection
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.