/dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/update/ |
H A D | topology.h | 303 …(*vi).VFi() = 0; // note that (0,-1) means uninitiazlied while 0,0 is the valid initialized values… in VertexFace() 312 (*fi).VFi(j) = (*fi).V(j)->VFi(); in VertexFace() 314 (*fi).V(j)->VFi() = j; in VertexFace() 466 vcg::face::VFIterator<FaceType> VFi; in TestVertexFace() local 475 VFi.f=vi->VFp(); in TestVertexFace() 476 VFi.z=vi->VFi(); in TestVertexFace() 477 while (!VFi.End()) in TestVertexFace() 480 assert(!VFi.F()->IsD()); in TestVertexFace() 481 assert((VFi.F()->V(VFi.I()))==&(*vi)); in TestVertexFace() 482 ++VFi; in TestVertexFace()
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/libigl/igl/ |
H A D | cut_mesh.cpp | 32 const std::vector<std::vector<VFType> >& VFi; member in igl::MeshCutterMini 100 VFi(_VFi), in MeshCutterMini() 115 edge = VFi[v][0]; // edge=v->cVFi(); in FirstPos() 238 int indexE = VFi[vert][0]; in InitMappingSeam() 268 const std::vector<std::vector<VFType> >& VFi, in cut_mesh() 277 …igl::MeshCutterMini<DerivedV, DerivedF, VFType, DerivedTT, DerivedC> mc(V, F, TT, TTi, VF, VFi, V_… in cut_mesh() 313 std::vector<std::vector<int> > VF, VFi; in cut_mesh() local 314 igl::vertex_triangle_adjacency(V,F,VF,VFi); in cut_mesh() 321 igl::cut_mesh(V, F, VF, VFi, TT, TTi, V_border, cuts, Vcut, Fcut); in cut_mesh()
|
H A D | vertex_triangle_adjacency.cpp | 16 std::vector<std::vector<VFiType> >& VFi) in vertex_triangle_adjacency() 19 VFi.clear(); in vertex_triangle_adjacency() 22 VFi.resize(n); in vertex_triangle_adjacency() 30 VFi[F(fi,i)].push_back(i); in vertex_triangle_adjacency() 41 std::vector<std::vector<IndexType> >& VFi) in vertex_triangle_adjacency() 43 return vertex_triangle_adjacency(V.rows(),F,VF,VFi); in vertex_triangle_adjacency()
|
H A D | per_corner_normals.cpp | 25 vector<vector<int> > VF,VFi; in per_corner_normals() local 26 vertex_triangle_adjacency(V,F,VF,VFi); in per_corner_normals() 44 vector<vector<int> > VF,VFi; in per_corner_normals() local 45 vertex_triangle_adjacency(V,F,VF,VFi); in per_corner_normals()
|
H A D | vertex_triangle_adjacency.h | 39 std::vector<std::vector<VFiType> >& VFi); 45 std::vector<std::vector<IndexType> >& VFi);
|
H A D | boundary_loop.cpp | 28 vector<std::vector<int> > VF, VFi; in boundary_loop() local 30 vertex_triangle_adjacency(Vdummy,F,VF,VFi); in boundary_loop()
|
H A D | line_field_missmatch.cpp | 41 std::vector<std::vector<int> > VFi; member in igl::MissMatchCalculatorLine 96 igl::vertex_triangle_adjacency(V,F,VF,VFi); in MissMatchCalculatorLine()
|
H A D | cross_field_missmatch.cpp | 39 std::vector<std::vector<int> > VFi; member in igl::MissMatchCalculator 93 igl::vertex_triangle_adjacency(V,F,VF,VFi); in MissMatchCalculator()
|
/dports/graphics/wings/libigl-2.1.0/include/igl/ |
H A D | cut_mesh.cpp | 32 const std::vector<std::vector<VFType> >& VFi; member in igl::MeshCutterMini 100 VFi(_VFi), in MeshCutterMini() 115 edge = VFi[v][0]; // edge=v->cVFi(); in FirstPos() 238 int indexE = VFi[vert][0]; in InitMappingSeam() 268 const std::vector<std::vector<VFType> >& VFi, in cut_mesh() 277 …igl::MeshCutterMini<DerivedV, DerivedF, VFType, DerivedTT, DerivedC> mc(V, F, TT, TTi, VF, VFi, V_… in cut_mesh() 313 std::vector<std::vector<int> > VF, VFi; in cut_mesh() local 314 igl::vertex_triangle_adjacency(V,F,VF,VFi); in cut_mesh() 321 igl::cut_mesh(V, F, VF, VFi, TT, TTi, V_border, cuts, Vcut, Fcut); in cut_mesh()
|
H A D | per_corner_normals.cpp | 25 vector<vector<int> > VF,VFi; in per_corner_normals() local 26 vertex_triangle_adjacency(V.rows(),F,VF,VFi); in per_corner_normals() 44 vector<vector<int> > VF,VFi; in per_corner_normals() local 45 vertex_triangle_adjacency(V.rows(),F,VF,VFi); in per_corner_normals()
|
H A D | vertex_triangle_adjacency.cpp | 16 std::vector<std::vector<VFiType> >& VFi) in vertex_triangle_adjacency() 19 VFi.clear(); in vertex_triangle_adjacency() 22 VFi.resize(n); in vertex_triangle_adjacency() 30 VFi[F(fi,i)].push_back(i); in vertex_triangle_adjacency() 41 std::vector<std::vector<IndexType> >& VFi) in vertex_triangle_adjacency() 43 return vertex_triangle_adjacency(V.rows(),F,VF,VFi); in vertex_triangle_adjacency()
|
H A D | vertex_triangle_adjacency.h | 39 std::vector<std::vector<VFiType> >& VFi); 45 std::vector<std::vector<IndexType> >& VFi);
|
H A D | boundary_loop.cpp | 28 vector<std::vector<int> > VF, VFi; in boundary_loop() local 30 vertex_triangle_adjacency(Vdummy,F,VF,VFi); in boundary_loop()
|
H A D | line_field_mismatch.cpp | 41 std::vector<std::vector<int> > VFi; member in igl::MismatchCalculatorLine 96 igl::vertex_triangle_adjacency(V,F,VF,VFi); in MismatchCalculatorLine()
|
/dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/update/ |
H A D | topology.h | 472 …(*vi).VFi() = 0; // note that (0,-1) means uninitiazlied while 0,0 is the valid initialized values… in VertexFace() 481 (*fi).VFi(j) = (*fi).V(j)->VFi(); in VertexFace() 483 (*fi).V(j)->VFi() = j; in VertexFace() 632 vcg::face::VFIterator<FaceType> VFi; in TestVertexFace() local 641 VFi.f=vi->VFp(); in TestVertexFace() 642 VFi.z=vi->VFi(); in TestVertexFace() 643 while (!VFi.End()) in TestVertexFace() 646 assert(!VFi.F()->IsD()); in TestVertexFace() 647 assert((VFi.F()->V(VFi.I()))==&(*vi)); in TestVertexFace() 648 ++VFi; in TestVertexFace()
|
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/complex/algorithms/ |
H A D | edge_collapse.h | 104 for( x.f = v0->VFp(), x.z = v0->VFi(); x.f!=0; ++x) in FindSets() 117 for( x.f = v1->VFp(), x.z = v1->VFi(); x.f!=0; ++x ) in FindSets() 256 (*i).f->VFi((*i).z) = (*i).f->V((*i).z)->VFi(); in Do() 258 (*i).f->V((*i).z)->VFi() = (*i).z; in Do()
|
/dports/cad/meshlab/meshlab-Meshlab-2020.05/src/plugins_unsupported/editrgbtri/ |
H A D | topologicalOp.h | 275 f0p->V((f0i+2)%3)->VFi() = f01i; 278 f0p->V(f0i)->VFi() = (f01i+1)%3; 284 f0p->V((f0i+2)%3)->VFi() = (f00i+1)%3; 286 f0p->V(f0i)->VFi() = f00i; 296 f1p->V((f1i+2)%3)->VFi() = (f11i+1)%3; 588 v2->VFi() = f0i; 590 v1->VFi() = (f2i+1)%3; 811 int index = vp->VFi(); in VFCorrectnessP() 922 f.V((z+0)%3)->VFi() = z; in FlipEdge() 925 g->V((w+0)%3)->VFi() = w; in FlipEdge()
|
/dports/comms/hylafax/hylafax-6.0.7/config/ |
H A D | umc92144 | 6 # SG144Ui, Phonemaster 144VF and Phonemaster 144VFi. 14 # tested on CREATIX Phonemaster 144 VFi
|
/dports/math/gap/gap-4.11.0/pkg/SmallGrp-1.4.1/small7/ |
H A D | sml512.bj | 15 VFi)L9]1TDg-P>c5X }wDD%IY.Qd*M:^2UEh(K8[0SCf,O=bWj&JZ/RB+N<a3VFi)L9]1TDg-P>c\ 130 VFi)9]1TDP>c5XHk }tG%I6Y.QAd*M:2Eh(K8[0SC,=b4Wj&J7Z/RBe+N<VFi)L9]1T-P>c5XH }\ 136 I6Y.QA*M:2Uh(K8[0SC,O=b4Gj&J7Z/Be+N<VFi)L9]1TD->c" ), 148 3VFi)L9TDg-P>c5XHk }x0%I6.QAdM^2UEhK8[SCf,O=b4WGj&JZ/RBeN<3VFi)9]TDg-Pc5XHk \ 347 2UEh(K8[0SCf,=b4WGj&JZ/Be+N<3VFi)L9]1TDg>c5XHk }%2%I6Y.A*" ), 490 <3VFi)L9]1T->c5XH }w)%I6Y.Qd*M:2UEh(K8[0C,=bWGj&J7Z/RB+N<3VFi)L9]TD->c5Hk }u\ 494 Z/RBe+<3VFi)L91TD-c5XHk }oG%I6Y.QAd*M:2UEh(8[0SC=b4WGj!t%2+H" ), 498 ,=b4WGj&JZ/Be+N<3VFi)9]1TD->c5XHk }x2%6Y.AdM:2UEh(K[0SC,=b4WGjJ7Z/RBe+<3VFi)\ 674 3VFi)9]1TgP>c5XHk }t0%I6YQA*M^2Uh(K8[SfO=b4Gj&J7ZRe+Na3VF)L9]" ), 691 WGjJ7Z/Be+<3VFi)L91TD-c5XHk }%)%/%I6Y.Q*:^2" ), [all …]
|
H A D | sml512.bi | 69 VFi-P!}w22W!}u22M!}x22]!}tP/)!}wP2R!}uP2E!}xP2Z!}t&5u }w&:^(K8[0SCf,O=b4WGj<\ 150 v.f//%%I6Y(K8[0SCf,O=bWGjJ7)L9]1TDg-P>c5Hk v,w)/%%I6Y2UEh(8[,=4WG&J+<VFi)->5\ 200 VFi)9]1TDg-", 224 3VFi)L]1TDg-P>c5XHk!}t)/P }w)%I6Y.QAd*M:^2UEh(K8[0SCf,O=4WGj&J7Z/RBe+N<a3VFi\ 245 VFi)9]1TDgP>c5XHk }u)%I6Y.QAd*M:^2UEh(8[0SCf,O=b4WG&J7Z/RBe+N<a3VFi)L9]1TDg-\ 724 ^2UEh(K8[0S,O=b4WGj&J7Z/RBe+N<3VFi)L9]1TD" ), 731 RBe+N<3VFi)L9]1TD-P>c5XHk }hP%I6YQAd*M:^2UEh(K8[0SC,O=b4WGj&J7Z/Re+N<3VFi)L9\ 772 8[0SCf,O=b4Wj&J7Z/Re+N<3VFi)L9]1TD-P>cXHk }o))%I6Y.QA*M:2UEh(K8[" ), 783 N<3VFi)L9]1TD-P>c5Hk }xP%I6YQAd*M:2UEh(K8[0SC,O=b4Wj&J7Z/Be+N<3VFi)L9]1TDg-P\ 916 3VFi)L9]1TDg->c5Hk }c2%6YQAd*M:^2UEh(K8[0SCf,O=b4" ), [all …]
|
H A D | sml512.ct | 293 3VFi)L9]1TDg-P>c5XHk!}u/D<P!}x/D<P!}tMD=f!}wMD=f!}uMD<P }fMDY.QAd*M:^2UEh(K8\ 310 7!}uD77!}xD77!}t/77!}w/77!}u/77 }x/.QAd*M:^2UEh(K8[0SCf,O=b4WGj/RBe+N<3VFi)L\ 311 9]1TDg-P>c5XHk!}tM77 }wM.QAd*M:^2UEh(K8[0SCf,O=b4WGj/RBe+N<3VFi)L9]1TDg-P>c5\ 316 E7&!}wE7&!}uE7& }xE.QAd*M:2UEh(K8[0SCf,O=b4WGj/RBe+N<3VFi)L9]1TDg-P>c5X", 318 f,O=b4WGj/RBe+N<3VFi)L9]1TDg-P>c5XHk!}tM7& }wM.QAd*:2UEh(K8[0SCf,O=b4WGj/RBe\ 319 +N<3VFi)L9]1TDg-P>c5XHk!}uM6{!}xM6{!}t)7&!}w)7&!}u)7& }x).QAd*M:2UEh(K8[0SCf\ 320 ,O=b4WGj/RBe+<3VFi)L9]1TDg-P>c5XHk!}tG7& }wG.QAd*M:2UEh(K8[0SCf,O=b4WGj/RBe+\ 322 RBe+<3VFi)L9]1T", 326 K8[0SCf,O=b4WGj/RBe+<3VFi)L9]1TDg-P>c5XHk!w&MD+j", 331 0SCf,O=b4WGj/RBe+3VFi)L9]1TDg-P", [all …]
|
H A D | sml512.am | 128 3Fi)L9]1TDg-P>c5XHk }u0%I6.QAd*M^2UEh(K8[0SCf,O=b4WGj&JZ/RBe+N<3VFi)L9]1TDg", 136 VFi)L9]1Tg-P>c5XH }w)%I6Y.QAd*M^2UEh(K8[0Cf,O=bWGj&J7Z/RBe+N<3VFi)L9]TDg-P>c\ 144 RBe+N<3VFi)L9]1TDg-P>c5Hk }x2%6Y.QAdM:^2UEh(K8[0SC,O=b4WjJ7Z/RBe+<a3VFi)L9]", 151 -P>c5XH }w%D%I6.QAd*M^2UEh(K8[0Cf,O=bWGj&JZ/RBe+N<3VFi)L9]TDg-P>c5Hk }u%D%I6\ 158 N<a3Fi)L]1TDg-P>5XHk }u/D%I6.QAd*M^2UEh(K8[0Cf,O=bWGj&JZ/RBe+N<3VFi)L9]TDg-P\ 162 VFi)L9]1Dg-P>cXHk }xMDI6Y.QAd*:^2UEh(K8[0SfO=b4WG&7Z/RBeN<a3VFi)" ), 165 WjJ7Z/RB+<a3VFi)L9]1Tg-P>c5XH }w)%I6QAd*M^2UEh(K8[0Cf,O=bWGj&JZ/Be+N<3VFi)L9\ 169 )L9]1Dg-P>cXHk }uG%I6YQAd*M^2Eh(K[0SCf,O=4WGj&J7Z/Be+N<VFi)L91TDg-Pc5XHk }xG\ 172 Fi)L]1Dg-P>5XHk }u2%I6.QAd*M^2UEh(K[0Cf,O=bWGj&JZ/RBe+N<3VFi)L9TDg-P>c5Hk }x\ 177 "O=b4WjJ7Z/RB+<a3Vi)L9]1Tg-P>c5XH }w&%I6QAd*M^2Eh(K8[0Cf,O=bWGj&JZ/Be+N<VFi)\ [all …]
|
H A D | sml512.ck | 22 "i)L9]1TDg-P>5XHk }x/DI6.A*M2UEh(K8[0SCf,O=b4Wj&J7Z/RBe+N<3VFi)L9]1TDg-Pc5XH\ 30 4WGj&J7Z/RBeN<3VFi)L9]1TDg-Pc5XHk }x2%I6Y.QAd*M:^2UhK8[0Cf,O4WGj&J7Z/RBe+Na3\ 31 VFi)L9]1TDg-P>5XHk }t&IY.QAd*M:^2UEh([0SCf,O=b4WGj&7Z/RBe+N<Vi)L9]Dg-P>c5XHk\ 39 I6Y.QAdM^2UEh(K8[0SCf,O=4WGj&ZRe+N<3VFi)L9]1TDg-P" ), 65 RBeN<3VFi)L9]1TDg->5XHk }u2%I6Y.QAd*M:^2U([Sf,4WGj&J7Z/RBeN<3VFi)L9]1TDgPc5X\ 145 U {z*/2UEh(K8[3VFi)L9] {{*/2UEh(K8[3VFi)L9] {zH/h(K8[F)L9] u7x/,O=b4WGj7e+V \ 410 3VFi)L9]1TDg-P>c5XHk }u)M6AMU&J7ZRBeN<3VFi)L9]1TDg-P>c5XHk }x)MMUJ7Z/Be+3VFi\ 430 VFi)L91TDg-P>c5XHk!}t00k!}w00k!}u00k!}x00k!}tN0k!}wN0C", 604 VFi)L9]1TDg-P>c5Hk }uP%I6Y.QAd2UEhK8[0Cf&J7Z/" ), 652 "VFi)L9]1TDg>c5XHk }u2%I6Y.QAd*M:^8[SCf&J7Z/RBe+N<3VFi)L9]1TDg-Pc5XHk }x2%I6\ [all …]
|
/dports/devel/vcglib/vcglib-2020.09/vcg/complex/algorithms/ |
H A D | edge_collapse.h | 276 (*i).f->VFi((*i).z) = c.V(1)->VFi(); 278 c.V(1)->VFi() = (*i).z;
|
/dports/graphics/wdune/wdune-1.926/vcglib/vcg/simplex/face/ |
H A D | topology.h | 722 int fz = f.V(z)->VFi(); in VFDetach() 724 f.V(z)->VFi() = f.VFi(fz); in VFDetach() 728 VFIterator<FaceType> x(f.V(z)->VFp(),f.V(z)->VFi()); in VFDetach() 739 y.f->VFi(y.z) = f.VFi(z); in VFDetach() 754 int z0=v->VFi(); in VFAppend() 757 f->VFi(z)=z0; in VFAppend() 760 v->VFi()=z; in VFAppend()
|