Home
last modified time | relevance | path

Searched refs:triangle1 (Results 1 – 25 of 92) sorted by relevance

1234

/dports/misc/qt5-examples/qt-everywhere-src-5.15.2/qtsensors/examples/sensors/shakeit/
H A Dshakeit.qml82 id: triangle1
85 x: parent.width / 2 - (triangle1.width / 2)
86 y: parent.height / 2 - (triangle1.height);
106 x: parent.width / 2 + (triangle1.width / 2)
123 x: parent.width / 2 - (triangle1.width / 2)
124 y: parent.height / 2 - (triangle1.height);
138 … PropertyChanges { target: triangle2; rotation: 0; x:0; y:triangle1.x + triangle1.height; }
145 x:window.width - triangle1.width;
171 x: window.width / 3 - triangle1.width / 2;
172 y: window.height - triangle1.height;
[all …]
/dports/math/vtk8/VTK-8.2.0/Filters/General/Testing/Cxx/
H A DTestIntersectionPolyDataFilter4.cxx29 vtkNew<vtkTriangleFilter> triangle1; in TestIntersectionPolyDataFilter4() local
30 triangle1->SetInputConnection(sphere1->GetOutputPort()); in TestIntersectionPolyDataFilter4()
38 interFilter->SetInputConnection(0, triangle1->GetOutputPort()); in TestIntersectionPolyDataFilter4()
/dports/math/vtk9/VTK-9.1.0/Filters/General/Testing/Cxx/
H A DTestIntersectionPolyDataFilter4.cxx29 vtkNew<vtkTriangleFilter> triangle1; in TestIntersectionPolyDataFilter4() local
30 triangle1->SetInputConnection(sphere1->GetOutputPort()); in TestIntersectionPolyDataFilter4()
38 interFilter->SetInputConnection(0, triangle1->GetOutputPort()); in TestIntersectionPolyDataFilter4()
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/face/samples/
H A Dsample_face_swapping.cpp30 void warpTriangle(Mat &img1, Mat &img2, vector<Point2f> &triangle1, vector<Point2f> &triangle2);
59 void warpTriangle(Mat &img1, Mat &img2, vector<Point2f> &triangle1, vector<Point2f> &triangle2) in warpTriangle() argument
61 Rect rectangle1 = boundingRect(triangle1); in warpTriangle()
68 … triangle1Rect.push_back( Point2f( triangle1[i].x - rectangle1.x, triangle1[i].y - rectangle1.y) ); in warpTriangle()
173 vector<Point2f> triangle1, triangle2; in main() local
177 triangle1.push_back(boundary_image1[triangles[i][j]]); in main()
180 warpTriangle(img1, img1Warped, triangle1, triangle2); in main()
/dports/cad/gmsh/gmsh-4.9.2-source/tutorial/c++/
H A Dx3.cpp39 std::vector<double> triangle1 = { in main() local
48 triangle1.insert(triangle1.end(), {10., 11. - step, 12.}); in main()
54 std::vector<double> triangles(triangle1); in main()
/dports/math/vtk9/VTK-9.1.0/Filters/FlowPaths/
H A DvtkStreamSurface.cxx190 vtkNew<vtkTriangle> triangle1; in AdvectIterative() local
197 triangle1->GetPointIds()->SetId(0, k); in AdvectIterative()
198 triangle1->GetPointIds()->SetId(1, k + 1); in AdvectIterative()
199 triangle1->GetPointIds()->SetId(2, k + 2); in AdvectIterative()
207 triangle1->GetPointIds()->SetId(0, k); in AdvectIterative()
208 triangle1->GetPointIds()->SetId(1, k + 3); in AdvectIterative()
209 triangle1->GetPointIds()->SetId(2, k + 2); in AdvectIterative()
215 orderedSurfaceCells->InsertNextCell(triangle1); in AdvectIterative()
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Dsquared_distance_2_2.h428 squared_distance(const typename K::Triangle_2 &triangle1, in squared_distance() argument
438 internal::squared_distance(triangle1.vertex(0), triangle2.vertex(0), k); in squared_distance()
440 const Point_2& pt = triangle1.vertex(i); in squared_distance()
451 distance_index<K>(ind1, ind2, pt, triangle1, k); in squared_distance()
452 dist = squared_distance_indexed(pt, triangle1, ind1, ind2, k); in squared_distance()
467 const Point_2 &vt1 = triangle1.vertex(ind1_1); in squared_distance()
468 const Point_2 &vt2 = triangle1.vertex(ind1_2); in squared_distance()
479 Orientation or_s = orientation(vt1, vt2, triangle1.vertex(0)); in squared_distance()
481 if (orientation(vt1, vt2, triangle1.vertex(i)) != or_s) { in squared_distance()
558 squared_distance(const Triangle_2<K> &triangle1, in squared_distance() argument
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/tutorial/python/
H A Dx3.py36 triangle1 = [0., 1., 1., # x coordinates of the 3 triangle nodes variable
43 triangle1.extend([10., 11. - step, 12.]) # 3 node values for each step
47 gmsh.view.addListData(t1, "ST", 2, triangle1 + triangle2)
/dports/cad/ldview/ldview-4.4/LDLoader/
H A DLDLQuadLine.cpp465 LDLTriangleLine *triangle1 = NULL; in splitConcaveQuad() local
481 triangle1 = newTriangleLine(0, 1, 3); in splitConcaveQuad()
487 triangle1 = newTriangleLine(0, 1, 2); in splitConcaveQuad()
493 triangle1 = newTriangleLine(0, 1, 3); in splitConcaveQuad()
499 triangle1 = newTriangleLine(0, 1, 2); in splitConcaveQuad()
503 if (triangle1) in splitConcaveQuad()
506 fileLineArray->addObject(triangle1); in splitConcaveQuad()
508 triangle1->release(); in splitConcaveQuad()
/dports/audio/faust/faust-2.37.3/tools/physicalModeling/mesh2faust/vega/libraries/mesher/
H A DtriangleTetIntersection.cpp41 …Triangle triangle1(v1, v2, v3), triangle2(v1, v2, v4), triangle3(v1, v3, v4), triangle4(v2, v3, v4… in tetrahedronIntersectTriangle() local
42 if (triangle1.intersect(t1, t2) || triangle1.intersect(t1, t3) || triangle1.intersect(t2, t3)) in tetrahedronIntersectTriangle()
/dports/devel/juce/JUCE-f37e9a1/examples/Assets/Box2DTests/
H A DCompoundShapes.h88 b2PolygonShape triangle1; in CompoundShapes() local
92 triangle1.Set(vertices, 3); in CompoundShapes()
112 body->CreateFixture(&triangle1, 2.0f); in CompoundShapes()
/dports/devel/juce/JUCE-f37e9a1/examples/DemoRunner/Builds/Android/app/src/main/assets/Box2DTests/
H A DCompoundShapes.h88 b2PolygonShape triangle1; in CompoundShapes() local
92 triangle1.Set(vertices, 3); in CompoundShapes()
112 body->CreateFixture(&triangle1, 2.0f); in CompoundShapes()
/dports/games/openclaw/OpenClaw-0.0-51-gbac7730/Box2D/Testbed/Tests/
H A DCompoundShapes.h88 b2PolygonShape triangle1; in CompoundShapes() local
92 triangle1.Set(vertices, 3); in CompoundShapes()
112 body->CreateFixture(&triangle1, 2.0f); in CompoundShapes()
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/box2d/Testbed/Tests/
H A DCompoundShapes.h88 b2PolygonShape triangle1; in CompoundShapes() local
92 triangle1.Set(vertices, 3); in CompoundShapes()
112 body->CreateFixture(&triangle1, 2.0f); in CompoundShapes()
/dports/math/py-matplotlib/matplotlib-3.4.3/lib/matplotlib/tests/
H A Dtest_lines.py256 triangle1 = Path([[-1., -1.], [1., -1.], [0., 2.], [0., 0.]], closed=True)
257 line2, = ax.plot([1, 3, 2], marker=MarkerStyle(triangle1), ms=22)
258 line3, = ax.plot([0, 2, 1], marker=triangle1, ms=22)
260 assert_array_equal(line2.get_marker().vertices, triangle1.vertices)
261 assert_array_equal(line3.get_marker().vertices, triangle1.vertices)
/dports/graphics/opendx/dx-4.4.4/src/exec/libdx/
H A Dlocal.mk.in21 …-DPASS1 __triangle.c | sed -e '/^#/d' -e 's/INCLUDE1/#include/' | tr -s "\044" "\012" > triangle1.c
22 …@CPP@ -I${srcdir} -DPASS2 triangle1.c | sed -e '/^#/d' -e 's/INCLUDE2/#include/' | tr -s "\044" "\…
24 rm triangle1.c triangle2.c __triangle.c
/dports/cad/ngspice_rework/ngspice-35/examples/xspice/original-examples/
H A Danalog_models4_swept_dc.deck23 a2 1 20 triangle1
24 .model triangle1 triangle (cntl_array=[-1.0 0.0 1.0 2.0]
H A Danalog_models4_dc.deck23 a2 1 20 triangle1
24 .model triangle1 triangle (cntl_array=[-1.0 0.0 1.0 2.0]
H A Danalog_models4_ac.deck27 a2 1 20 triangle1
28 .model triangle1 triangle (cntl_array=[-1.0 0.0 1.0 2.0]
/dports/games/avp/avp-20170505/src/avp/win95/
H A Dkzsort.c1024 struct KItem * triangle1 = 0;
1089 triangle1 = OutputKItem(item_array_buf);
1138 if (triangle1 && triangle2)
1143 if (triangle1->SortKey < triangle2->SortKey)
1144 triangle2->SortKey = triangle1->SortKey;
1146 triangle1->SortKey = triangle2->SortKey;
1152 if (triangle1->SortKey > triangle2->SortKey)
1153 triangle2->SortKey = triangle1->SortKey;
1155 triangle1->SortKey = triangle2->SortKey;
/dports/devel/bullet/bullet3-3.21/Extras/ConvexDecomposition/
H A Dcd_vector.h759 const Vector3d &triangle1, in NearestPointInPlane() argument
763 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInPlane()
792 const Vector3d &triangle1, in NearestPointInTriangle() argument
799 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInTriangle()
805 nearestPoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
815 axis[0].NearestPointInLine(triangle0, triangle1, triangle2); in NearestPointInTriangle()
816 axis[1].NearestPointInLine(triangle1, triangle0, triangle2); in NearestPointInTriangle()
817 axis[2].NearestPointInLine(triangle2, triangle0, triangle1); in NearestPointInTriangle()
821 axisDot[1] = (triangle1 - axis[1]).Dot(point - axis[1]); in NearestPointInTriangle()
831 closePoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
[all …]
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/gimpact/ConvexDecomposition/
H A Dcd_vector.h745 const Vector3d &triangle1, in NearestPointInPlane() argument
749 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInPlane()
778 const Vector3d &triangle1, in NearestPointInTriangle() argument
785 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInTriangle()
791 nearestPoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
801 axis[0].NearestPointInLine(triangle0, triangle1, triangle2); in NearestPointInTriangle()
802 axis[1].NearestPointInLine(triangle1, triangle0, triangle2); in NearestPointInTriangle()
803 axis[2].NearestPointInLine(triangle2, triangle0, triangle1); in NearestPointInTriangle()
807 axisDot[1] = (triangle1-axis[1]).Dot(point-axis[1]); in NearestPointInTriangle()
817 closePoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/Extras/ConvexDecomposition/
H A Dcd_vector.h745 const Vector3d &triangle1, in NearestPointInPlane() argument
749 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInPlane()
778 const Vector3d &triangle1, in NearestPointInTriangle() argument
785 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInTriangle()
791 nearestPoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
801 axis[0].NearestPointInLine(triangle0, triangle1, triangle2); in NearestPointInTriangle()
802 axis[1].NearestPointInLine(triangle1, triangle0, triangle2); in NearestPointInTriangle()
803 axis[2].NearestPointInLine(triangle2, triangle0, triangle1); in NearestPointInTriangle()
807 axisDot[1] = (triangle1-axis[1]).Dot(point-axis[1]); in NearestPointInTriangle()
817 closePoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
[all …]
/dports/devel/py-bullet3/bullet3-3.21/Extras/ConvexDecomposition/
H A Dcd_vector.h759 const Vector3d &triangle1, in NearestPointInPlane() argument
763 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInPlane()
792 const Vector3d &triangle1, in NearestPointInTriangle() argument
799 Vector3d lineDelta0 = triangle1 - triangle0; in NearestPointInTriangle()
805 nearestPoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
815 axis[0].NearestPointInLine(triangle0, triangle1, triangle2); in NearestPointInTriangle()
816 axis[1].NearestPointInLine(triangle1, triangle0, triangle2); in NearestPointInTriangle()
817 axis[2].NearestPointInLine(triangle2, triangle0, triangle1); in NearestPointInTriangle()
821 axisDot[1] = (triangle1 - axis[1]).Dot(point - axis[1]); in NearestPointInTriangle()
831 closePoint.NearestPointInLineSegment(point, triangle1, triangle2); in NearestPointInTriangle()
[all …]
/dports/cad/tochnog/Sources/Tochnog-Latest-jan-2014/
H A Dintersec.cc61 double triangle0[], double triangle1[], double triangle2[], in intersect_line_with_triangle() argument
78 array_subtract( triangle1, triangle2, vec, ndim ); in intersect_line_with_triangle()

1234