Home
last modified time | relevance | path

Searched refs:edgelength (Results 1 – 25 of 51) sorted by relevance

123

/dports/cad/calculix-ccx/CalculiX/ccx_2.18/src/
H A Dmeshquality.f36 & edgelength(6),hmax,radius local
84 edgelength(j)=dsqrt((cotet(1,n1)-cotet(1,n2))**2+
91 hmax=maxval(edgelength)
145 edgelength(j)=dsqrt((cotet(1,n1)-cotet(1,n2))**2+
152 hmax=maxval(edgelength)
H A Dmeshqualitycavity.f37 & edgelength(6),hmax,radius local
84 edgelength(j)=dsqrt((cotet(1,n1)-cotet(1,n2))**2+
91 hmax=maxval(edgelength)
H A Dfuvertex.f32 & edgelength(6),radius,hmax,quality
90 edgelength(j)=dsqrt((cotet(1,n1)-cotet(1,n2))**2+
97 hmax=maxval(edgelength)
H A Dfumid.f36 & edgelength(6),radius,hmax,quality,xi,et,ze,shp(4,10),xsj, local
130 edgelength(j)=dsqrt((cotet(1,n1)-cotet(1,n2))**2+
137 hmax=maxval(edgelength)
/dports/graphics/mirtk/MIRTK-2.0.0-122-g38210fa/Documentation/commands/
H A Dremesh-surface.rst46 .. option:: -edgelength <float>...
50 .. option:: -min-edgelength <float>...
54 .. option:: -max-edgelength <float>...
58 .. option:: -adaptive-edgelength <name>
H A Dremesh.rst46 .. option:: -edgelength <float>...
50 .. option:: -min-edgelength <float>...
54 .. option:: -max-edgelength <float>...
58 .. option:: -adaptive-edgelength <name>
H A Dinfo.rst73 .. option:: -edgelength
/dports/cad/sumo/sumo-1.2.0/tools/contributed/sumopy/coremodules/demand/
H A Dorigin_to_destination.py476 edgelength = edgelengths[id_edge_orig]
479 0.1*edgelength, 0.9*edgelength, 1)[0]
481 pos_depart = 0.1*edgelength
484 edgelength = edgelengths[id_edge_dest]
487 0.1*edgelength, 0.9*edgelength, 1)[0]
489 pos_arrival = 0.9*edgelength
/dports/graphics/blender/blender-2.91.0/release/scripts/addons/add_mesh_geodesic_domes/
H A Dgeodesic_classes_271.py59 self.edgelength = None
402 self.edgelength = []
432 self.edgelength = []
460 self.edgelength = []
498 self.edgelength = []
535 self.edgelength = []
573 self.edgelength = []
639 self.edgelength = []
705 self.edgelength = []
771 self.edgelength = []
/dports/games/hyperrogue/hyperrogue-12.0f/
H A Darchimedean.cpp59 ld edgelength; member
420 edgelength = 2 * M_PI / faces[0]; in compute_geometry()
432 edgelength = M_PI; in compute_geometry()
439 edgelength = (elmin + elmax) / 2; in compute_geometry()
449 c = asin_auto(sin_auto(edgelength/2) / sin(gamma)); in compute_geometry()
464 if(isnan(alpha_total)) elmax = edgelength; in compute_geometry()
465 else if(sphere ^ (alpha_total > total)) elmin = edgelength; in compute_geometry()
466 else elmax = edgelength; in compute_geometry()
480 triangles[2*N].emplace_back(alphas[(k+1)%N], edgelength); in compute_geometry()
481 triangles[2*N+1].emplace_back(alphas[N-1-k], edgelength); in compute_geometry()
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/geom2d/
H A Dgenmesh2d.cpp27 double edgelength, edgelengthold; in Partition() local
55 edgelength = i*dt + (frac-1)*dt; in Partition()
57 mark = spline.GetPoint (edgelength); in Partition()
115 seg.epgeominfo[1].dist = edgelength; in Partition()
122 edgelengthold = edgelength; in Partition()
/dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/geom2d/
H A Dspline2d.cpp56 double edgelength, edgelengthold; in Partition() local
86 edgelength = i*dt + (frac-1)*dt; in Partition()
136 seg.epgeominfo[1].dist = edgelength; in Partition()
143 edgelengthold = edgelength; in Partition()
H A Dspline.hpp306 double edgelength, edgelengthold; in Partition() local
336 edgelength = i*dt + (frac-1)*dt; in Partition()
386 seg.epgeominfo[1].dist = edgelength; in Partition()
393 edgelengthold = edgelength; in Partition()
/dports/cad/sumo/sumo-1.2.0/tools/contributed/sumopy/coremodules/network/
H A Dpublictransportnet.py214 edgelength = edges.lengths[lanes.ids_edge[id_lane]]
222 if pos_to_new > edgelength-pos_from_min:
223 self.positions_to[id_stop] = edgelength-pos_from_min
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/elki-index-mtree/src/main/java/de/lmu/ifi/dbs/elki/index/tree/metrical/mtreevariants/strategies/split/
H A DMSTSplit.java135 final double len = edgelength(matrix, edges, omit); in mstPartition()
182 private static double edgelength(double[][] matrix, int[] edges, int i) { in edgelength() method in MSTSplit
/dports/cad/netgen/netgen-6.2.2105/libsrc/geom2d/
H A Dgenmesh2d.cpp117 double edgelength, edgelengthold; in Partition() local
138 edgelength = i*dt + (frac-1)*dt; in Partition()
139 mark = spline.GetPoint (edgelength); in Partition()
181 seg.epgeominfo[1].dist = edgelength; in Partition()
188 edgelengthold = edgelength; in Partition()
/dports/cad/impact/Impact/src/j3d/
H A D_NurbSurface.java68 public float[] edgelength; field in _NurbSurface
216 edgelength = new float[4]; in generate()
223 …edgelength[0] = this.generateRefinedCurve(geomBDB, numUControlPoints, uorder, uknots, numVControlP… in generate()
224 …edgelength[1] = this.generateRefinedCurve(geomBDB, numUControlPoints, uorder, uknots, numVControlP… in generate()
225 …edgelength[2] = this.generateRefinedCurve(geomBDB, numUControlPoints, uorder, uknots, numVControlP… in generate()
226 …edgelength[3] = this.generateRefinedCurve(geomBDB, numUControlPoints, uorder, uknots, numVControlP… in generate()
364 mesh_div[i] = (int)(edgelength[i] / mesh_size); in mesh()
/dports/math/ogdf/OGDF/include/ogdf/misclayout/
H A DBertaultLayout.h93 double edgelength(GraphAttributes &GA);
/dports/cad/openroad/OpenROAD-2.0/src/grt/src/fastroute/src/
H A Dutility.cpp884 int i, netID, edgeID, nodeID, edgelength; in checkRoute3D() local
907 edgelength = treeedge->route.routelen; in checkRoute3D()
934 if (gridsX[edgelength] != x2 || gridsY[edgelength] != y2) { in checkRoute3D()
1284 int i, edgeID, edgelength; in checkRoute2DTree() local
1295 edgelength = treeedge->route.routelen; in checkRoute2DTree()
1335 if (gridsX[edgelength] != x2 || gridsY[edgelength] != y2) { in checkRoute2DTree()
1342 gridsY[edgelength], in checkRoute2DTree()
1343 gridsX[edgelength], in checkRoute2DTree()
H A Dmaze.cpp57 int i, edgeID, edgelength; in convertToMazerouteNet() local
66 edgelength = treeedge->len; in convertToMazerouteNet()
73 treeedge->route.gridsX = (short*) calloc((edgelength + 1), sizeof(short)); in convertToMazerouteNet()
74 treeedge->route.gridsY = (short*) calloc((edgelength + 1), sizeof(short)); in convertToMazerouteNet()
196 treeedge->route.routelen = edgelength; in convertToMazerouteNet()
/dports/cad/sumo/sumo-1.2.0/tools/contributed/sumopy/coremodules/landuse/
H A Dlanduse.py1097 edgelength = edges.lengths[id_edge]
1119 if pos_min > edgelength:
1120 pos_min = edgelength
1844 for id_edge, edgelength, id_fromnode, id_tonode, shape, edgewidth\
1876 while pos < edgelength:
1888 if pos21 < edgelength:
/dports/math/py-GridDataFormats/GridDataFormats-0.6.0/gridData/
H A Dcore.py282 edgelength = 2 + \
285 smidpoints[:, 0] - 0.5 * newspacing, smidpoints[:, -1] + 0.5 * newspacing, edgelength)]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Netgen/libsrc/meshing/
H A Dbisect.cpp576 Array<double> edgelength(cntedges); in BTSortEdges() local
588 edgelength.Elem (i) = elen; in BTSortEdges()
654 if (edgelength.Get(i) < edgelength.Get(eclasses.Get(i))) in BTSortEdges()
655 edgelength.Elem(eclasses.Get(i)) = edgelength.Get(i); in BTSortEdges()
656 edgelength.Elem(i) = 1e20; in BTSortEdges()
669 QuickSort (edgelength, sorted); in BTSortEdges()
/dports/science/elmerfem/elmerfem-release-9.0/ElmerGUI/netgen/libsrc/meshing/
H A Dbisect.cpp572 ARRAY<double> edgelength(cntedges); in BTSortEdges() local
584 edgelength.Elem (i) = elen; in BTSortEdges()
650 if (edgelength.Get(i) < edgelength.Get(eclasses.Get(i))) in BTSortEdges()
651 edgelength.Elem(eclasses.Get(i)) = edgelength.Get(i); in BTSortEdges()
652 edgelength.Elem(i) = 1e20; in BTSortEdges()
665 QickSort (edgelength, sorted); in BTSortEdges()
/dports/cad/netgen/netgen-6.2.2105/libsrc/meshing/
H A Dbisect.cpp588 NgArray<double> edgelength(cntedges); in BTSortEdges() local
600 edgelength.Elem (i) = elen; in BTSortEdges()
666 if (edgelength.Get(i) < edgelength.Get(eclasses.Get(i))) in BTSortEdges()
667 edgelength.Elem(eclasses.Get(i)) = edgelength.Get(i); in BTSortEdges()
668 edgelength.Elem(i) = 1e20; in BTSortEdges()
681 QuickSort (edgelength, sorted); in BTSortEdges()

123