Home
last modified time | relevance | path

Searched refs:V2E (Results 1 – 25 of 60) sorted by relevance

123

/dports/graphics/blender/blender-2.91.0/extern/quadriflow/src/
H A Ddedge.cpp32 V2E.resize(V.cols()); in compute_direct_graph()
33 V2E.setConstant(INVALID); in compute_direct_graph()
69 if (V2E[idx_cur] == -1) in compute_direct_graph()
128 uint32_t edge = V2E[i]; in compute_direct_graph()
135 V2E[i] = INVALID; in compute_direct_graph()
153 V2E[i] = v2e; in compute_direct_graph()
202 V2E.clear(); in compute_direct_graph_quad()
206 V2E.resize(V.size(), INVALID); in compute_direct_graph_quad()
299 uint32_t edge = V2E[i]; in compute_direct_graph_quad()
306 V2E[i] = INVALID; in compute_direct_graph_quad()
[all …]
H A Dadjacent-matrix.cpp9 const MatrixXi &F, const VectorXi &V2E, const VectorXi &E2E, in generate_adjacency_matrix_uniform() argument
11 adj.resize(V2E.size()); in generate_adjacency_matrix_uniform()
16 int start = V2E[i]; in generate_adjacency_matrix_uniform()
H A Dsubdivide.cpp67 V2E.conservativeResize(V.cols()); in subdivide()
117 V2E[v0] = 3 * f0 + 2; in subdivide()
118 V2E[vn] = 3 * f0 + 0; in subdivide()
119 V2E[v1] = 3 * f3 + 1; in subdivide()
120 V2E[v0p] = 3 * f0 + 1; in subdivide()
142 V2E.conservativeResize(nV); in subdivide()
463 V2E[v0] = 3 * f0 + 2; in subdivide_edgeDiff()
464 V2E[vn] = 3 * f0 + 0; in subdivide_edgeDiff()
465 V2E[v1] = 3 * f3 + 1; in subdivide_edgeDiff()
466 V2E[v0p] = 3 * f0 + 1; in subdivide_edgeDiff()
[all …]
H A Ddedge.hpp15 bool compute_direct_graph(MatrixXd& V, MatrixXi& F, VectorXi& V2E,
18 …ompute_direct_graph_quad(std::vector<Vector3d>& V, std::vector<Vector4i>& F, std::vector<int>& V2E,
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 Dparametrizer-mesh.cpp69 while (!compute_direct_graph(V, F, V2E, E2E, boundary, nonManifold)) in Initialize()
71 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()
247 for (int i = 0; i < V2E.rows(); ++i) { in ComputeSmoothNormal()
248 int edge = V2E[i]; in ComputeSmoothNormal()
298 for (int i = 0; i < V2E.size(); ++i) { in ComputeVertexArea()
299 int edge = V2E[i], stop = edge; in ComputeVertexArea()
H A Dparametrizer.hpp99 VectorXi V2E; member in qflow::Parametrizer
171 extern void generate_adjacency_matrix_uniform(const MatrixXi& F, const VectorXi& V2E,
H A Dlocalsat.cpp169 const VectorXi &V2E, const VectorXi &E2E) { in ExportLocalSat() argument
180 std::vector<bool> mark_vertex(V2E.size(), false); in ExportLocalSat()
251 int e0 = V2E(vertex); in ExportLocalSat()
271 printf("[SAT] Mark %d vertices out of %d\n", mark_count, (int)V2E.size()); in ExportLocalSat()
H A Dpost-solver.hpp58 MatrixXd& Q, MatrixXd& O, MatrixXi& F, VectorXi& V2E, VectorXi& E2E,
H A Dlocalsat.hpp27 const VectorXi &V2E, const VectorXi &E2E);
H A Dparametrizer.cpp83 subdivide_edgeDiff(F, V, N, Q, O, &hierarchy.mS[0], V2E, hierarchy.mE2E, boundary, nonManifold, in ComputeIndexMap()
102 subdivide_edgeDiff(F, V, N, Q, O, &hierarchy.mS[0], V2E, hierarchy.mE2E, boundary, nonManifold, in ComputeIndexMap()
/dports/graphics/instant-meshes/instant-meshes-0.0-42-g4a083f4/src/
H A Ddedge.cpp16 void build_dedge(const MatrixXu &F, const MatrixXf &V, VectorXu &V2E, in build_dedge() argument
28 V2E.resize(V.cols()); in build_dedge()
29 V2E.setConstant(INVALID); in build_dedge()
48 if (!atomicCompareAndExchange(&V2E[idx_cur], edge_id, INVALID)) { in build_dedge()
49 uint32_t idx = V2E[idx_cur]; in build_dedge()
78 uint32_t it = V2E[idx_next], edge_id_opp = INVALID; in build_dedge()
114 uint32_t edge = V2E[i]; in build_dedge()
121 V2E[i] = INVALID; in build_dedge()
139 V2E[i] = v2e; in build_dedge()
H A Dadjacency.cpp25 const MatrixXu &F, const VectorXu &V2E, const VectorXu &E2E, in generate_adjacency_matrix_uniform() argument
27 VectorXu neighborhoodSize(V2E.size() + 1); in generate_adjacency_matrix_uniform()
33 tbb::blocked_range<uint32_t>(0u, (uint32_t) V2E.size(), GRAIN_SIZE), in generate_adjacency_matrix_uniform()
36 uint32_t edge = V2E[i], stop = edge; in generate_adjacency_matrix_uniform()
61 AdjacencyMatrix adj = new Link*[V2E.size() + 1]; in generate_adjacency_matrix_uniform()
71 uint32_t edge = V2E[i], stop = edge; in generate_adjacency_matrix_uniform()
102 const VectorXu &V2E, const VectorXu &E2E, in generate_adjacency_matrix_cotan() argument
105 VectorXu neighborhoodSize(V2E.size() + 1); in generate_adjacency_matrix_cotan()
114 uint32_t edge = V2E[i], stop = edge; in generate_adjacency_matrix_cotan()
139 AdjacencyMatrix adj = new Link*[V2E.size() + 1]; in generate_adjacency_matrix_cotan()
[all …]
H A Dsubdivide.cpp18 void subdivide(MatrixXu &F, MatrixXf &V, VectorXu &V2E, VectorXu &E2E, in subdivide() argument
99 V2E.conservativeResize(V.cols()); in subdivide()
149 V2E[v0] = 3*f0 + 2; in subdivide()
150 V2E[vn] = 3*f0 + 0; in subdivide()
151 V2E[v1] = 3*f3 + 1; in subdivide()
152 V2E[v0p] = 3*f0 + 1; in subdivide()
154 V2E[v1p] = 3*f1 + 2; in subdivide()
173 V2E.conservativeResize(nV); in subdivide()
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()
H A Dnormal.h27 const VectorXu &V2E, const VectorXu &E2E,
32 generate_crease_normals(MatrixXu &F, MatrixXf &V, const VectorXu &V2E,
40 const MatrixXu &F, const MatrixXf &V, const VectorXu &V2E, const VectorXu &E2E,
H A Dnormal.cpp87 void generate_smooth_normals(const MatrixXu &F, const MatrixXf &V, const VectorXu &V2E, in generate_smooth_normals() argument
127 uint32_t edge = V2E[i]; in generate_smooth_normals()
180 VectorXu V2E(_V2E); in generate_crease_normals() local
213 uint32_t edge = V2E[i], stop = edge; in generate_crease_normals()
233 V2E[i] = creaseEdge; in generate_crease_normals()
252 uint32_t edge = V2E[i]; in generate_crease_normals()
328 VectorXu V2E(_V2E); in generate_crease_normals() local
362 uint32_t edge = V2E[i], stop = edge; in generate_crease_normals()
380 V2E[i] = creaseEdge; in generate_crease_normals()
395 uint32_t edge = V2E[i]; in generate_crease_normals()
H A Dadjacency.h55 const MatrixXu &F, const VectorXu &V2E,
60 const MatrixXu &F, const MatrixXf &V, const VectorXu &V2E,
H A Dsubdivide.h19 extern void subdivide(MatrixXu &F, MatrixXf &V, VectorXu &V2E, VectorXu &E2E,
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()
H A Dmeshstats.h39 const MatrixXu &F, const MatrixXf &V, const VectorXu &V2E,
H A Ddedge.h28 extern void build_dedge(const MatrixXu &F, const MatrixXf &V, VectorXu &V2E,
H A Dmeshstats.cpp106 const VectorXu &V2E, const VectorXu &E2E, in compute_dual_vertex_areas() argument
119 uint32_t edge = V2E[i], stop = edge; in compute_dual_vertex_areas()
/dports/science/openbabel/openbabel-3.1.1/test/pdb_ligands_sdf/
H A D4lce_kmt.sdf3 Coordinates from PDB:1V2E:A:520 Model:1 without hydrogens
48 1V2E
/dports/graphics/wings/wings-8d019ebe48/src/
H A Dwings_edge_cmd.erl610 {V1id,V1E,V2id,V2E,E1,E2,MyN} = find_edge(Edge,Es),
614 slide_dir(R,Es,Up,Dw,N,[{V1id,V1E},{V2id,V2E}|Acc]);
621 {V2,V2E,V1,V1E,E2,E1,N} ->
622 {V1,swap(V1E),V2,swap(V2E),E1,E2,N}

123