Home
last modified time | relevance | path

Searched refs:arete (Results 1 – 25 of 149) sorted by relevance

123456

/dports/math/cgal/CGAL-5.3/include/CGAL/Surface_mesher/
H A DSurface_mesher_regular_edges.h78 Edge edgevv_to_edge(const EdgeVV& arete) const { in edgevv_to_edge() argument
79 Vertex_handle sommet1 = arete.first; in edgevv_to_edge()
80 Vertex_handle sommet2 = arete.second; in edgevv_to_edge()
96 EdgeVV edge_to_edgevv(const Edge& arete) const { in edge_to_edgevv() argument
97 return make_edgevv(arete.first->vertex(arete.second), in edge_to_edgevv()
98 arete.first->vertex(arete.third) ); in edge_to_edgevv()
130 Facet biggest_incident_facet_in_complex(const Edge& arete) const { in biggest_incident_facet_in_complex() argument
134 Facet_circulator fcirc = SMB::c2t3.incident_facets(arete); in biggest_incident_facet_in_complex()
142 Vertex_handle fev = edge_to_edgevv(arete).first; in biggest_incident_facet_in_complex()
/dports/math/cgal/CGAL-5.3/include/CGAL/Mesh_3/
H A DRefine_facets_manifold_base.h113 Edge edgevv_to_edge(const EdgeVV& arete) const { in edgevv_to_edge() argument
114 Vertex_handle v1 = arete.first; in edgevv_to_edge()
115 Vertex_handle v2 = arete.second; in edgevv_to_edge()
127 EdgeVV edge_to_edgevv(const Edge& arete) const { in edge_to_edgevv() argument
128 return make_edgevv(arete.first->vertex(arete.second), in edge_to_edgevv()
129 arete.first->vertex(arete.third) ); in edge_to_edgevv()
201 Facet biggest_incident_facet_in_complex(const Edge& arete) const { in biggest_incident_facet_in_complex() argument
205 Vertex_handle fev = edge_to_edgevv(arete).first; in biggest_incident_facet_in_complex()
208 << ", " << this->r_tr_.point(arete.first->vertex(arete.third)) in biggest_incident_facet_in_complex()
211 Tr_facet_circulator fcirc = this->r_tr_.incident_facets(arete); in biggest_incident_facet_in_complex()
/dports/graphics/xd3d/xd3d-8.3.1/src/d3d/
H A Dhecht.f1009 reft(arete(1,i))=vide
1010 reft(arete(2,i))=vide
1014 s1=min(arete(1,a),arete(2,a))
1015 s2=max(arete(1,a),arete(2,a))
1024 if(s2.eq.max(arete(1,i),arete(2,i))) then
1069 s1 = arete(1,i)
1094 s2 = max(arete(1,a),arete(2,a))
1117 s2 = max(arete(1,a),arete(2,a))
1175 s1=min(arete(1,a),arete(2,a))
1190 if(nu(i,t).eq.arete(1,a).and.nu(p3(i),t).eq.arete(2,a))
[all …]
/dports/math/freefem++/FreeFem-sources-4.6/src/femlib/
H A Dmortar.cpp236 long * arete = new long[2*nba]; in Mesh() local
251 arete[k++] =number(bedges[i][0])+1; in Mesh()
252 arete[k++] =number(bedges[i][1])+1; in Mesh()
258 long *arete, long nba, long *sd, in Mesh()
262 … mshptg_ (cr, h, c, nu, &nbs, nbs, tri, arete, nba, (long *) sd, nbsd, reft, &nbt, .25, .75, &err); in Mesh()
270 delete [] arete; in Mesh()
H A Dmshptg.cpp242 long *arete, long nba, long *sd, in mshptg8_() argument
317 arete -= 3; in mshptg8_()
1546 arete -= 3; in mshfrt_()
1573 i_2 = arete[(a << 1) + 1], i_3 = arete[(a << 1) + 2]; in mshfrt_()
1576 i_2 = arete[(a << 1) + 1], i_3 = arete[(a << 1) + 2]; in mshfrt_()
1589 i_2 = arete[(i << 1) + 1], i_3 = arete[(i << 1) + 2]; in mshfrt_()
1628 s1 = arete[(i << 1) + 1]; in mshfrt_()
1629 s2 = arete[(i << 1) + 2]; in mshfrt_()
1657 i_2 = arete[(a << 1) + 1], i_3 = arete[(a << 1) + 2]; in mshfrt_()
1687 i_2 = arete[(a << 1) + 1], i_3 = arete[(a << 1) + 2]; in mshfrt_()
[all …]
H A Dfem.cpp1648 arete[k++] =number(bedges[i][0])+1; in BuilTriangles()
1649 arete[k++] =number(bedges[i][1])+1; in BuilTriangles()
1655 long *arete, long nba, long *sd, in BuilTriangles()
1660 delete [] arete; in BuilTriangles()
1690 delete [] arete; in BuilTriangles()
2021 long * arete = new long[2*nba]; in Mesh() local
2038 arete[k++] =number(bedges[i][0])+1; in Mesh()
2039 arete[k++] =number(bedges[i][1])+1; in Mesh()
2060 long *arete, long nba, long *sd, in Mesh()
2076 cout << " " << i+1 << " -- " << arete[2*i] << " " << arete[2*i+1] << endl; in Mesh()
[all …]
/dports/math/maxima/maxima-5.43.2/share/contrib/sarag/
H A DmultiCertificateOfPositivity.mac495 block([k,bool,actif,passif,alpha,a,v,arete,w,Delta,m,N0,L,s,res,value,value_new,N,W,l],
562 block([arete,w,k,c,j,alpha,N,W,w,res,C],
593 block([arete],
594 arete:diam(V),
595 return(deCasteljauarete(V,L,d,min(arete[1],arete[2]),max(arete[1],arete[2]),1/2))
611 block([arete,W,i,n,k,bool,res],
612 arete:diam(V),
620 W:deCasteljauarete(V,L,d,min(arete[1],arete[2]),max(arete[1],arete[2]),i/n),
627 W:deCasteljauarete(V,L,d,min(arete[1],arete[2]),max(arete[1],arete[2]),(n-i)/n),
635 …if i>=n/2 then return(deCasteljauarete(V,L,d,min(arete[1],arete[2]),max(arete[1],arete[2]),1/2)) e…
/dports/cad/opencascade/opencascade-7.6.0/src/SHMessage/
H A DSHAPE.fr90 Petite(s) arete(s) supprimee(s)
93 L'arete n0 %d etait petite, supprimee
99 L'arete etait auto-intersectante, corrigee
105 Insertion d'arete(s) manquante(s)
/dports/french/med/med-4.0.0/doc/gif/
H A DMakefile.am38 ./arete.gif\
79 ./arete.gif\
H A DMakefile.in442 ./arete.gif\
483 ./arete.gif\
/dports/french/med/med-4.0.0/doc/png/
H A DMakefile.am17 ./arete.png \
89 ./arete.png \
H A DMakefile.in421 ./arete.png \
493 ./arete.png \
/dports/cad/opencascade/opencascade-7.6.0/inc/
H A DTopClass_Classifier2d.gxx141 // intersection ligne,arete n'est pas le plus proche
/dports/cad/opencascade/opencascade-7.6.0/src/TopClass/
H A DTopClass_Classifier2d.gxx141 // intersection ligne,arete n'est pas le plus proche
/dports/devel/py-cadquery-pywrap/pywrap-e8c7bc9/opencascade/
H A DTopClass_Classifier2d.gxx137 // intersection ligne,arete n'est pas le plus proche
/dports/math/reduce/Reduce-svn5758-src/packages/solve/
H A Ddesir.red1146 % si la premiere arete a une pente nulle, on va calculer par FROBENIUS
1149 % nadep = numero de la premiere arete a traiter de pente non nulle ;
1294 % l'arete i est definie par :
1297 % ppoly(prof,i) pente de l'arete
1298 % lpoly(prof,i) "longueur" de l'arete : abscisse du sommet droite -
1328 % initialisation de l'arete ik ;
1347 % recherche du point final de l'arete ik ;
/dports/devel/gnulib/gnulib-20140202-stable/
H A Dusers.txt71 newts http://svn.arete.cc/newts/trunk/
/dports/astro/josm/josm-18303/data/validator/
H A Dignoretags.cfg386 K:natural=arete
/dports/www/dooble/dooble-2021.12.05/Dictionaries/gug/
H A Dgug.dic398 arete
/dports/math/giacxcas/giac-1.6.0/src/
H A Dmisc.cc9321 int arete=lxj[k][1]; // edge L[arete]->L[arete+1] in draw_filled_polygon() local
9322 int y1=L[arete][1],y2=L[arete+1][1]; in draw_filled_polygon()
/dports/graphics/blender/blender-2.91.0/release/datafiles/locale/po/
H A Dtr.po9954 msgstr "Sonraki İşarete Geç"
9958 msgstr "Sonraki İşarete Geç"
20895 msgstr "Sonraki İşarete Geç"
22239 msgstr "Sonraki İşarete Geç"
23331 msgstr "Sonraki İşarete Geç"
/dports/misc/darknet/darknet-darknet_yolo_v4_pre/cfg/
H A D9k.names954 arete
/dports/misc/darknet/darknet-darknet_yolo_v4_pre/build/darknet/x64/data/
H A D9k.names954 arete
/dports/devel/aegis/aegis-4.25.D510/debian/
H A Dchangelog5927 * My thanks to Ralph Smith <smith@dc.corp.arete.com> for this change set.
7787 * My thanks to Ralph Smith <smith@dc.corp.arete.com> for this change set.
8655 * My thanks to Ralph Smith <smith@dc.corp.arete.com> for this change set.
8749 * My thanks to Ralph Smith <smith@dc.corp.arete.com> for this change set.
12144 * My thanks to Smith, Ralph <smith@arete-dc.com> for reporting this problem.
12693 * My thanks to Ralph Smith <smith@dc.corp.arete.com> for this change set.
14563 * My thanks to Ralph Smith <smith@arete-dc.com> for reporting this problem.
14623 * My thanks to Ralph Smith <smith@arete-dc.com> for this patch.
/dports/editors/texstudio/texstudio-4.1.2/utilities/dictionaries/
H A Dhr_HR-Croatian.aff3890 SFX SL rti arete strti

123456