Package lt.refactory.primsAlgo.service.algorithm.models

Examples of lt.refactory.primsAlgo.service.algorithm.models.Circle

121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
    try {
      Graph<WeightedEdge> firstEquilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(firstTriangle);
      Graph<WeightedEdge> secondEquilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(secondTriangle);
      Graph<WeightedEdge> thirdEquilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(thirdTriangle);
     
      Circle firstCircle = SteinersAlgorithm.getCircumscribedCircle(firstEquilateralTriangle);
      Circle secondCircle = SteinersAlgorithm.getCircumscribedCircle(secondEquilateralTriangle);
      Circle thirdCircle = SteinersAlgorithm.getCircumscribedCircle(thirdEquilateralTriangle);
     
      // test if circles got any radius
      assertTrue(firstCircle.getRadius().compareTo(BigDecimal.ZERO) == 1);
      assertTrue(secondCircle.getRadius().compareTo(BigDecimal.ZERO) == 1);
      assertTrue(thirdCircle.getRadius().compareTo(BigDecimal.ZERO) == 1);
     
      // test what values should be aproximately
      assertTrue(firstCircle.getCenterPoint().getPointX().compareTo(BigDecimal.ZERO) == -1);
      assertTrue(firstCircle.getCenterPoint().getPointY().compareTo(BigDecimal.valueOf(2)) == 0);
     
      assertTrue(secondCircle.getCenterPoint().getPointX().compareTo(BigDecimal.ONE) == 1);
      assertTrue(secondCircle.getCenterPoint().getPointY().compareTo(BigDecimal.valueOf(2)) == 1);
     
      assertTrue(thirdCircle.getCenterPoint().getPointX().compareTo(BigDecimal.valueOf(1.5)) == 0);
      assertTrue(thirdCircle.getCenterPoint().getPointY().compareTo(BigDecimal.ZERO) == -1);
     
    } catch (AddEdgeException e) {
      fail("Add edge exception thrown");
    }
  }
View Full Code Here
188
189
190
191
192
193
194
195
196
197
198
199
200
     
      Graph<WeightedEdge> firstEquilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(firstTriangle);
      Graph<WeightedEdge> secondEquilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(secondTriangle);
      Graph<WeightedEdge> thirdEquilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(thirdTriangle);
     
      Circle firstCircle = SteinersAlgorithm.getCircumscribedCircle(firstEquilateralTriangle);
      Circle secondCircle = SteinersAlgorithm.getCircumscribedCircle(secondEquilateralTriangle);
      Circle thirdCircle = SteinersAlgorithm.getCircumscribedCircle(thirdEquilateralTriangle);
     
      WeightedEdge firstEdge = SteinersAlgorithm.getEdgeThroughTriangles(firstTriangle, firstEquilateralTriangle);
      WeightedEdge secondEdge = SteinersAlgorithm.getEdgeThroughTriangles(secondTriangle, secondEquilateralTriangle);
      WeightedEdge thirdEdge = SteinersAlgorithm.getEdgeThroughTriangles(thirdTriangle, thirdEquilateralTriangle);
     
View Full Code Here
226
227
228
229
230
231
232
233
234
235
236
      WeightedEdge edge = firstTriangle.getEdgeList().get(0);
      WeightedEdge nearEdge = firstTriangle.getEdgeList().get(1);
     
      Graph<WeightedEdge> firstEquilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(firstTriangle);
     
      Circle firstCircle = SteinersAlgorithm.getCircumscribedCircle(firstEquilateralTriangle);
     
      WeightedEdge firstEdge = SteinersAlgorithm.getEdgeThroughTriangles(firstTriangle, firstEquilateralTriangle);
     
      Node firstPoint = SteinersAlgorithm.getSteinersPoint(firstEdge, firstCircle);
     
View Full Code Here
94
95
96
97
98
99
100
101
102
103
104
       
        if (angleBetweenEdges.compareTo(BigDecimal.valueOf(120)) == -1) {
          // Torichelli procedure for steiners point:
          Graph<WeightedEdge> triangle = SteinersAlgorithm.getTriangleWithWeights(leave, nearEdge);
          Graph<WeightedEdge> equilateralTriangle = SteinersAlgorithm.getEquilateralTriangle(triangle);
          Circle circumscribedCircle = SteinersAlgorithm.getCircumscribedCircle(equilateralTriangle);
          WeightedEdge edgeThroughTriangles = SteinersAlgorithm.getEdgeThroughTriangles(triangle, equilateralTriangle);
          Node steinersPoint = SteinersAlgorithm.getSteinersPoint(edgeThroughTriangles, circumscribedCircle);
         
          if (steinersPoint != null) {
            // Calculate how much graph is shorter than initial graph
View Full Code Here
244
245
246
247
248
249
250
      centerY = firstEdgeParameters.getK()
          .multiply(centerX)
          .add(firstEdgeParameters.getB());
    }
   
    return new Circle(new Node(centerX, centerY), radius);
  }
View Full Code Here
TOP

Related Classes of lt.refactory.primsAlgo.service.algorithm.models.Circle

  • lt.refactory.primsAlgo.algorithm.test.SteinersAlgorithmTest
  • lt.refactory.primsAlgo.service.algorithm.SteinersAlgorithm
  • lt.refactory.primsAlgo.service.PrimsController
    • 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.