/dports/devel/boost-docs/boost_1_72_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 58 edge1.color(13); in voronoi_edge_test() 77 edge1.twin(&edge2); in voronoi_edge_test() 78 edge2.twin(&edge1); in voronoi_edge_test() 82 edge1.next(&edge2); in voronoi_edge_test() 83 edge1.prev(&edge2); in voronoi_edge_test() 84 edge2.next(&edge1); in voronoi_edge_test() 85 edge2.prev(&edge1); in voronoi_edge_test() 88 BOOST_TEST(edge1.rot_next() == &edge1); in voronoi_edge_test() 89 BOOST_TEST(edge1.rot_prev() == &edge1); in voronoi_edge_test() 92 edge1.cell(&cell); in voronoi_edge_test() [all …]
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 58 edge1.color(13); in voronoi_edge_test() 77 edge1.twin(&edge2); in voronoi_edge_test() 78 edge2.twin(&edge1); in voronoi_edge_test() 82 edge1.next(&edge2); in voronoi_edge_test() 83 edge1.prev(&edge2); in voronoi_edge_test() 84 edge2.next(&edge1); in voronoi_edge_test() 85 edge2.prev(&edge1); in voronoi_edge_test() 88 BOOST_TEST(edge1.rot_next() == &edge1); in voronoi_edge_test() 89 BOOST_TEST(edge1.rot_prev() == &edge1); in voronoi_edge_test() 92 edge1.cell(&cell); in voronoi_edge_test() [all …]
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 56 edge1.color(13); in BOOST_AUTO_TEST_CASE() 75 edge1.twin(&edge2); in BOOST_AUTO_TEST_CASE() 76 edge2.twin(&edge1); in BOOST_AUTO_TEST_CASE() 80 edge1.next(&edge2); in BOOST_AUTO_TEST_CASE() 81 edge1.prev(&edge2); in BOOST_AUTO_TEST_CASE() 82 edge2.next(&edge1); in BOOST_AUTO_TEST_CASE() 83 edge2.prev(&edge1); in BOOST_AUTO_TEST_CASE() 86 BOOST_CHECK(edge1.rot_next() == &edge1); in BOOST_AUTO_TEST_CASE() 87 BOOST_CHECK(edge1.rot_prev() == &edge1); in BOOST_AUTO_TEST_CASE() 90 edge1.cell(&cell); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 56 edge1.color(13); in BOOST_AUTO_TEST_CASE() 75 edge1.twin(&edge2); in BOOST_AUTO_TEST_CASE() 76 edge2.twin(&edge1); in BOOST_AUTO_TEST_CASE() 80 edge1.next(&edge2); in BOOST_AUTO_TEST_CASE() 81 edge1.prev(&edge2); in BOOST_AUTO_TEST_CASE() 82 edge2.next(&edge1); in BOOST_AUTO_TEST_CASE() 83 edge2.prev(&edge1); in BOOST_AUTO_TEST_CASE() 86 BOOST_CHECK(edge1.rot_next() == &edge1); in BOOST_AUTO_TEST_CASE() 87 BOOST_CHECK(edge1.rot_prev() == &edge1); in BOOST_AUTO_TEST_CASE() 90 edge1.cell(&cell); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/databases/percona57-server/boost_1_59_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 56 edge1.color(13); in BOOST_AUTO_TEST_CASE() 75 edge1.twin(&edge2); in BOOST_AUTO_TEST_CASE() 76 edge2.twin(&edge1); in BOOST_AUTO_TEST_CASE() 80 edge1.next(&edge2); in BOOST_AUTO_TEST_CASE() 81 edge1.prev(&edge2); in BOOST_AUTO_TEST_CASE() 82 edge2.next(&edge1); in BOOST_AUTO_TEST_CASE() 83 edge2.prev(&edge1); in BOOST_AUTO_TEST_CASE() 86 BOOST_CHECK(edge1.rot_next() == &edge1); in BOOST_AUTO_TEST_CASE() 87 BOOST_CHECK(edge1.rot_prev() == &edge1); in BOOST_AUTO_TEST_CASE() 90 edge1.cell(&cell); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/databases/xtrabackup/boost_1_59_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 56 edge1.color(13); in BOOST_AUTO_TEST_CASE() 75 edge1.twin(&edge2); in BOOST_AUTO_TEST_CASE() 76 edge2.twin(&edge1); in BOOST_AUTO_TEST_CASE() 80 edge1.next(&edge2); in BOOST_AUTO_TEST_CASE() 81 edge1.prev(&edge2); in BOOST_AUTO_TEST_CASE() 82 edge2.next(&edge1); in BOOST_AUTO_TEST_CASE() 83 edge2.prev(&edge1); in BOOST_AUTO_TEST_CASE() 86 BOOST_CHECK(edge1.rot_next() == &edge1); in BOOST_AUTO_TEST_CASE() 87 BOOST_CHECK(edge1.rot_prev() == &edge1); in BOOST_AUTO_TEST_CASE() 90 edge1.cell(&cell); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/databases/percona57-client/boost_1_59_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 56 edge1.color(13); in BOOST_AUTO_TEST_CASE() 75 edge1.twin(&edge2); in BOOST_AUTO_TEST_CASE() 76 edge2.twin(&edge1); in BOOST_AUTO_TEST_CASE() 80 edge1.next(&edge2); in BOOST_AUTO_TEST_CASE() 81 edge1.prev(&edge2); in BOOST_AUTO_TEST_CASE() 82 edge2.next(&edge1); in BOOST_AUTO_TEST_CASE() 83 edge2.prev(&edge1); in BOOST_AUTO_TEST_CASE() 86 BOOST_CHECK(edge1.rot_next() == &edge1); in BOOST_AUTO_TEST_CASE() 87 BOOST_CHECK(edge1.rot_prev() == &edge1); in BOOST_AUTO_TEST_CASE() 90 edge1.cell(&cell); in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/devel/boost-libs/boost_1_72_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 58 edge1.color(13); in voronoi_edge_test() 77 edge1.twin(&edge2); in voronoi_edge_test() 78 edge2.twin(&edge1); in voronoi_edge_test() 82 edge1.next(&edge2); in voronoi_edge_test() 83 edge1.prev(&edge2); in voronoi_edge_test() 84 edge2.next(&edge1); in voronoi_edge_test() 85 edge2.prev(&edge1); in voronoi_edge_test() 88 BOOST_TEST(edge1.rot_next() == &edge1); in voronoi_edge_test() 89 BOOST_TEST(edge1.rot_prev() == &edge1); in voronoi_edge_test() 92 edge1.cell(&cell); in voronoi_edge_test() [all …]
|
/dports/devel/hyperscan/boost_1_75_0/libs/polygon/test/ |
H A D | voronoi_diagram_test.cpp | 58 edge1.color(13); in voronoi_edge_test() 77 edge1.twin(&edge2); in voronoi_edge_test() 78 edge2.twin(&edge1); in voronoi_edge_test() 82 edge1.next(&edge2); in voronoi_edge_test() 83 edge1.prev(&edge2); in voronoi_edge_test() 84 edge2.next(&edge1); in voronoi_edge_test() 85 edge2.prev(&edge1); in voronoi_edge_test() 88 BOOST_TEST(edge1.rot_next() == &edge1); in voronoi_edge_test() 89 BOOST_TEST(edge1.rot_prev() == &edge1); in voronoi_edge_test() 92 edge1.cell(&cell); in voronoi_edge_test() [all …]
|
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BASE/ |
H A D | EdgeTestSuite.h | 37 gum::Edge edge1(1, 2); in testConstructor2() 42 gum::Edge edge1(1, 2); in testEquality() 44 gum::Edge copy(edge1); in testEquality() 47 TS_ASSERT_EQUALS(edge1, edge1) in testEquality() 48 TS_ASSERT_EQUALS(edge1, edge2) in testEquality() 49 TS_ASSERT_EQUALS(edge2, edge1) in testEquality() 50 TS_ASSERT_EQUALS(copy, edge1) in testEquality() 53 TS_ASSERT_DIFFERS(edge1, edge3) in testEquality() 54 TS_ASSERT_DIFFERS(edge3, edge1) in testEquality() 64 gum::Edge copy(edge1); in testGetters() [all …]
|
/dports/graphics/wings/libigl-2.1.0/include/igl/ |
H A D | raytri.c | 38 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle() 45 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle() 60 IGL_RAY_TRI_CROSS(qvec, tvec, edge1); in intersect_triangle() 84 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle1() 91 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle1() 104 IGL_RAY_TRI_CROSS(qvec, tvec, edge1); in intersect_triangle1() 155 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle2() 162 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle2() 220 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle3() 227 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle3() [all …]
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/ |
H A D | raytri.c | 38 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle() 45 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle() 60 IGL_RAY_TRI_CROSS(qvec, tvec, edge1); in intersect_triangle() 84 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle1() 91 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle1() 104 IGL_RAY_TRI_CROSS(qvec, tvec, edge1); in intersect_triangle1() 155 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle2() 162 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle2() 220 IGL_RAY_TRI_SUB(edge1, vert1, vert0); in intersect_triangle3() 227 det = IGL_RAY_TRI_DOT(edge1, pvec); in intersect_triangle3() [all …]
|
/dports/devel/cmph/cmph-2.0/cxxmph/ |
H A D | trigraph.cc | 53 uint32_t edge1 = first_edge_[vertex]; in RemoveEdge() local 56 while (edge1 != current_edge && edge1 != kInvalidEdge) { in RemoveEdge() 57 edge2 = edge1; in RemoveEdge() 58 if (edges_[edge1][0] == vertex) j = 0; in RemoveEdge() 59 else if (edges_[edge1][1] == vertex) j = 1; in RemoveEdge() 61 edge1 = next_edge_[edge1][j]; in RemoveEdge() 63 assert(edge1 != kInvalidEdge); in RemoveEdge() 64 if (edge2 != kInvalidEdge) next_edge_[edge2][j] = next_edge_[edge1][i]; in RemoveEdge() 65 else first_edge_[vertex] = next_edge_[edge1][i]; in RemoveEdge()
|
/dports/math/symphony/SYMPHONY-releases-5.6.17/SYMPHONY/Applications/CNRP/src/CutGen/ |
H A D | cnrp_cg.c | 228 edge *edge1; local 290 ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1); 304 real_demand = edge1->v0 ? demand[edge1->v0] : 0; 314 if ((capacity-demand[edge1->v1])*edge1->weight2<edge1->flow2-etol){ 331 if (flow_cap*edge1->weight < edge1->flow1 + edge1->flow2 - etol){ 335 ((int *)new_cut->coef)[0] = INDEX(edge1->v0, edge1->v1); 362 if (flow_value < edge1->weight1*demand[edge1->v1]){ 375 real_demand = edge1->v0 ? demand[edge1->v0] : 0; 411 if (flow_value < edge1->weight*demand[edge1->v1]){ 415 if (flow_value > edge1->weight*demand[edge1->v1] + etol){ [all …]
|
/dports/devel/upp/upp/uppsrc/plugin/box2d/ |
H A D | b2CollidePolygon.cpp | 33 b2Assert(0 <= edge1 && edge1 < count1); in b2EdgeSeparation() 36 b2Vec2 normal1World = b2Mul(xf1.R, normals1[edge1]); in b2EdgeSeparation() 53 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in b2EdgeSeparation() 153 b2Assert(0 <= edge1 && edge1 < count1); in b2FindIncidentEdge() 176 c[0].id.features.referenceEdge = (uint8)edge1; in b2FindIncidentEdge() 181 c[1].id.features.referenceEdge = (uint8)edge1; in b2FindIncidentEdge() 213 int32 edge1; // reference edge in b2CollidePolygons() local 224 edge1 = edgeB; in b2CollidePolygons() 234 edge1 = edgeA; in b2CollidePolygons() 245 b2Vec2 v11 = vertices1[edge1]; in b2CollidePolygons() [all …]
|
/dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/geom2d/ |
H A D | intersectEdges.m | 83 N1 = size(edge1, 1); 89 edge1 = repmat(edge1, [N2 1]); variable 105 par = isParallel(edge1(:,3:4)-edge1(:,1:2), edge2(:,3:4)-edge2(:,1:2)); 109 col = abs( (edge2(:,1)-edge1(:,1)) .* (edge1(:,4)-edge1(:,2)) - ... 110 (edge2(:,2)-edge1(:,2)) .* (edge1(:,3)-edge1(:,1)) ) < tol & par; 146 x0(touch) = edge1(touch, 1); 147 y0(touch) = edge1(touch, 2); 164 x1 = edge1(i,1); 165 y1 = edge1(i,2); 166 dx1 = edge1(i,3) - x1; [all …]
|
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed.shaders/include/appleseed/pattern/ |
H A D | as_pattern_helpers.h | 81 float edge1, in filtered_smoothstep() argument 90 float edgediff = edge1 - edge0; in filtered_smoothstep() 112 float edge1, in filtered_pulse() argument 119 return max(0, (min(x1, edge1) - max(x0, edge0)) / dx); in filtered_pulse() 124 float edge1, in filtered_smoothpulse() argument 131 filtered_smoothstep(edge0, edge1, x, dx) - in filtered_smoothpulse() 171 float smootherstep(float edge0, float edge1, float x) in smootherstep() argument 173 float tmp = clamp((x - edge0) / (edge1 - edge0), 0.0, 1.0); in smootherstep() 177 float smootheststep(float edge0, float edge1, float x) in smootheststep() argument 179 float tmp = clamp((x - edge0) / (edge1 - edge0), 0.0, 1.0); in smootheststep()
|
/dports/graphics/tachyon/tachyon/src/ |
H A D | triangle.c | 47 vector edge1, edge2, edge3; in newtri() local 49 VSub(&v1, &v0, &edge1); in newtri() 65 t->edge1 = edge1; in newtri() 78 vector edge1, edge2, edge3; in newstri() local 80 VSub(&v1, &v0, &edge1); in newstri() 96 t->edge1 = edge1; in newstri() 136 vector edge1, edge2, edge3; in newvcstri() local 139 VSub(&v1, &v0, &edge1); in newvcstri() 154 t->edge1 = edge1; in newvcstri() 324 CROSS(tmp, trn->edge1, P); in stri_normal() [all …]
|
/dports/net/mpich2/mpich2-1.5/src/mpe2/src/slog2sdk/src/viewer/legends/ |
H A D | Triangular3DIcon.java | 18 private Color edge1; field in Triangular3DIcon 56 public Triangular3DIcon( Color edge1, Color edge2, Color fill, in Triangular3DIcon() argument 59 init( edge1, edge2, fill, size, direction ); in Triangular3DIcon() 84 private void init( Color edge1, Color edge2, Color fill, in init() argument 87 this.edge1 = edge1; in init() 96 g.setColor( edge1 ); in drawDownTriangle() 105 g.setColor( edge1 ); in drawDownTriangle() 120 g.setColor( edge1 ); in drawDownTriangle() 126 g.setColor( edge1 ); in drawUpTriangle() 133 g.setColor( edge1 ); in drawUpTriangle() [all …]
|
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/examples/parallel_for/tachyon/src/ |
H A D | triangle.cpp | 76 vector edge1, edge2, edge3; in newtri() local 78 VSub(&v1, &v0, &edge1); in newtri() 83 if ((VLength(&edge1) >= EPSILON) && in newtri() 94 t->edge1 = edge1; in newtri() 107 vector edge1, edge2, edge3; in newstri() local 109 VSub(&v1, &v0, &edge1); in newstri() 125 t->edge1 = edge1; in newstri() 153 VAdd(&t->v0, &t->edge1, &v1); in tri_bbox() 175 det = DOT(trn->edge1, pvec); in tri_intersect() 191 CROSS(qvec, tvec, trn->edge1); in tri_intersect() [all …]
|
/dports/devel/tbb/oneTBB-2020.3/examples/parallel_for/tachyon/src/ |
H A D | triangle.cpp | 76 vector edge1, edge2, edge3; in newtri() local 78 VSub(&v1, &v0, &edge1); in newtri() 83 if ((VLength(&edge1) >= EPSILON) && in newtri() 94 t->edge1 = edge1; in newtri() 107 vector edge1, edge2, edge3; in newstri() local 109 VSub(&v1, &v0, &edge1); in newstri() 125 t->edge1 = edge1; in newstri() 153 VAdd(&t->v0, &t->edge1, &v1); in tri_bbox() 175 det = DOT(trn->edge1, pvec); in tri_intersect() 191 CROSS(qvec, tvec, trn->edge1); in tri_intersect() [all …]
|
/dports/devel/onetbb/oneTBB-2021.4.0/examples/parallel_for/tachyon/src/ |
H A D | triangle.cpp | 72 vector edge1, edge2, edge3; in newtri() local 74 VSub(&v1, &v0, &edge1); in newtri() 88 t->edge1 = edge1; in newtri() 99 vector edge1, edge2, edge3; in newstri() local 101 VSub(&v1, &v0, &edge1); in newstri() 115 t->edge1 = edge1; in newstri() 143 VAdd(&t->v0, &t->edge1, &v1); in tri_bbox() 165 det = DOT(trn->edge1, pvec); in tri_intersect() 181 CROSS(qvec, tvec, trn->edge1); in tri_intersect() 195 CROSS((*N), trn->edge1, trn->edge2); in tri_normal() [all …]
|
/dports/devel/juce/JUCE-f37e9a1/modules/juce_box2d/box2d/Collision/ |
H A D | b2CollidePolygon.cpp | 32 b2Assert(0 <= edge1 && edge1 < poly1->m_vertexCount); in b2EdgeSeparation() 35 b2Vec2 normal1World = b2Mul(xf1.q, normals1[edge1]); in b2EdgeSeparation() 52 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in b2EdgeSeparation() 151 b2Assert(0 <= edge1 && edge1 < poly1->m_vertexCount); in b2FindIncidentEdge() 174 c[0].id.cf.indexA = (uint8)edge1; in b2FindIncidentEdge() 180 c[1].id.cf.indexA = (uint8)edge1; in b2FindIncidentEdge() 213 int32 edge1; // reference edge in b2CollidePolygons() local 224 edge1 = edgeB; in b2CollidePolygons() 234 edge1 = edgeA; in b2CollidePolygons() 245 int32 iv1 = edge1; in b2CollidePolygons() [all …]
|
/dports/devel/love07/love-HEAD/src/modules/physics/box2d/Source/Collision/ |
H A D | b2CollidePoly.cpp | 73 b2Assert(0 <= edge1 && edge1 < count1); in EdgeSeparation() 76 b2Vec2 normal1World = b2Mul(xf1.R, normals1[edge1]); in EdgeSeparation() 93 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation() 209 b2Assert(0 <= edge1 && edge1 < count1); in FindIncidentEdge() 232 c[0].id.features.referenceEdge = (uint8)edge1; in FindIncidentEdge() 237 c[1].id.features.referenceEdge = (uint8)edge1; in FindIncidentEdge() 268 int32 edge1; // reference edge in b2CollidePolygons() local 280 edge1 = edgeB; in b2CollidePolygons() 289 edge1 = edgeA; in b2CollidePolygons() 299 b2Vec2 v11 = vertices1[edge1]; in b2CollidePolygons() [all …]
|
/dports/devel/love5/love-0.5-0/src/box2d/Source/Collision/ |
H A D | b2CollidePoly.cpp | 73 b2Assert(0 <= edge1 && edge1 < count1); in EdgeSeparation() 76 b2Vec2 normal1World = b2Mul(xf1.R, normals1[edge1]); in EdgeSeparation() 93 b2Vec2 v1 = b2Mul(xf1, vertices1[edge1]); in EdgeSeparation() 209 b2Assert(0 <= edge1 && edge1 < count1); in FindIncidentEdge() 232 c[0].id.features.referenceEdge = (uint8)edge1; in FindIncidentEdge() 237 c[1].id.features.referenceEdge = (uint8)edge1; in FindIncidentEdge() 268 int32 edge1; // reference edge in b2CollidePolygons() local 280 edge1 = edgeB; in b2CollidePolygons() 289 edge1 = edgeA; in b2CollidePolygons() 299 b2Vec2 v11 = vertices1[edge1]; in b2CollidePolygons() [all …]
|