Home
last modified time | relevance | path

Searched refs:ivertex (Results 1 – 17 of 17) sorted by relevance

/dports/math/gnuplot/gnuplot-5.4.1/src/
H A Dvplot.c233 int ivertex, iedge, it; in tessellate_one_cube() local
238 for (ivertex = 0; ivertex < 8; ivertex++) { in tessellate_one_cube()
239 int cx = ix + scaled_offset[ivertex][0]; in tessellate_one_cube()
240 int cy = iy + scaled_offset[ivertex][1]; in tessellate_one_cube()
241 int cz = iz + scaled_offset[ivertex][2]; in tessellate_one_cube()
305 quad[0].x = intersection[ivertex][0]; in tessellate_one_cube()
306 quad[0].y = intersection[ivertex][1]; in tessellate_one_cube()
307 quad[0].z = intersection[ivertex][2]; in tessellate_one_cube()
309 quad[1].x = intersection[ivertex][0]; in tessellate_one_cube()
310 quad[1].y = intersection[ivertex][1]; in tessellate_one_cube()
[all …]
/dports/math/gnuplot-lite/gnuplot-5.4.1/src/
H A Dvplot.c233 int ivertex, iedge, it; in tessellate_one_cube() local
238 for (ivertex = 0; ivertex < 8; ivertex++) { in tessellate_one_cube()
239 int cx = ix + scaled_offset[ivertex][0]; in tessellate_one_cube()
240 int cy = iy + scaled_offset[ivertex][1]; in tessellate_one_cube()
241 int cz = iz + scaled_offset[ivertex][2]; in tessellate_one_cube()
305 quad[0].x = intersection[ivertex][0]; in tessellate_one_cube()
306 quad[0].y = intersection[ivertex][1]; in tessellate_one_cube()
307 quad[0].z = intersection[ivertex][2]; in tessellate_one_cube()
309 quad[1].x = intersection[ivertex][0]; in tessellate_one_cube()
310 quad[1].y = intersection[ivertex][1]; in tessellate_one_cube()
[all …]
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/sandboxes/aabb-evaluation/
H A Daabb-evaluation.cpp53 for (int ivertex = 0; ivertex < num_vertices; ++ ivertex) { in profile() local
67 occlusion_output0(ivertex) = (double)num_hits/(double)num_samples; in profile()
74 for (int ivertex = 0; ivertex < num_vertices; ++ ivertex) { in profile() local
90 occlusion_output0(ivertex) = (double)num_hits/(double)num_samples; in profile()
112 for (int ivertex = 0; ivertex < num_vertices; ++ ivertex) { in profile() local
113 const Eigen::Vector3d origin = V.row(ivertex).template cast<double>(); in profile()
126 occlusion_output1(ivertex) = (double)num_hits/(double)num_samples; in profile()
143 for (int ivertex = 0; ivertex < num_vertices; ++ ivertex) { in profile() local
157 occlusion_output2(ivertex) = (double)num_hits/(double)num_samples; in profile()
179 for (int ivertex = 0; ivertex < num_vertices; ++ ivertex) { in profile() local
[all …]
/dports/lang/fpc-source/fpc-3.2.2/packages/libndsfpc/examples/gl2d/2Dplus3D/
H A Dvbuffer.pas194 ivertex: array of TVector3f32;
211 SetLength(ivertex, max_point);
216 vb^.ips_vertex := ivertex;
260 ivertex[k].x := floattov16(x);
261 ivertex[k].y := floattov16(y);
289 ivertex: array of TVector3f32;
312 SetLength(ivertex, max_point);
317 vb^.ips_vertex := ivertex;
409 ivertex: array of TVector3f32;
427 setlength(ivertex, max_point);
[all …]
/dports/science/mpqc/mpqc-2.3.1/src/lib/util/render/
H A Doogl.cc274 int ivertex = poly->polyline(i,j); in polylines() local
276 poly->vertex(ivertex,0), in polylines()
277 poly->vertex(ivertex,1), in polylines()
278 poly->vertex(ivertex,2)) in polylines()
286 int ivertex = poly->polyline(i,j); in polylines() local
288 poly->vertex_rgb(ivertex,0), in polylines()
289 poly->vertex_rgb(ivertex,1), in polylines()
290 poly->vertex_rgb(ivertex,2)) in polylines()
/dports/math/dune-uggrid/dune-uggrid-bc2d1229420367563410ce9e519f5ff82b45266f/dune/uggrid/parallel/dddif/
H A Dinitddd.cc426 EL_DDDHDR, offsetof(ivertex,ddd), in ddd_DefineTypes()
433 EL_GDATA, ELDEF(ivertex,id), in ddd_DefineTypes()
434 EL_GDATA, ELDEF(ivertex,x), in ddd_DefineTypes()
435 EL_GDATA, ELDEF(ivertex,xi), in ddd_DefineTypes()
436 EL_LDATA, ELDEF(ivertex,leafIndex), in ddd_DefineTypes()
437 EL_LDATA, ELDEF(ivertex,pred), in ddd_DefineTypes()
438 EL_LDATA, ELDEF(ivertex,succ), in ddd_DefineTypes()
439 EL_LDATA, ELDEF(ivertex,data), in ddd_DefineTypes()
449 EL_LDATA, ELDEF(ivertex,father), in ddd_DefineTypes()
454 EL_LDATA, ELDEF(ivertex,topnode), in ddd_DefineTypes()
[all …]
/dports/cad/opencascade/opencascade-7.6.0/src/BRepToIGESBRep/
H A DBRepToIGESBRep_Entity.cxx156 for (Standard_Integer ivertex = 1; ivertex <= nbvertices; ivertex++) { in TransferVertexList() local
157 TopoDS_Shape myshape = myVertices(ivertex); in TransferVertexList()
161 vertices->SetValue(ivertex, gp_XYZ(X/Unit,Y/Unit,Z/Unit)); in TransferVertexList()
/dports/net-p2p/py-vertex/Vertex-0.3.1/vertex/test/
H A Dtest_identity.py14 from vertex.ivertex import IQ2QUser
/dports/science/quantum-espresso/q-e-qe-6.7.0/Modules/
H A Dbz_form.f9025 INTEGER, ALLOCATABLE :: ivertex(:,:) ! for each vertex which faces define it component
1611 CALL find_intersection( bz_struc%ivertex(:,i), bz_struc%normal, &
1666 a(ipol,jpol) = normal(jpol,ivertex(ipol))
1668 b(ipol)=0.5_DP * ( normal(1,ivertex(ipol))**2 &
1669 + normal(2,ivertex(ipol))**2 &
1670 + normal(3,ivertex(ipol))**2 )
1766 bz_struc%ivertex(iv,ivert)= iface
/dports/graphics/vpaint/vpaint-1.7/src/Gui/VectorAnimationComplex/
H A DVAC.cpp1383 smartDeleteCell(ivertex); in smartDelete_()
1495 KeyVertex * ivertex = cell->toKeyVertex(); in atomicSimplifyAtCell() local
1497 if(ivertex) in atomicSimplifyAtCell()
1499 return uncut_(ivertex); in atomicSimplifyAtCell()
3853 splitNodes.existing << EdgeSample(ivertex->pos()[0], ivertex->pos()[1]); in insertSketchedEdgeInVAC()
5587 foreach(KeyVertex * ivertex, vertexSet) in unglue()
5588 unglue_(ivertex); in unglue()
5604 foreach(KeyVertex * ivertex, vertexSet) in uncut()
5605 hasbeenCut |= uncut_(ivertex); in uncut()
6380 if(ivertex) in split()
[all …]
/dports/games/openclonk/openclonk-release-8.1-src/planet/Objects.ocd/Environment.ocd/Bricks.ocd/MovingBrick.ocd/
H A DScript.c399 var vertex, ivertex = 0, n, edge, iedge = 0; in OnGraphUpdate() local
402 vertex._index = ivertex++; in OnGraphUpdate()
/dports/science/wxmacmolplt/wxmacmolplt-7.7-43-g9a46f7a/src/
H A DSurfaceBase.cpp1067 for (int ivertex=0; ivertex<8; ivertex++) in Contour3DGrid() local
1068 if (TestPoint[ivertex] > 0.0) index += (1<<ivertex); in Contour3DGrid()
/dports/net-p2p/py-vertex/Vertex-0.3.1/vertex/
H A Dq2q.py42 from vertex import endpoint, ivertex
1369 ivertex.IQ2QUser)
1921 implements(ivertex.IQ2QUser)
1950 assert interface is ivertex.IQ2QUser, (
/dports/math/dune-uggrid/dune-uggrid-bc2d1229420367563410ce9e519f5ff82b45266f/dune/uggrid/gm/
H A Dgm.doc591 struct ivertex { // inner vertex structure
624 struct ivertex iv;
636 The VERTEX is a union of inner vertex ivertex and boundary vertex bvertex.
637 The bvertex has all of the ivertex plus some extra information where
H A Dgm.h521 struct ivertex { struct
618 struct ivertex iv;
H A Dugm.cc365 pv = (VERTEX*)GetMemoryForObject(MYMG(theGrid),sizeof(struct ivertex),IVOBJ); in CreateInnerVertex()
3255 PutFreeObject(MYMG(theGrid),theVertex,sizeof(struct ivertex),IVOBJ); in DisposeVertex()
/dports/science/py-scipy/scipy-1.7.1/scipy/spatial/
H A Dqhull.pyx1903 cdef int isimplex, k, ivertex, nsimplex, ndim
1927 ivertex = simplices[isimplex, k]
1928 if arr[ivertex] == -1:
1929 arr[ivertex] = isimplex