Home
last modified time | relevance | path

Searched refs:E2E (Results 1 – 25 of 1433) sorted by relevance

12345678910>>...58

/dports/graphics/instant-meshes/instant-meshes-0.0-42-g4a083f4/src/
H A Dsubdivide.cpp18 void subdivide(MatrixXu &F, MatrixXf &V, VectorXu &V2E, VectorXu &E2E, in subdivide() argument
50 uint32_t other = E2E[i]; in subdivide()
55 SHOW_PROGRESS_RANGE(range, E2E.size(), "Subdividing mesh (1/2)"); in subdivide()
85 uint32_t e0 = edge.first, e1 = E2E[e0]; in subdivide()
115 E2E.conservativeResize(F.cols()*3); in subdivide()
127 const uint32_t e0p = E2E[dedge_prev_3(e0)], in subdivide()
128 e0n = E2E[dedge_next_3(e0)]; in subdivide()
130 #define sE2E(a, b) E2E[a] = b; if (b != INVALID) E2E[b] = a; in subdivide()
138 const uint32_t e1p = E2E[dedge_prev_3(e1)], in subdivide()
139 e1n = E2E[dedge_next_3(e1)]; in subdivide()
[all …]
H A Dbatch.cpp101 VectorXu V2E, E2E; in batch_process() local
107 build_dedge(F, V, V2E, E2E, boundary, nonManifold); in batch_process()
108 …subdivide(F, V, V2E, E2E, boundary, nonManifold, std::min(scale/2, (Float) stats.mAverageEdgeLengt… in batch_process()
112 build_dedge(F, V, V2E, E2E, boundary, nonManifold); in batch_process()
115 adj = generate_adjacency_matrix_uniform(F, V2E, E2E, nonManifold); in batch_process()
119 … generate_crease_normals(F, V, V2E, E2E, boundary, nonManifold, creaseAngle, N, crease_in); in batch_process()
121 generate_smooth_normals(F, V, V2E, E2E, nonManifold, N); in batch_process()
124 compute_dual_vertex_areas(F, V, V2E, E2E, nonManifold, A); in batch_process()
126 mRes.setE2E(std::move(E2E)); in batch_process()
142 if (mRes.E2E()[i] == INVALID) { in batch_process()
H A Ddedge.cpp17 VectorXu &E2E, VectorXb &boundary, VectorXb &nonManifold, in build_dedge() argument
63 E2E.resize(F.cols() * deg); in build_dedge()
64 E2E.setConstant(INVALID); in build_dedge()
94 E2E[edge_id_cur] = edge_id_opp; in build_dedge()
95 E2E[edge_id_opp] = edge_id_cur; in build_dedge()
129 uint32_t prevEdge = E2E[dedge_prev(edge, deg)]; in build_dedge()
H A Dnormal.h27 const VectorXu &V2E, const VectorXu &E2E,
33 const VectorXu &E2E, const VectorXb boundary,
40 const MatrixXu &F, const MatrixXf &V, const VectorXu &V2E, const VectorXu &E2E,
H A Dsmoothcurve.h28 extern bool smooth_curve(const BVH *bvh, const VectorXu &E2E,
31 extern bool astar(const MatrixXu &F, const VectorXu &E2E, const MatrixXf &V,
H A Dadjacency.cpp25 const MatrixXu &F, const VectorXu &V2E, const VectorXu &E2E, in generate_adjacency_matrix_uniform() argument
43 uint32_t opp = E2E[edge]; in generate_adjacency_matrix_uniform()
79 uint32_t opp = E2E[edge], next = dedge_next_3(opp); in generate_adjacency_matrix_uniform()
102 const VectorXu &V2E, const VectorXu &E2E, in generate_adjacency_matrix_cotan() argument
121 uint32_t opp = E2E[edge]; in generate_adjacency_matrix_cotan()
169 uint32_t opp = E2E[dedge_prev_3(edge)]; in generate_adjacency_matrix_cotan()
184 uint32_t opp = E2E[edge], next = dedge_next_3(opp); in generate_adjacency_matrix_cotan()
H A Dnormal.cpp88 const VectorXu &E2E, const VectorXb &nonManifold, in generate_smooth_normals() argument
147 uint32_t opp = E2E[edge]; in generate_smooth_normals()
168 const VectorXu &E2E, const VectorXb boundary, in generate_crease_normals() argument
219 uint32_t opp = E2E[edge]; in generate_crease_normals()
274 uint32_t opp = E2E[edge]; in generate_crease_normals()
316 const VectorXu &_V2E, const VectorXu &E2E, in generate_crease_normals() argument
367 uint32_t opp = E2E[edge]; in generate_crease_normals()
415 uint32_t opp = E2E[edge]; in generate_crease_normals()
H A Dadjacency.h56 const VectorXu &E2E, const VectorXb &nonManifold,
61 const VectorXu &E2E, const VectorXb &nonManifold,
H A Dreorder.cpp25 VectorXu V2E, E2E; in reorder_mesh() local
27 build_dedge(F, V_vec[0], V2E, E2E, boundary, nonManifold, progress, true); in reorder_mesh()
82 uint32_t edge_other = E2E[f_old * F.rows() + i]; in reorder_mesh()
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/src/
H A Dsubdivide.cpp26 int other = E2E[i]; in subdivide()
95 const int e0p = E2E[dedge_prev_3(e0)], e0n = E2E[dedge_next_3(e0)]; in subdivide()
98 E2E[a] = b; \ in subdivide()
99 if (b != -1) E2E[b] = a; in subdivide()
107 const int e1p = E2E[dedge_prev_3(e1)], e1n = E2E[dedge_next_3(e1)]; in subdivide()
145 E2E.conservativeResize(nF * 3); in subdivide()
208 int other = E2E[i]; in subdivide_edgeDiff()
442 const int e0p = E2E[dedge_prev_3(e0)], e0n = E2E[dedge_next_3(e0)]; in subdivide_edgeDiff()
445 E2E[a] = b; \ in subdivide_edgeDiff()
446 if (b != -1) E2E[b] = a; in subdivide_edgeDiff()
[all …]
H A Ddedge.cpp85 E2E.resize(F.cols() * deg); in compute_direct_graph()
86 E2E.setConstant(INVALID); in compute_direct_graph()
113 E2E[edge_id_cur] = edge_id_opp; in compute_direct_graph()
114 E2E[edge_id_opp] = edge_id_cur; in compute_direct_graph()
143 uint32_t prevEdge = E2E[dedge_prev(edge, deg)]; in compute_direct_graph()
180 deid = E2E[deid]; in compute_direct_graph()
203 E2E.clear(); in compute_direct_graph_quad()
257 E2E.resize(F.size() * deg, INVALID); in compute_direct_graph_quad()
284 E2E[edge_id_cur] = edge_id_opp; in compute_direct_graph_quad()
285 E2E[edge_id_opp] = edge_id_cur; in compute_direct_graph_quad()
[all …]
H A Dparametrizer-mesh.cpp71 subdivide(F, V, rho, V2E, E2E, boundary, nonManifold, target_len); in Initialize()
74 while (!compute_direct_graph(V, F, V2E, E2E, boundary, nonManifold)) in Initialize()
76 generate_adjacency_matrix_uniform(F, V2E, E2E, nonManifold, adj); in Initialize()
102 hierarchy.mE2E = std::move(E2E); in Initialize()
129 int re = E2E[i]; in ComputeSharpEdges()
150 int re = E2E[e]; in ComputeSharpEdges()
163 auto& E2E = hierarchy.mE2E; in ComputeSharpO() local
219 sharp_edges[E2E[i * 3 + j]] = 1; in ComputeSharpO()
259 edge = E2E[edge]; in ComputeSmoothNormal()
279 int opp = E2E[edge]; in ComputeSmoothNormal()
[all …]
H A Ddedge.hpp16 VectorXi& E2E, VectorXi& boundary, VectorXi& nonManifold);
19 std::vector<int>& E2E, VectorXi& boundary, VectorXi& nonManifold);
H A Dsubdivide.hpp9 void subdivide(MatrixXi &F, MatrixXd &V, VectorXd& rho, VectorXi &V2E, VectorXi &E2E, VectorXi &bou…
13 VectorXi &V2E, VectorXi &E2E, VectorXi &boundary, VectorXi &nonmanifold,
H A Dadjacent-matrix.cpp9 const MatrixXi &F, const VectorXi &V2E, const VectorXi &E2E, in generate_adjacency_matrix_uniform() argument
22 int opp = E2E[edge], next = dedge_next_3(opp); in generate_adjacency_matrix_uniform()
H A Dparametrizer-flip.cpp273 std::vector<int> E2E(F2E.size() * 3, -1); in BuildTriangleManifold() local
286 E2E[t1] = (v2 == -1) ? -1 : t2; in BuildTriangleManifold()
288 E2E[t2] = (v1 == -1) ? -1 : t1; in BuildTriangleManifold()
308 deid = E2E[deid / 3 * 3 + (deid + 2) % 3]; in BuildTriangleManifold()
313 deid = E2E[deid]; in BuildTriangleManifold()
332 int t = E2E[i * 3 + j]; in BuildTriangleManifold()
333 if (t != -1) E2E[t] = -1; in BuildTriangleManifold()
336 E2E[i * 3 + j] = -1; in BuildTriangleManifold()
355 deid = E2E[deid]; in BuildTriangleManifold()
360 deid = E2E[deid]; in BuildTriangleManifold()
/dports/net/ooni-probe-cli/probe-cli-3.10.1/.github/workflows/
H A Ddebianrepo.yml14 - run: ./E2E/debian.sh docker i386
20 - run: ./E2E/debian.sh docker amd64
28 - run: ./E2E/debian.sh docker armhf
36 - run: ./E2E/debian.sh docker arm64
H A Dlinux.yml14 - run: ./E2E/ooniprobe.sh ./CLI/linux/386/ooniprobe
26 - run: ./E2E/ooniprobe.sh ./CLI/linux/amd64/ooniprobe
40 - run: ./E2E/ooniprobe.sh ./CLI/linux/arm/ooniprobe
54 - run: ./E2E/ooniprobe.sh ./CLI/linux/arm64/ooniprobe
/dports/misc/netron/node_modules/dmg-builder/out/
H A DlicenseDefaultButtons.js.map1 …E2E\"\n $\"2E2E E74B 6C69 636B 656E 2053 6965 2069\"\n $\"6E20 D241 6B7A 6570 7469 6572 656E D32…
/dports/biology/ugene/ugene-40.1/src/corelibs/U2Lang/src/model/
H A DQDConstraint.cpp91 if (type == E2E) { in getInvertedType()
95 return E2E; in getInvertedType()
161 case E2E: { in match()
200 case E2E: in matchLocation()
221 case E2E: in matchLocation()
H A DQDScheme.cpp473 if (nextDc->distanceType() == E2S || nextDc->distanceType() == E2E) { in toConstraint()
487 if (nextDc->distanceType() == S2E || nextDc->distanceType() == E2E) { in toConstraint()
511 if (nextDc->distanceType() == E2S || nextDc->distanceType() == E2E) { in toConstraint()
524 if (curDc->distanceType() == E2S || curDc->distanceType() == E2E) { in toConstraint()
530 if (nextDc->distanceType() == S2E || nextDc->distanceType() == E2E) { in toConstraint()
561 distType = E2E; in toConstraint()
576 distType = E2E; in toConstraint()
590 if (lastDc->distanceType() == E2S || lastDc->distanceType() == E2E) { in toConstraint()
591 distType = E2E; in toConstraint()
608 distType = E2E; in toConstraint()
/dports/audio/py-music21/music21-7.1.0/music21/corpus/ryansMammoth/
H A DMaggieBrownsFavoriteJig.abc10 | dBG GAB | E2E E2c | AFD DEF | G2G G2g \
11 | dBG Bcd | E2E E2c | AFD DEF | G3- G2 :|
/dports/devel/sdl12/SDL-1.2.15/VisualC/tests/
H A Dtests.sln9 …1-00A0C91BC942}") = "testgamma", "testgamma\testgamma.vcproj", "{D974A0DF-3E2E-445C-A2EB-E899E9B58…
45 {D974A0DF-3E2E-445C-A2EB-E899E9B582CB}.Debug|Win32.ActiveCfg = Debug|Win32
46 {D974A0DF-3E2E-445C-A2EB-E899E9B582CB}.Debug|Win32.Build.0 = Debug|Win32
47 {D974A0DF-3E2E-445C-A2EB-E899E9B582CB}.Release|Win32.ActiveCfg = Release|Win32
48 {D974A0DF-3E2E-445C-A2EB-E899E9B582CB}.Release|Win32.Build.0 = Release|Win32
/dports/www/grafana8/grafana-8.3.6/contribute/style-guides/
H A De2e-plugins.md3 Be sure that you've read the [generalized E2E document](e2e.md).
7 - `yarn test:e2e` will run [Grafana's E2E utility](../../packages/grafana-e2e) against an already r…
/dports/sysutils/kubectl/kubernetes-1.22.2/test/e2e/node/
H A DREADME.md9 and Node E2E test jobs. Tests in `${KUBE_ROOT}/test/e2e_node` are exclusively
10 owned by Node E2E. *If you want to add a test, most likely than not, you want

12345678910>>...58