Package ru.dubov.primitives

Examples of ru.dubov.primitives.Segment

131
132
133
134
135
136
137
138
139
140
141
142
            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);
        }
       
        c++;
       
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
        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
55
56
57
58
59
60
61
62
63
64
65
        }
        Collections.sort(points, PointsComparatorX);
       
        foundBoundaryCase = false; // Для учета возможных граничных случаев
       
        Segment pSegm; // временная переменная
       
        for (Point p : points) { // Проход по упорядоченному списку точек
           
            // (!) Задаем компаратору координату X, в которой идет сравнение
            segmentsComparator.setX(p.getX());
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
            pStart = new Point(evt.getX(), jPanel1.getHeight() - evt.getY());
            state = 1;
        } else if (state == 1) {
            pEnd = new Point(evt.getX(), jPanel1.getHeight() - evt.getY());
           
            segments.add(new Segment(pStart, pEnd));
            state = 0;
        }
       
        jPanel1.repaint();
    }//GEN-LAST:event_jPanel1MousePressed
View Full Code Here
TOP

Related Classes of ru.dubov.primitives.Segment

  • ru.dubov.anysegmentsintersect.MainFrame
  • ru.dubov.anysegmentsintersect.SegmentsIntersect
  • ru.dubov.anysegmentsintersect.test.SegmentsIntersectTest
  • ru.dubov.segmentsintersect.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.