Package ru.dubov.primitives

Examples of ru.dubov.primitives.Triangle

39
40
41
42
43
44
45
46
47
48
49
    public Triangle removeEar() {
       
        DoublyLinkedCyclicList<Point>.Node adjLeft = ears.head().value.prev;
        DoublyLinkedCyclicList<Point>.Node adjRight = ears.head().value.next;
       
        Triangle ear = new Triangle(adjLeft.value,
                ears.head().value.value, adjRight.value);     

        ears.head().value.delete(); // Delete in vertices
        ears.head().delete(); // Delete in ears
       
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
       
        if (! isConvex(node, isClockwise)) {
            return false;
        }
       
        Triangle tr = new Triangle(node.prev.value, node.value, node.next.value);
       
        DoublyLinkedCyclicList<Point>.Node cur = vertices.head();
        do {
            if (tr.pointInside(cur.value)) return false;
            cur = cur.next;
        } while(cur != vertices.head());
       
        return true;
    }
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
       
        if(p.size() < 3) {
            return;
        }
        if(p.size() == 3) {
            result.add(new Triangle(p.get(0), p.get(1), p.get(2)));
            return;
        }
       
        boolean diag = true;
        int start = 0, finish = 0;
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
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
       
        while (p.size() > 3) {
           
            int li = -1;
            Point l, v, r;
            Triangle tr;
            boolean isEar;
            int tryings = 0;
           
            do {
                tryings ++;
               
                if (tryings >= p.size()) {
                    // Endless loop; bad input
                    return null;
                }
               
                li ++;
                l = p.get(li % p.size());
                v = p.get((li+1) % p.size());
                r = p.get((li+2) % p.size());
                tr = new Triangle(l, v, r);
               
                isEar = Point.isLeftTurn(l, v, r) ^ isClockwise;
               
                if (isEar) { // Further analysis required
                    for (int i = 0; i < p.size(); i++) {
                        if (tr.pointInside(p.get(i))) {
                            isEar = false;
                            break;
                        }
                    }
                }
               
            } while(! isEar); // Until we've discovered an ear
           
            // Guaranteed that we got an ear here
           
            result.add(tr);
            p.remove((li+1) % p.size());
           
        }
       
        if (p.size() == 3) { // The last triangle
            result.add(new Triangle(p.get(0), p.get(1), p.get(2)));
        }
       
        return result;
    }
View Full Code Here
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
59
60
61
62
63
64
65
66
        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++) {
           
            if (i < points.size() - 1) {
               
                // Adding new "narrow" triangle with p0 as one of its vertices
                temp = new Triangle(p0, points.get(i), points.get(i+1));
               
                 // Linking the triangles (!)
                temp.link(lastAdded);
               
                result.add(temp);
                lastAdded = temp;
            }
           
            if (i > 0) {
               
                // using the idea of Graham's scan
                // to make the triangulation "convex" (!)
               
                top = S.peek();
                nextToTop = S.elementAt(S.size() - 2);
               
                while (isRightTurn(nextToTop, top, points.get(i))) {
                   
                    tempInStack = new Triangle(nextToTop, top, points.get(i));
                   
                    // Linking the triangles (!)
                    tempInStack.link(lastAddedInStack);
                    int k = 0;
                    for (int j = result.size()-1; j >= 0; j--) {
View Full Code Here
TOP

Related Classes of ru.dubov.primitives.Triangle

  • ru.dubov.delaunay.PointsTriangulation
  • ru.dubov.polygontriangulation.DivideAndConquerAlgorithm
  • ru.dubov.polygontriangulation.VanGoghAlgorithm
  • ru.dubov.polygontriangulation.VanGoghPolygon
    • 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.