/dports/science/elmerfem/elmerfem-release-9.0/post/src/ |
H A D | geometry.c | 307 int i,j,v0=triangle->v[0],v1=triangle->v[1],v2=triangle->v[2],swap,w0,w1,w2; in geo_add_triangle() 351 … if ( triangle->Edge[0] ) geo_add_edge( geometry,triangle->v[0],triangle->v[1],triangle->Element ); in geo_add_triangle() 352 … if ( triangle->Edge[1] ) geo_add_edge( geometry,triangle->v[1],triangle->v[2],triangle->Element ); in geo_add_triangle() 353 … if ( triangle->Edge[2] ) geo_add_edge( geometry,triangle->v[2],triangle->v[0],triangle->Element ); in geo_add_triangle() 356 triangle->v[0] = v0; in geo_add_triangle() 421 ax = Vert[triangle->v[1]].x[0] - Vert[triangle->v[0]].x[0]; in geo_triangle_normal() 422 ay = Vert[triangle->v[1]].x[1] - Vert[triangle->v[0]].x[1]; in geo_triangle_normal() 423 az = Vert[triangle->v[1]].x[2] - Vert[triangle->v[0]].x[2]; in geo_triangle_normal() 425 bx = Vert[triangle->v[2]].x[0] - Vert[triangle->v[0]].x[0]; in geo_triangle_normal() 426 by = Vert[triangle->v[2]].x[1] - Vert[triangle->v[0]].x[1]; in geo_triangle_normal() [all …]
|
/dports/devel/bullet/bullet3-3.21/src/Bullet3OpenCL/NarrowphaseCollision/ |
H A D | b3StridingMeshInterface.cpp | 35 b3Vector3 triangle[3]; in InternalProcessAllTriangles() local 68 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 83 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 98 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 125 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 190 m_aabbMin.setMin(triangle[0]); in calculateAabbBruteForce() 191 m_aabbMax.setMax(triangle[0]); in calculateAabbBruteForce() 192 m_aabbMin.setMin(triangle[1]); in calculateAabbBruteForce() 193 m_aabbMax.setMax(triangle[1]); in calculateAabbBruteForce() 194 m_aabbMin.setMin(triangle[2]); in calculateAabbBruteForce() [all …]
|
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3OpenCL/NarrowphaseCollision/ |
H A D | b3StridingMeshInterface.cpp | 35 b3Vector3 triangle[3]; in InternalProcessAllTriangles() local 68 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 83 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 98 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 125 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 190 m_aabbMin.setMin(triangle[0]); in calculateAabbBruteForce() 191 m_aabbMax.setMax(triangle[0]); in calculateAabbBruteForce() 192 m_aabbMin.setMin(triangle[1]); in calculateAabbBruteForce() 193 m_aabbMax.setMax(triangle[1]); in calculateAabbBruteForce() 194 m_aabbMin.setMin(triangle[2]); in calculateAabbBruteForce() [all …]
|
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3OpenCL/NarrowphaseCollision/ |
H A D | b3StridingMeshInterface.cpp | 35 b3Vector3 triangle[3]; in InternalProcessAllTriangles() local 68 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 83 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 98 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 125 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 190 m_aabbMin.setMin(triangle[0]); in calculateAabbBruteForce() 191 m_aabbMax.setMax(triangle[0]); in calculateAabbBruteForce() 192 m_aabbMin.setMin(triangle[1]); in calculateAabbBruteForce() 193 m_aabbMax.setMax(triangle[1]); in calculateAabbBruteForce() 194 m_aabbMin.setMin(triangle[2]); in calculateAabbBruteForce() [all …]
|
/dports/biology/ugene/ugene-40.1/src/plugins_3rdparty/ball/src/include/BALL/MATHS/ |
H A D | surface.h | 48 return (v1 == triangle.v1) && (v2 == triangle.v2) && (v3 == triangle.v3); in BALL_CREATE() 54 return !(v1 == triangle.v1) && (v2 == triangle.v2) && (v3 == triangle.v3); in BALL_CREATE() 210 triangle(surface.triangle) in TSurface() 224 triangle.clear(); in clear() 232 triangle = surface.triangle; in set() 240 triangle = surface.triangle; 249 surface.triangle = triangle; in get() 338 …area += ((vertex[triangle[i].v2] - vertex[triangle[i].v1]) % (vertex[triangle[i].v3] - vertex[tria… in getArea() 350 && (surface.triangle == triangle)); 392 triangle.clear(); in clearTriangles() [all …]
|
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3OpenCL/NarrowphaseCollision/ |
H A D | b3StridingMeshInterface.cpp | 35 b3Vector3 triangle[3]; in InternalProcessAllTriangles() local 68 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 83 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 98 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 125 callback->internalProcessTriangleIndex(triangle, part, gfxindex); in InternalProcessAllTriangles() 190 m_aabbMin.setMin(triangle[0]); in calculateAabbBruteForce() 191 m_aabbMax.setMax(triangle[0]); in calculateAabbBruteForce() 192 m_aabbMin.setMin(triangle[1]); in calculateAabbBruteForce() 193 m_aabbMax.setMax(triangle[1]); in calculateAabbBruteForce() 194 m_aabbMin.setMin(triangle[2]); in calculateAabbBruteForce() [all …]
|
/dports/graphics/rayshade/rayshade.4.0/libray/libobj/ |
H A D | triangle.c | 61 VecCross(&triangle->e[0], &triangle->e[1], &ptmp); 69 VecScale(-1, triangle->nrm, &triangle->nrm); 71 triangle->d = dotp(&triangle->nrm, p1); 105 VecScale(-1., triangle->nrm, &triangle->nrm); 107 triangle->d = -triangle->d; 108 VecScale(-1., triangle->e[0], &triangle->e[0]); 126 TriangleSetdPdUV(triangle->p, triangle->uv, 127 triangle->dpdu, triangle->dpdv); 154 VecScale(d, triangle->e[0], &triangle->e[0]); 155 VecScale(d, triangle->e[1], &triangle->e[1]); [all …]
|
/dports/graphics/open3d/Open3D-0.2/src/Core/Geometry/ |
H A D | TriangleMesh.cpp | 150 auto &triangle = triangles_[i]; in ComputeTriangleNormals() local 151 Eigen::Vector3d v01 = vertices_[triangle(1)] - vertices_[triangle(0)]; in ComputeTriangleNormals() 152 Eigen::Vector3d v02 = vertices_[triangle(2)] - vertices_[triangle(0)]; in ComputeTriangleNormals() 214 triangle(0) = index_old_to_new[triangle(0)]; in RemoveDuplicatedVertices() 215 triangle(1) = index_old_to_new[triangle(1)]; in RemoveDuplicatedVertices() 216 triangle(2) = index_old_to_new[triangle(2)]; in RemoveDuplicatedVertices() 296 triangle(0) = index_old_to_new[triangle(0)]; in RemoveNonManifoldVertices() 297 triangle(1) = index_old_to_new[triangle(1)]; in RemoveNonManifoldVertices() 298 triangle(2) = index_old_to_new[triangle(2)]; in RemoveNonManifoldVertices() 315 if (triangle(0) != triangle(1) && triangle(1) != triangle(2) && in RemoveNonManifoldTriangles() [all …]
|
/dports/graphics/py-open3d-python/Open3D-0.2/src/Core/Geometry/ |
H A D | TriangleMesh.cpp | 150 auto &triangle = triangles_[i]; in ComputeTriangleNormals() local 151 Eigen::Vector3d v01 = vertices_[triangle(1)] - vertices_[triangle(0)]; in ComputeTriangleNormals() 152 Eigen::Vector3d v02 = vertices_[triangle(2)] - vertices_[triangle(0)]; in ComputeTriangleNormals() 214 triangle(0) = index_old_to_new[triangle(0)]; in RemoveDuplicatedVertices() 215 triangle(1) = index_old_to_new[triangle(1)]; in RemoveDuplicatedVertices() 216 triangle(2) = index_old_to_new[triangle(2)]; in RemoveDuplicatedVertices() 296 triangle(0) = index_old_to_new[triangle(0)]; in RemoveNonManifoldVertices() 297 triangle(1) = index_old_to_new[triangle(1)]; in RemoveNonManifoldVertices() 298 triangle(2) = index_old_to_new[triangle(2)]; in RemoveNonManifoldVertices() 315 if (triangle(0) != triangle(1) && triangle(1) != triangle(2) && in RemoveNonManifoldTriangles() [all …]
|
/dports/graphics/ogre3d/ogre-1.11.6/Components/MeshLodGenerator/src/ |
H A D | OgreLodCollapser.cpp | 114 triangle->isRemoved = true; in removeTriangleFromEdges() 117 if (triangle->vertex[i] != skip) { in removeTriangleFromEdges() 118 triangle->vertex[i]->triangles.removeExists(triangle); in removeTriangleFromEdges() 124 triangle->vertex[i]->removeEdge(LodData::Edge(triangle->vertex[n])); in removeTriangleFromEdges() 151 dst->triangles.addNotExists(triangle); in replaceVertexID() 162 triangle->vertex[n]->removeEdge(LodData::Edge(triangle->vertex[i])); in replaceVertexID() 167 triangle->vertex[i] = dst; in replaceVertexID() 168 triangle->vertexID[i] = newID; in replaceVertexID() 195 if (triangle->hasVertex(dst)) { in collapseVertex() 225 if (!triangle->hasVertex(dst)) { in collapseVertex() [all …]
|
/dports/java/jgraphx/jgraphx-4.2.2/src/com/mxgraph/shape/ |
H A D | mxTriangleShape.java | 27 Polygon triangle = new Polygon(); in createShape() local 31 triangle.addPoint(x, y + h); in createShape() 32 triangle.addPoint(x + w / 2, y); in createShape() 33 triangle.addPoint(x + w, y + h); in createShape() 37 triangle.addPoint(x, y); in createShape() 39 triangle.addPoint(x + w, y); in createShape() 43 triangle.addPoint(x + w, y); in createShape() 44 triangle.addPoint(x, y + h / 2); in createShape() 50 triangle.addPoint(x, y); in createShape() 52 triangle.addPoint(x, y + h); in createShape() [all …]
|
/dports/games/spring/spring_98.0/rts/lib/assimp/contrib/poly2tri/poly2tri/sweep/ |
H A D | sweep_context.cc | 113 map_.push_back(triangle); in AddToMap() 129 map_.push_back(triangle); in CreateAdvancingFront() 131 af_head_ = new Node(*triangle->GetPoint(1), *triangle); in CreateAdvancingFront() 132 af_middle_ = new Node(*triangle->GetPoint(0), *triangle); in CreateAdvancingFront() 155 n->triangle = &t; in MapTriangleToNodes() 162 map_.remove(triangle); in RemoveFromMap() 167 if (&triangle != NULL && !triangle.IsInterior()) { in MeshClean() 168 triangle.IsInterior(true); in MeshClean() 169 triangles_.push_back(&triangle); in MeshClean() 171 if (!triangle.constrained_edge[i]) in MeshClean() [all …]
|
/dports/math/vtk6/VTK-6.2.0/Accelerators/Piston/ |
H A D | vtkDataSetToPiston.cxx | 145 vtkIdType triangle[3]; in RequestData() local 146 triangle[0] = index[0]; in RequestData() 147 triangle[1] = index[1]; in RequestData() 148 triangle[2] = index[2]; in RequestData() 150 triangulated->GetPoints()->InsertNextPoint(idp->GetPoint(triangle[0])); in RequestData() 152 triangulated->GetPoints()->InsertNextPoint(idp->GetPoint(triangle[1])); in RequestData() 154 triangulated->GetPoints()->InsertNextPoint(idp->GetPoint(triangle[2])); in RequestData() 160 triangle[1] = triangle[2]; in RequestData() 161 triangle[2] = index[i]; in RequestData() 162 triangulated->GetPoints()->InsertNextPoint(idp->GetPoint(triangle[0])); in RequestData() [all …]
|
/dports/math/py-triangle/triangle-20200424/doc/ |
H A D | data.rst | 11 import triangle as tr 21 import triangle as tr 33 import triangle as tr 45 import triangle as tr 59 import triangle as tr 67 import triangle as tr 77 import triangle as tr 82 import triangle as tr 96 import triangle as tr 107 import triangle as tr [all …]
|
/dports/math/clblast/CLBlast-1.1.0/include/ |
H A D | clblast_netlib_c.h | 338 void PUBLIC_API cblas_chemv(const CLBlastLayout layout, const CLBlastTriangle triangle, 345 void PUBLIC_API cblas_zhemv(const CLBlastLayout layout, const CLBlastTriangle triangle, 354 void PUBLIC_API cblas_chbmv(const CLBlastLayout layout, const CLBlastTriangle triangle, 361 void PUBLIC_API cblas_zhbmv(const CLBlastLayout layout, const CLBlastTriangle triangle, 370 void PUBLIC_API cblas_chpmv(const CLBlastLayout layout, const CLBlastTriangle triangle, 377 void PUBLIC_API cblas_zhpmv(const CLBlastLayout layout, const CLBlastTriangle triangle, 386 void PUBLIC_API cblas_ssymv(const CLBlastLayout layout, const CLBlastTriangle triangle, 584 void PUBLIC_API cblas_cher(const CLBlastLayout layout, const CLBlastTriangle triangle, 589 void PUBLIC_API cblas_zher(const CLBlastLayout layout, const CLBlastTriangle triangle, 596 void PUBLIC_API cblas_chpr(const CLBlastLayout layout, const CLBlastTriangle triangle, [all …]
|
/dports/graphics/krita/krita-4.4.8/plugins/generators/screentone/ |
H A D | KisScreentoneScreentoneFunctions.cpp | 80 qreal triangle(qreal x) in triangle() function 95 x = triangle(x); in operator ()() 96 y = triangle(y); in operator ()() 125 return (triangle(x) + triangle(y)) / 2.; in operator ()() 130 return std::max(triangle(x), triangle(y)); in operator ()() 136 return triangle(y); in operator ()() 147 return triangle(y + sin(x)); in operator ()() 157 return triangle(y + triangle(x)); in operator ()() 177 x = triangle(x); in operator ()() 178 return triangle(y + x * x); in operator ()() [all …]
|
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Assimp/contrib/poly2tri/poly2tri/sweep/ |
H A D | sweep_context.cc | 113 map_.push_back(triangle); in AddToMap() 129 map_.push_back(triangle); in CreateAdvancingFront() 131 af_head_ = new Node(*triangle->GetPoint(1), *triangle); in CreateAdvancingFront() 132 af_middle_ = new Node(*triangle->GetPoint(0), *triangle); in CreateAdvancingFront() 155 n->triangle = &t; in MapTriangleToNodes() 162 map_.remove(triangle); in RemoveFromMap() 167 if (!triangle.IsInterior()) { in MeshClean() 168 triangle.IsInterior(true); in MeshClean() 169 triangles_.push_back(&triangle); in MeshClean() 171 if (!triangle.constrained_edge[i]) in MeshClean() [all …]
|
/dports/games/doomsday/doomsday-2.3.1/doomsday/external/assimp/contrib/poly2tri/poly2tri/sweep/ |
H A D | sweep_context.cc | 113 map_.push_back(triangle); in AddToMap() 129 map_.push_back(triangle); in CreateAdvancingFront() 131 af_head_ = new Node(*triangle->GetPoint(1), *triangle); in CreateAdvancingFront() 132 af_middle_ = new Node(*triangle->GetPoint(0), *triangle); in CreateAdvancingFront() 155 n->triangle = &t; in MapTriangleToNodes() 162 map_.remove(triangle); in RemoveFromMap() 167 if (!triangle.IsInterior()) { in MeshClean() 168 triangle.IsInterior(true); in MeshClean() 169 triangles_.push_back(&triangle); in MeshClean() 171 if (!triangle.constrained_edge[i]) in MeshClean() [all …]
|
/dports/textproc/miller/miller-5.10.2/docs/data/ |
H A D | colored-shapes.dkvp | 1 color=yellow,shape=triangle,flag=1,i=11,u=0.6321695890307647,v=0.9887207810889004,w=0.4364983936735… 5 color=purple,shape=triangle,flag=0,i=51,u=0.4355354501763202,v=0.8591292672156728,w=0.8122903963006… 7 color=purple,shape=triangle,flag=0,i=65,u=0.6842806710360729,v=0.5823723856331258,w=0.8014053396013… 14 color=red,shape=triangle,flag=0,i=123,u=0.4278178693661939,v=0.3960696006932547,w=0.466907579972232… 18 color=purple,shape=triangle,flag=0,i=140,u=0.7170724772864769,v=0.971982521419424,w=0.7877975577532… 22 color=red,shape=triangle,flag=1,i=177,u=0.46223900862848977,v=0.3756372162560322,w=0.46677374441501… 26 color=blue,shape=triangle,flag=0,i=220,u=0.441773289968473,v=0.44597731903759075,w=0.63293606668498… 40 color=blue,shape=triangle,flag=0,i=396,u=0.919100549631871,v=0.8344721671140174,w=0.624436700194648… 52 color=red,shape=triangle,flag=0,i=476,u=0.7869818074820932,v=0.7917840934406875,w=0.490446571748265… 68 color=red,shape=triangle,flag=1,i=649,u=0.489957093971505,v=0.3478765534442614,w=0.4923961471690822… [all …]
|
/dports/math/ccmath/ccmath-2.2.1/manual/ |
H A D | C03-geom | 254 a = side of triangle 256 b = side of triangle 289 a = side of triangle 290 b = side of triangle 291 c = side of triangle 309 a = side of triangle 310 b = side of triangle 335 a = side of triangle 336 b = side of triangle 337 c = side of triangle [all …]
|
/dports/lang/fpc-source/fpc-3.2.2/packages/libndsfpc/examples/graphics/3D/Display_List/ |
H A D | DisplayList.pp | 9 triangle: array [0..12] of cuint32; // Display List 16 triangle[0] := 12; 18 triangle[2] := GL_TRIANGLE; 19 triangle[3] := RGB15(31,0,0); 21 triangle[5] := VERTEX_PACK(0,0); 22 triangle[6] := RGB15(0,31,0); 24 triangle[8] := VERTEX_PACK(inttov16(1),inttov16(-1)); 25 triangle[9] := VERTEX_PACK(0,0); 26 triangle[10] := RGB15(0,0,31); 28 triangle[12] := VERTEX_PACK(0,0); [all …]
|
/dports/games/colobot/colobot-colobot-gold-0.2.0-alpha/src/graphics/model/ |
H A D | model_input.cpp | 175 triangle.p1 = t.p1; in ReadBinaryModelV1AndV2() 176 triangle.p2 = t.p2; in ReadBinaryModelV1AndV2() 177 triangle.p3 = t.p3; in ReadBinaryModelV1AndV2() 267 ModelTriangle triangle; in ReadTextModelV1AndV2() local 268 triangle.p1 = t.p1; in ReadTextModelV1AndV2() 269 triangle.p2 = t.p2; in ReadTextModelV1AndV2() 270 triangle.p3 = t.p3; in ReadTextModelV1AndV2() 448 ModelTriangle triangle; in ReadOldModelV1() local 547 triangle.p1 = t.p1; in ReadOldModelV3() 548 triangle.p2 = t.p2; in ReadOldModelV3() [all …]
|
/dports/graphics/osg/OpenSceneGraph-OpenSceneGraph-3.6.5/src/osgPlugins/gles/ |
H A D | TriangleMeshSmoother.cpp | 164 const Triangle& triangle = _graph->triangle(*tri); in computeVertexNormals() local 207 …for(IndexVector::const_iterator triangle = triangles.begin() ; triangle != triangles.end() ; ++ tr… in cumulateTriangleNormals() local 208 const Triangle& t = _graph->triangle(*triangle); in cumulateTriangleNormals() 217 Triangle& triangle = _graph->triangle(*tri); in replaceVertexIndexInTriangles() local 218 if(triangle.v1() == oldIndex) { in replaceVertexIndexInTriangles() 219 triangle.v1() = newIndex; in replaceVertexIndexInTriangles() 221 else if(triangle.v2() == oldIndex) { in replaceVertexIndexInTriangles() 222 triangle.v2() = newIndex; in replaceVertexIndexInTriangles() 224 else if(triangle.v3() == oldIndex) { in replaceVertexIndexInTriangles() 225 triangle.v3() = newIndex; in replaceVertexIndexInTriangles() [all …]
|
/dports/games/gtkradiant/GPL/GtkRadiant/libs/picomodel/ |
H A D | pm_fm.c | 211 fm_xyz_st_t *triangle; in _fm_load() local 357 triangle = tri_verts; in _fm_load() 362 triangle->index_xyz[ j ] = _pico_little_short( triangle->index_xyz[ j ] ); in _fm_load() 363 triangle->index_st[ j ] = _pico_little_short( triangle->index_st[ j ] ); in _fm_load() 436 triangle = tri_verts; in _fm_load() 443 p_index_LUT[triangle->index_xyz[j]].ST = triangle->index_st[j]; in _fm_load() 445 else if (triangle->index_st[j] == p_index_LUT[triangle->index_xyz[j]].ST ) // Equal to Main Entry in _fm_load() 507 triangle++; in _fm_load() 558 triangle = tri_verts; in _fm_load() 564 triangle++; in _fm_load() [all …]
|
/dports/graphics/qgis/qgis-3.22.3/python/core/auto_generated/geometry/ |
H A D | qgstriangle.sip.in | 27 Constructor for an empty triangle geometry. 121 Returns the three lengths of the triangle. 140 Returns the three angles of the triangle. 230 Is the triangle right-angled? 297 :return: Three medians from this triangle. 335 Medial (or midpoint) triangle of a triangle ABC is the triangle with vertices at the midpoints of t… 337 :return: The medial from this triangle. 338 An empty triangle is returned for empty triangle. 358 :return: The orthocenter of the triangle. 413 Circumscribed circle of the triangle. [all …]
|