Package ru.dubov.primitives

Examples of ru.dubov.primitives.Point

51
52
53
54
55
56
57
58
59
60
61
        boolean isClockwise = p.isClockwise();
       
        while (p.size() > 3) {
           
            int li = -1;
            Point l, v, r;
            Triangle tr;
            boolean isEar;
            int tryings = 0;
           
            do {
View Full Code Here
263
264
265
266
267
268
269
270
271
272
273
        jPanel1.repaint();
    }//GEN-LAST:event_jButton4ActionPerformed

    private void jPanel1MousePressed(java.awt.event.MouseEvent evt) {//GEN-FIRST:event_jPanel1MousePressed
        if (state == 0) {
            Point pi = new Point(evt.getX(), jPanel1.getHeight() - evt.getY());
            polygon.add(pi);
           
            tempPolygon.remove(tempPolygon.size() - 1);
            tempPolygon.add(pi);
            tempPolygon.add(pi);
View Full Code Here
296
297
298
299
300
301
302
303
304
305
306
    }//GEN-LAST:event_jButton6ActionPerformed

    private void jPanel1MouseMoved(java.awt.event.MouseEvent evt) {//GEN-FIRST:event_jPanel1MouseMoved
       
        if (state == 0) {
            Point pi = new Point(evt.getX(), jPanel1.getHeight() - evt.getY());
            tempPolygon.remove(tempPolygon.size() - 1);
            tempPolygon.add(pi);
        }
       
        jPanel1.repaint();
View Full Code Here
316
317
318
319
320
321
322
323
324
325
326
    }//GEN-LAST:event_jPanel1MouseExited

    private void jPanel1MouseEntered(java.awt.event.MouseEvent evt) {//GEN-FIRST:event_jPanel1MouseEntered
       
        if (state == 0) {
            Point pi = new Point(evt.getX(), jPanel1.getHeight() - evt.getY());
            tempPolygon.add(pi);
        }
       
        jPanel1.repaint();
    }//GEN-LAST:event_jPanel1MouseEntered
View Full Code Here
28
29
30
31
32
33
34
35
36
37
38
39
40
41
                pk.getY() <= Math.max(pi.getY(), pj.getY()));
    }
   
    public static boolean two(Segment s1, Segment s2) {
       
        Point p1 = s1.getLeft();
        Point p2 = s1.getRight();
        Point p3 = s2.getLeft();
        Point p4 = s2.getRight();
       
        double d1 = direction(p3, p4, p1);
        double d2 = direction(p3, p4, p2);
        double d3 = direction(p1, p2, p3);
        double d4 = direction(p1, p2, p4);
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
    private void jPanel1MousePressed(java.awt.event.MouseEvent evt) {//GEN-FIRST:event_jPanel1MousePressed
             
        if (c == 4) c = 0;
       
        if (c == 0) {
            p1 = new Point(evt.getX(), evt.getY());
        } else if (c == 1) {
            p2 = new Point(evt.getX(), evt.getY());
        } else if (c == 2) {
            p3 = new Point(evt.getX(), evt.getY());
        } else if (c == 3) {
            p4 = new Point(evt.getX(), evt.getY());
            Segment s1 = new Segment(p1, p2);
            Segment s2 = new Segment(p3, p4);
            intersection = SegmentsIntersect.two(s1, s2);
        }
       
View Full Code Here
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
       
        // Test case 1
       
        segments = new ArrayList<Segment>();
       
        segments.add(new Segment(new Point(0, 0), new Point(1, 0)));
        segments.add(new Segment(new Point(2, 0), new Point(3, 0)));
        segments.add(new Segment(new Point(4, 0), new Point(5, 0)));
        segments.add(new Segment(new Point(4.3, 1), new Point(4.7, -1)));
        segments.add(new Segment(new Point(6, 0), new Point(7, 0)));
       
        assertTrue(SegmentsIntersect.any(segments));
       
        // Test case 2
       
        segments = new ArrayList<Segment>();
       
        segments.add(new Segment(new Point(0, 0), new Point(1, 0)));
        segments.add(new Segment(new Point(2, 0), new Point(3, 0)));
        segments.add(new Segment(new Point(4, 0), new Point(5, 0)));
       
        assertTrue(! SegmentsIntersect.any(segments));
    }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
       
        // Test case 1
       
        segments = new ArrayList<Segment>();
       
        segments.add(new Segment(new Point(0, 0), new Point(2, 1)));
        segments.add(new Segment(new Point(2, 1), new Point(3, 0)));
        segments.add(new Segment(new Point(4, 0), new Point(5, 0)));
       
        assertTrue(SegmentsIntersect.any(segments));
       
        // Test case 2
       
        segments = new ArrayList<Segment>();
       
        segments.add(new Segment(new Point(0, 0), new Point(2, 1)));
        segments.add(new Segment(new Point(2, 2), new Point(3, 0)));
        segments.add(new Segment(new Point(2, 2), new Point(5, 0)));
       
        assertTrue(SegmentsIntersect.any(segments));
    }
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
80
        for (int repeat = 0; repeat < 1000; repeat++) {
            for (int i = 2; i <= 20; i++) {
                ArrayList<Segment> segments = new ArrayList<Segment>();

                for(int j = 0; j < i; j++) {
                    segments.add(new Segment(new Point(rand.nextDouble()*100, rand.nextDouble()*100),
                                             new Point(rand.nextDouble()*100, rand.nextDouble()*100)));
                }

                assertTrue(SegmentsIntersect.any(segments) ==
                            SegmentsIntersect.any_Naive(segments));
            }
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
     *
     * @return Triangulation
     */
    public static ArrayList<Triangle> some(List<Point> points) {
       
        Point p0 = getLowestPoint(points);
        points.remove(p0);
       
        Collections.sort(points, new PointComparator(p0));
       
        ArrayList<Triangle> result = new ArrayList<Triangle>();
       
        Stack<Point> S = new Stack<Point>();
        S.push(p0);
        S.push(points.get(0));
       
        Point top, nextToTop;
        Triangle lastAdded = null, temp = null,
                 lastAddedInStack = null, tempInStack = null;
       
        for (int i = 0; i < points.size(); i++) {
           
View Full Code Here
TOP

Related Classes of ru.dubov.primitives.Point

  • ru.dubov.anysegmentsintersect.MainFrame
  • ru.dubov.anysegmentsintersect.SegmentsIntersect
  • ru.dubov.anysegmentsintersect.test.SegmentsIntersectTest
  • ru.dubov.closestpair.ClosestPair
  • ru.dubov.closestpair.MainFrame
  • ru.dubov.closestpair.test.ClosestPairTest
  • ru.dubov.convexhull.ConvexHull
  • ru.dubov.convexhull.MainFrame
  • ru.dubov.convexhull.test.ConvexHullTest
  • ru.dubov.delaunay.MainFrame
    • 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.